Order, lattices, ordered algebraic structures Definition
Minimal element
Builds on Partial order
Definition
Let be a partially ordered set and let be a subset of . An element is a minimal element of when no satisfies . Equivalently, for each , implies .
Remarks
It is the maximal element for the reversed order . In under divisibility, the minimal elements are and . A well-founded relation is one in which each nonempty subset has a minimal element.
Reading path
To understand this page from the ground up, read these 16 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Minimal element definition
Where this leads
18 pages build on this one.
- Well-founded relation
- Transfinite induction
- Ordinal arithmetic
- Von Neumann universe
- Ordinal analysis
- Woodin cardinal
- Veblen function
- Axiom of regularity
- Kunen's inconsistency theorem
- Proof-theoretic ordinal
- Ordinal analysis
- Proof-theoretic ordinal
- Normal function
- Gentzen's consistency proof
- Erdős–Rado theorem
- Aleph number
- Von Neumann–Bernays–Gödel set theory
- Beth number
Further reading
About this page
| Tag | 0MCR8ZAXQD |
|---|---|
| URI | m2://0MCR8ZAXQD |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Minimal element |
| Uses | Partial order |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.