How to prove sup AC = supA supC Proving sup AC = supA supC

  • Thread starter kingwinner
  • Start date
  • Tags
    Ac
In summary, this fact states that if A and C are subsets of R with bounded and strictly positive elements, then the supremum of the set AC is equal to the product of the supremum of A and the supremum of C. To prove this, one can use the least upper bound axiom to show that supA supC is an upper bound for AC. The other direction can be proven by using a sandwich argument and choosing an appropriate value for epsilon.
  • #1
kingwinner
1,270
0
Fact: If A and C are subsets of R, let AC={ac: a E A, c E C}. If A and C are bounded and A and C consist of strictly positive elements only, then sup AC = supA supC.

I am trying to understand and prove this fact, and this is what I've got so far...
A, C bounded => supA, supC exist (by least upper bound axiom)
0<a≤supA for all a E A
0<c≤supC for all c E C
=> 0<ac≤supA supC for all ac E AC
=> supA supC is an upper bound of AC
=> supAC≤supA supC

But how can we prove the other direction? I think we somehow have to use the fact "for all ε>0, there exists a E A such that sup A - ε < a."
At the end, we have to show that for all ε>0, supA supC - ε is NOT an upper bound for AC. But I'm not sure how it is going to work out here in our case.

Does anyone have any idea?
Thanks for any help!
 
Physics news on Phys.org
  • #2
From what you have you know already that for all ε > 0,

[tex](\sup A - \epsilon)(\sup C - \epsilon) < ac \leq \sup AC \leq \sup A \sup C[/tex], where in this case, a and c are some specific elements of A and C, not general ones.

Can you see a sandwich argument approaching here?
 
  • #3
I don't think (supA-ε)(supC-ε)<ac is true for ALL ε>0, e.g. if supA-ε<0, then the inequality is reversed...

Also, at the end, we want to show that for all ε>0, supA supC - ε is NOT an upper bound for AC.
But expanding the LHS of your inequality, we have
supA supC -ε(supA+supC) + ε2, instead of supA supC - ε, how can we fix this?

Thanks!
 
Last edited:
  • #4
kingwinner said:
I don't think (supA-ε)(supC-ε)<ac is true for ALL ε>0, e.g. if supA-ε<0, then the inequality is reversed...
Sorry, my last post should have said “for ε sufficiently small” instead of “all”.
Also, at the end, we want to show that for all ε>0, supA supC - ε is NOT an upper bound for AC.
But expanding the LHS of your inequality, we have
supA supC -ε(supA+supC) + ε2, instead of supA supC - ε, how can we fix this?
Those things are pretty much exactly the same. What is epsilon? A constant greater than zero that we can choose to be arbitrarily small. Realizing this, we can see that
supA supC -ε(supA+supC) + ε2 = supA supC -ε(supA+supC - ε) = supA supC – ε(Some Bounded, Positive Terms)
yields the required result.
 
Last edited:

FAQ: How to prove sup AC = supA supC Proving sup AC = supA supC

What does "sup AC = supA supC" mean?

This is a mathematical notation that shows the supremum (or least upper bound) of the set AC is equal to the product of the supremum of set A and the supremum of set C.

What is the significance of this equation?

This equation is important in understanding the relationship between the supremum of two sets and their product. It can be used in various mathematical proofs and calculations.

How is the supremum of a set determined?

The supremum of a set is the smallest number that is greater than or equal to all the elements in the set. It can be found by taking the limit of the set as the elements approach infinity.

Can this equation be applied to sets of any size?

Yes, this equation is applicable to any sets, regardless of their size. However, the sets must have a supremum for this equation to hold true.

Is this equation reversible?

No, this equation is not reversible. The supremum of a set is a unique value, so the product of two supremums cannot be reversed to determine the individual supremums of each set.

Back
Top