How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Maximal element and greatest element
Definition
Let be a poset (Partial order and partially ordered set) and .
is a maximal element of if no element of is strictly above it: there is no with . Equivalently, for every , if then .
is a greatest element (or maximum) of if for every .
Minimal and least elements are defined dually, reversing every inequality.
Remarks
- Maximal is not greatest, and the difference is the single most common confusion about ordered sets. A maximal element has nothing strictly above it; a greatest element is above everything. In a total order the two coincide, which is why the distinction is invisible to intuition trained on , but a partial order may have many maximal elements and no greatest one. The refutation is FALSE: every maximal element is a greatest element, witnessed by Two maximal elements and no greatest element.
- A greatest element is always maximal, and it is unique when it exists: if and are both greatest then and , so by antisymmetry. Maximal elements need not be unique.
- Zorn's lemma concludes that a maximal element exists, never that a greatest one does (Zorn's lemma). In a particular poset the maximal element it produces may happen to be greatest, since a greatest element is maximal; what Zorn never supplies is a guarantee of greatestness. Every application of Zorn therefore has to be phrased so that maximality is enough, typically by arranging the poset so that a maximal object cannot be extended, which is a statement about nothing being strictly above it.
- Maximality says nothing about comparability: a maximal element may be incomparable to other elements, including to other maximal ones. In Two maximal elements and no greatest element the two maximal elements are incomparable to each other, and in an antichain every element is maximal and is incomparable to all the rest.
Depends on
Used by
- Orthonormal eigenbasis for a compact self adjoint operator Corollary
- (ℕ, ≤) has no maximal element: Zorn's chain hypothesis fails Counterexample
- Two maximal elements and no greatest element Counterexample
- Graded poset, rank function, and rank levels Definition
- Irreducible components of a topological space Definition
- Prime ideals and maximal ideals in a commutative ring Definition
- The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua Definition
- Ultrafilter Definition
- FALSE: every maximal element is a greatest element False statement
- A Noetherian space is a finite union of irreducible closed subsets Lemma
- Existence and basic properties of irreducible components Lemma
- For B ⊆ V the following are equivalent: B is a basis; B is a maximal linearly independent subset of V; B is a minimal spanning subset of V — maximality and minimality being in the inclusion order Lemma
- If some ideal is not finitely generated, there is one maximal among the ideals that are not Lemma
- Linear extensions of a finite poset: existence, prescribed initial ideals, and adjacent-swap connectivity Lemma
- Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma Theorem
- Characterisation of ultrafilters: every set or its complement Theorem
- In a nonzero commutative ring, every proper ideal is contained in a maximal ideal Theorem
- The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter Theorem
- The well-ordering theorem Theorem
- Zorn's lemma Theorem
- Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if L ⊆ S ⊆ V with L independent and span(S) = V, there is a basis B of V with L ⊆ B ⊆ S Theorem
- Zorn's lemma implies the Axiom of Choice Theorem
Dependency tree · one level
1 result within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Greatest element and least element (Wikipedia) (standard reference, not scraped)
- Maximal and minimal elements (Wikipedia) (standard reference, not scraped)
- Partially ordered set (Wikipedia) (standard reference, not scraped)