Show that the axiom of choice is equivalent to the following statement.
If \[\space \{A_i\}_{i\in I}\] is any indexed collection of non empty sets, then \[\large X_{i\in I}\small \space A_i=\emptyset\]
\[\large X_{i\in I}\small \space A_i=\large\{\large \cup_{i\in I}\small A_i\small: x(i)\in A_i,i\in I\large\}\]
@zzr0ck3r whats ur problem
Give me a moment while I work on your question!
that should say \[\large X_{i\in I}\small A_i\ne \emptyset\]
I understand the argument I think. If I have a indexed set of non empty sets then for sure the cross product is not empty, and thus I can choose an element from each set. Conversely if I can choose an element from each set in a collection of non empty sets, then surely I can have at least one element in my cross product. How do I make this a formal proof of equivalency...
@zzr0ck3r I was reading about axiom of choice and zorn's theorem yesterday and I didn't know what a partially ordered set was. Will you, sir mr.last year math major, tell me please? =]
I guess I need to know if I need to show reflexivity, transitivity, and symmetry?
if you have some set A then the relation ~ on A is called a partial ordering if for all x,y,z in A you have x~x x~y and y~x implies x =y x~y and y~z imples x~z (A,~) is the partially ordered set
if we have (A,~) then a chain is a subset of A we can call it C such that for each a,b in C a~b or b~a
\[(R,\le)\]is a partially ordered set
if P is the powerset of some set A, then \[(P(A),\large\subset)\] is a partially ordered set
the power set of A, P(A) is the set of all subsets of A
Yes I totally understood.
are you making fun of me?
wat u think son
good now prove the Zorn thing:)
.......
Join our real-time social learning platform and learn together with your friends!