Disproving Regularity with Transitivity of Sets

  • Thread starter Thread starter sunmaz94
  • Start date Start date
  • Tags Tags
    Element
Click For Summary
SUMMARY

The discussion revolves around the properties of set membership and the implications of the axiom of regularity within Zermelo-Fraenkel set theory (ZFC). Participants clarify that the notation A ε B indicates that set A is an element of set B, distinct from A being a subset of B. The conversation emphasizes that the transitivity of inclusion does not hold, as demonstrated through counterexamples. Ultimately, the goal is to show that if A ε B, B ε C, and C ε A, then C ε C, which leads to a contradiction, thereby invoking the axiom of regularity.

PREREQUISITES
  • Understanding of Zermelo-Fraenkel set theory (ZFC)
  • Familiarity with set membership notation (A ε B)
  • Knowledge of the axiom of regularity/foundation
  • Concept of transitivity in set inclusion
NEXT STEPS
  • Study the implications of the axiom of regularity in ZFC
  • Explore counterexamples demonstrating non-transitivity of set inclusion
  • Research Bertrand-Russell paradox and its relation to set theory
  • Examine formal proofs involving set membership and inclusion
USEFUL FOR

Mathematicians, logicians, and students of set theory seeking to deepen their understanding of set membership properties and the implications of the axiom of regularity in ZFC.

sunmaz94
Messages
42
Reaction score
0

Homework Statement



Let A, B, and C be sets. Assume the standard ZFC axioms.

Please see below for my updated question.


Thanks.
 
Last edited:
Physics news on Phys.org
A ε B means the set A is a element of the set B, right? That's not the same thing as A being a subset of B. You have sets that are elements of other sets. Try to construct a counterexample.
 
That's what I was afraid of. How then can I show that if A ε B and B ε C and C ε A, that C ε C (yields the contradiction I require).
 
Pick A={a}. Pick B={A}={{a}}. So A ε B. Correct so far? Pick C={B}={{{a}}}. So B ε C. Is A ε C?? This is a little tricky. a is not equal to the set consisting of a.
 
Dick said:
Pick A={a}. Pick B={A}={{a}}. So A ε B. Correct so far? Pick C={B}={{{a}}}. So B ε C. Is A ε C?? This is a little tricky. a is not equal to the set consisting of a.

Yes I understand this. But how does the chain of set inclusions I mention lead to the fact that C ε C?

(Thanks for all your help!)
 
sunmaz94 said:
Yes I understand this. But how does the chain of set inclusions I mention lead to the fact that C ε C?

(Thanks for all your help!)

You seem to have deleted the question. I thought I suggested you try to prove that A ε B and B ε C doesn't necessarily imply A ε C? Since inclusion is not transitive?
 
Dick said:
You seem to have deleted the question. I thought I suggested you try to prove that A ε B and B ε C doesn't necessarily imply A ε C? Since inclusion is not transitive?

I agree. I am now asking modified question: How then can I show that if A ε B and B ε C and C ε A, that C ε C (yields the contradiction I require).

Apologies for the confusion.
 
sunmaz94 said:
I agree. I am now asking modified question: How then can I show that if A ε B and B ε C and C ε A, that C ε C (yields the contradiction I require).

Apologies for the confusion.

I think you are reaching way too far for a contradiction. C ε C puts you squarely in Bertrand-Russell paradox territory. A simple example of A ε B and B ε C with simple sets and A not an element of C will serve nicely. I basically gave you one. Follow it up. It shows inclusion isn't transitive. That's all you need.
 
Dick said:
I think you are reaching way too far for a contradiction. C ε C puts you squarely in Bertrand-Russell paradox territory. A simple example of A ε B and B ε C with simple sets and A not an element of C will serve nicely. I basically gave you one. Follow it up.

This is a separate question. I absolutely want to be in such territory. I need to show that the aforementioned set inclusions yield C ε C and then I can invoke the axiom of regularity/foundation to show it is a contradiction.
 
  • #10
sunmaz94 said:
This is a separate question. I absolutely want to be in such territory. I need to show that the aforementioned set inclusions yield C ε C and then I can invoke the axiom of regularity/foundation to show it is a contradiction.

I don't think so. Inclusion ISN'T transitive. You can't say A ε B and B ε C implies A ε C. At all.
 
  • #11
Dick said:
I don't think so. Inclusion ISN'T transitive. You can't say A ε B and B ε C implies A ε C. At all.

Hmm...

Then how do I go about using the axiom of regularity to prove that no set membership loops like that I described exist?
 
  • #12
sunmaz94 said:
Hmm...

Then how do I go about using the axiom of regularity to prove that no set membership loops like that I described exist?

C ε C violates regularity. But the statement C ε C doesn't follow from anything you've said before because inclusion isn't transitive.
 
  • #13
Dick said:
C ε C already violates regularity. The statement C ε C doesn't follow from anything you've said before because inclusion isn't transitive.

Yes but I want to show that A ε B and B ε C and C ε A violates regularity.
 
  • #14
sunmaz94 said:
Yes but I want to show that A ε B and B ε C and C ε A violates regularity.

Mmm. I'm not all that hot with set axiomatics. But you can simplify that. Suppose A ε B and B ε A, can you show that violates regularity?? Like I say, I don't have ZFC axioms at my fingertips.
 
  • #15
Dick said:
Mmm. I'm not all that hot with set axiomatics. But you can simplify that. Suppose A ε B and B ε A, can you show that violates regularity?? Like I say, I don't have ZFC axioms at my fingertips.

Then I can, but that doesn't help me.

See http://en.wikipedia.org/wiki/Axiom_of_regularity

It states:

Every non-empty set A contains an element B which is disjoint from A.

I appreciate all of your help.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 24 ·
Replies
24
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K