Is Proof of A Subset of Union of Family Valid?

  • Thread starter Thread starter bubblescript
  • Start date Start date
  • Tags Tags
    Proof
AI Thread Summary
The discussion centers on proving that if a set A belongs to a family of sets F, then A is a subset of the union of F. It establishes that A ⊆ ∪F is equivalent to stating that for every element x in A, there exists a set B in F such that x is also in B. The proof is straightforward, as choosing B to be A itself satisfies the condition. There is some clarification regarding the notation of ∪F, emphasizing that it represents the union of all sets within F. Overall, the conclusion is that the statement holds true under the given definitions and notations.
bubblescript
Messages
14
Reaction score
2

Homework Statement


If ##\mathcal{F}## is a family of sets and ##A \in \mathcal{F}##, then ##A \subseteq \cup \mathcal{F}##.

Homework Equations


##A \subseteq \cup \mathcal{F}## is equivalent to ##\forall x(x \in A \rightarrow \exists B(B \in \mathcal{F} \rightarrow x \in B))##.

The Attempt at a Solution


Suppose ##A \in \mathcal{F}##. Let ##x## be arbitrary and suppose ##x \in A##. Clearly ##\exists B \in \mathcal{F}## is true if we say that ##B=A##. Therefore we conclude that if ##A \in \mathcal{F}##, then ##A \subseteq \cup \mathcal{F}##.
 
Physics news on Phys.org
bubblescript said:

Homework Statement


If ##\mathcal{F}## is a family of sets and ##A \in \mathcal{F}##, then ##A \subseteq \cup \mathcal{F}##.

Homework Equations


##A \subseteq \cup \mathcal{F}## is equivalent to ##\forall x(x \in A \rightarrow \exists B(B \in \mathcal{F} \rightarrow x \in B))##.

The Attempt at a Solution


Suppose ##A \in \mathcal{F}##. Let ##x## be arbitrary and suppose ##x \in A##. Clearly ##\exists B \in \mathcal{F}## is true if we say that ##B=A##. Therefore we conclude that if ##A \in \mathcal{F}##, then ##A \subseteq \cup \mathcal{F}##.
If ##\cup \mathcal{F} = \cup_{B\in \mathcal{F}}B## then yes, ##B=A## does the job.
 
fresh_42 said:
If ##\cup \mathcal{F} = \cup_{B\in \mathcal{F}}B## then yes, ##B=A## does the job.
I'm unfamiliar with that notation. By ##\cup \mathcal{F}## I mean the union of all the sets that are in ##\mathcal{F}##.

In other words ##x \in \cup \mathcal{F}## is equivalent to ##\exists B \in \mathcal{F}( x \in B)##.
 
bubblescript said:
I'm unfamiliar with that notation. By ##\cup \mathcal{F}## I mean the union of all the sets that are in ##\mathcal{F}##.
Yes, that's what I said: $$\cup \mathcal{F}=\bigcup_{B \in \mathcal{F}} B$$
Union of all sets ##B##, i.e. ##\cup B## where all sets from ##\mathcal{F}## are taken, i.e. ##\cup_{B \in \mathcal{F}}B##.

If you simply call a list of sets a family, then ##\cup \mathcal{F}## could have meant ##\{\{B\}\,\vert \,B \in \mathcal{F}\}=\mathcal{F}## in which case the union would be a set of sets, which doesn't contain the single elements of its sets.

The notation ##\cup \mathcal{F}## is a bit sloppy, as it denotes only one set: ##\cup \mathcal{F} = \mathcal{F}##. What you really mean is the union of all sets in ##\mathcal{F}##.

E.g. $$\bigcup_{i=1}^2 A_i = A_1 \cup A_2 = \bigcup_{i \in \{1,2\}}A_i = \bigcup_{A_i \in \{A_1,A_2\}}A_i$$
and the difference to the above case is only that ##\{1,2\}##, resp. ##\{A_1,A_2\}## is replaced by ##\mathcal{F}##.
 
Ok that makes a lot of sense, thanks.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top