Understanding Well-Founded Sets

  • Thread starter Mikemaths
  • Start date
  • Tags
    Sets
In summary, well-foundness is a generalization of well-order and is defined as the relation E on a set where any non-empty subset has an E-minimal element. In the example given, the set d is well-founded because it follows this definition, even though it is not linearly ordered by the relation \in.
  • #1
Mikemaths
23
0
I am struggling to properly understand the concept of a well-founded set.

Is this well founded, d = {{x},{x,y},{x,y,z}}

because there exists an element of d i.e. {x} = e

such that d n e = 0 ?
 
Physics news on Phys.org
  • #2
Well-foundness usually is related to a relation (order).

Well-foundness is generalization of well-order. The difference is that well-order is linear and well-found is not necessary linear, but is partial order.

The definition is:
The relation E on set P is well-founded if any non-empty subset has E-minimal element.
Now, very often the natural order(relation) for sets is belonging [tex]\in[/tex].

So in this case, in your example d is well-founded since any non-empty subset:
1){{x}},2) {{x,y}},3) {{x,y,z}}, 4){{x},{x,y}}, 5){{x},{x,y,z}}, 6){{x,y}, {x,y,z}} , 7){{x},{x,y},{x,y,z}} has a minimal elements such as:
1){x}, 2){x,y}, 3){x,y,z}, 4){x}, {x,y} (since {x} [tex]\notin[/tex] {x,y} 5) {x}, {x,y,z} 6) {x,y} , {x,y,z} 7) {x}, {x,y} {x,y,z}

Notice that [tex]\in[/tex] is partial order on your set d. That is why 4), 5) 6) and 7) have several minimal elements.

So d is well-founded but not well-ordered, since it is not linear ordered by [tex]\in[/tex].
 

1. What is a well-founded set?

A well-founded set is a collection of distinct objects that follows the well-foundedness axiom, which states that every non-empty subset of the set has a minimal element. This means that there is no infinite descending chain of elements within the set.

2. Why is understanding well-founded sets important?

Understanding well-founded sets is important because it is a fundamental concept in mathematics and computer science. It is used to prove the existence of certain mathematical objects and to define recursive algorithms in computer science.

3. How are well-founded sets related to induction?

Well-founded sets are closely related to mathematical induction, which is a proof technique used to prove statements about all natural numbers. In fact, the well-foundedness axiom is equivalent to the principle of mathematical induction.

4. Can infinite sets be well-founded?

Yes, infinite sets can be well-founded. As long as the set follows the well-foundedness axiom, it can be considered a well-founded set. This includes both finite and infinite sets.

5. What are some examples of well-founded sets?

Some examples of well-founded sets include the natural numbers (0, 1, 2, 3...), the set of all finite strings of letters, and the set of all finite trees. These sets follow the well-foundedness axiom and have no infinite descending chains of elements.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
947
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
971
  • Set Theory, Logic, Probability, Statistics
Replies
13
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
863
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
693
Back
Top