Proving that $S_1 \cdot S_2 \in S$

  • MHB
  • Thread starter jakncoke1
  • Start date
In summary, $S$ is a set containing elements that can be operated on using a binary operation $\cdot$. Proving $S_1 \cdot S_2 \in S$ shows that the operation is closed, allowing for further operations. The general approach is to use mathematical techniques to show the operation produces elements in $S$, and specific conditions include $S_1$ and $S_2$ being subsets of $S$ and the operation being well-defined. For example, if $S_1 = \{1, 2, 3\}$ and $S_2 = \{4, 5, 6\}$ with $\cdot$ defined as multiplication, direct proof can be used to show that
  • #1
jakncoke1
48
1
Problem: Let S be the class of functions from $[0, \infty)$ to $[0, \infty)$ such that

1) $S_1 = e^{x} - 1, S_2 = ln(x + 1)$ are in S
2)if f(x), g(x) $\in S$, then f(x)+g(x), f(g(x)) are also in S
3)if f(x), g(x) $\in S$, and f(x) $\geq$ g(x) for $x \geq 0$, then f(x) - g(x) is in S

Prove that if f(x), g(x) $\in S$, then f(x)g(x) $\in S$.
 
Mathematics news on Phys.org
  • #2
This is also quite easy. It borders on realizing log(x) + log(y) = log(xy) and $e^{log(xy)} = xy$.

Assume f(x),g(x) $\in S$, then ln(f(x)+1) + ln(g(x) + 1) $\in S$, since this is just composing functions already in S.ln(f(x)+1) + ln(g(x) + 1) = ln( (f(x) + 1)(g(x) + 1) ) = ln( f(x)g(x) + f(x) + g(x) + 1)

Composing again with $e^{x} - 1$, we get $f(x)g(x) + f(x) + g(x) + 1 - 1 = f(x)g(x) + f(x) + g(x)$.

Since f(x)g(x) $ \geq 0$, f(x)g(x) + f(x) + g(x) $\geq $ f(x) + g(x) for all $x \geq 0$.
so

f(x)g(x) + f(x) + g(x) - f(x) - g(x) = f(x)g(x) $\in S$.

QED
 
  • Like
Likes Wobert

1. How do you define $S$ in the context of proving $S_1 \cdot S_2 \in S$?

$S$ is a set that contains elements that can be operated on using a specific binary operation, denoted by $\cdot$. This operation takes two elements, one from $S_1$ and one from $S_2$, and produces a new element that is also in $S$.

2. What is the significance of proving $S_1 \cdot S_2 \in S$?

Proving that $S_1 \cdot S_2 \in S$ demonstrates that the binary operation defined on $S$ is closed, meaning that it produces elements that are also in the set. This is an important property in mathematics as it allows for further operations to be performed on the elements of $S$.

3. What is the general approach for proving $S_1 \cdot S_2 \in S$?

The general approach for proving $S_1 \cdot S_2 \in S$ is to start with the definition of the binary operation on $S$ and then use mathematical techniques such as induction or direct proof to show that the operation produces elements that are also in $S$.

4. Are there any specific conditions that need to be met in order to prove $S_1 \cdot S_2 \in S$?

Yes, in order for $S_1 \cdot S_2 \in S$ to be true, both $S_1$ and $S_2$ must also be subsets of $S$. Additionally, the binary operation on $S$ must be well-defined, meaning that it produces a unique result for each combination of elements from $S_1$ and $S_2$.

5. Can you provide an example of proving $S_1 \cdot S_2 \in S$?

Sure, let's say we have two sets, $S_1 = \{1, 2, 3\}$ and $S_2 = \{4, 5, 6\}$, and our binary operation $\cdot$ is defined as multiplication. We know that both $S_1$ and $S_2$ are subsets of the set of natural numbers, denoted by $\mathbb{N}$. To prove $S_1 \cdot S_2 \in \mathbb{N}$, we can use direct proof to show that multiplying any element from $S_1$ with an element from $S_2$ will result in a natural number, thus demonstrating that the binary operation is closed on $\mathbb{N}$.

Similar threads

Replies
7
Views
1K
  • General Math
Replies
3
Views
805
  • General Math
Replies
2
Views
875
  • General Math
Replies
3
Views
857
Replies
3
Views
691
Replies
3
Views
227
Replies
2
Views
828
  • General Math
Replies
2
Views
719
  • General Math
Replies
5
Views
884
Replies
3
Views
207
Back
Top