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.
The image of an extremal element is extremal
Statement
Let be a chain-complete poset, progressive, the smallest admissible set, and extremal (Extremal element and its cut (Bourbaki–Witt)). Then is extremal.
Facts & Assumptions
Given: A chain-complete poset , a progressive , the smallest admissible set , an extremal , and an element with .
is extremal: for every with , (Extremal element and its cut (Bourbaki–Witt)).
For every , either or (Everything in is comparable to an extremal element).
is closed under (A smallest admissible set exists).
is progressive: for every (Chain-complete poset).
is a partial order: it is reflexive (), transitive ( and imply ) and antisymmetric ( and imply ), and its strict form means together with (Partial order and partially ordered set).
Proof
because is closed under , so it makes sense to ask whether is extremal.
It suffices to show for the given with , since that is exactly the defining condition.
Comparability at the extremal gives or .
Suppose .
Suppose .
The alternative is impossible: gives with , so together with would force by antisymmetry, contradicting . (Transitivity alone would only give , which is no contradiction; antisymmetry is what is doing the work.) Hence .
In the case , extremality of gives , and progressivity gives , so by transitivity.
In the case , we get , hence by reflexivity.
The relation holds exactly when or , by the definition of the strict order, so the two cases are exhaustive and in both; therefore is extremal.
Remarks
- Step 2.1 is where the comparability lemma earns its place. Without it there would be no way to rule out an element of sitting strictly between and , and such an element would break extremality of immediately.
- Extremality is not a monotonicity condition in disguise. Nothing here assumes preserves order, and the proof never compares of two different elements except through itself.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 10 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Mathlib, Order.BourbakiWitt (standard reference, not scraped)
- Bourbaki-Witt Principle (Menemui Matematik 39(1), 2017) (standard reference, not scraped)
- Bourbaki–Witt theorem (Wikipedia) (standard reference, not scraped)