Theorem · main statement ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered , and thus a statement that is not universally true for all ordinals must have a minimal counterexample. Show all
WellFoundedLT. induction more general
theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a
Mathlib.Order.RelClasses · lines 339–341
Why more general: The library obtains the principle from the well-foundedness instance of the ordinals, which is the ground the passage names; the proof lives in Lean's type theory, so the particular axiom system the passage points at is not itself an object of the index.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 46af365bc855 · pair key b840d743ae1a.
Related, but states something else (1)
Ordinal. lt_wf related
instance Ordinal.lt_wf : WellFoundedLT Ordinal
Mathlib.SetTheory.Ordinal.Basic · lines 464–466
How it differs: It registers the ordinals as a type with well-founded strict order, the fact the passage says the principle rests on.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 75ae84ba025c · pair key d51b55284907.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered, and thus a statement that is not universally true for all ordinals must have a minimal counterexample. Show all
exists_minimal_of_wellFoundedLT more general
theorem exists_minimal_of_wellFoundedLT {α : Type*} [Preorder α] [WellFoundedLT α] (P : α → Prop) : (∃ a, P a) → ∃ a, Minimal P a
Mathlib.Order.Minimal · lines 226–227
Why more general: Mathlib states it for any preorder whose strict order is well-founded and expresses leastness with its minimality predicate; on the linearly ordered ordinals a minimal failing ordinal is a least one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2ce09a7de5cf · pair key 2f9a13940c9d.
WellFounded. has_min more general
theorem WellFounded.has_min {α : Type*} {r : α → α → Prop} : WellFounded r → ∀ (s : Set α), s.Nonempty → ∃ a ∈ s, ∀ x ∈ s, ¬r x a
Mathlib.Order.WellFounded · lines 86–91
Why more general: The library phrases the conclusion through a nonempty set of elements rather than through a failing property.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 86c93247a995 · pair key 006de8e13d8d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement ✓ Formalized
Formalized: Mathlib states a more general result (proved).
In fact, this principle is also true for arbitrary well-ordered sets , but since any well-ordered set can be indexed by ordinals in an order-preserving way, it suffices to establish the principle for ordinals. Show all
WellFoundedLT. induction more general
theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a
Mathlib.Order.RelClasses · lines 339–341
Why more general: Mathlib states it for any type whose strict order is well-founded, so the linearity carried by the passage's set is not required.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f33b5df1e0cb · pair key 80195243673f.
WellFounded. induction more general
theorem WellFounded.induction {α : Sort u} {r : α → α → Prop} : WellFounded r → ∀ {C : α → Prop} (a : α), (∀ (x : α), (∀ (y : α), r y x → C y) → C x) → C a
Init.WF · lines 92–93
Why more general: The core library states it for an arbitrary relation rather than for an order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 19e92791f9a6 · pair key 5f40443cab32.
Nat. strong_induction_on special case
theorem Nat.strong_induction_on {p : ℕ → Prop} (n : ℕ) : (∀ (n : ℕ), (∀ m < n, p m) → p n) → p n
Mathlib.Data.Nat.Init · lines 253–255
Why a special case: It is the passage's principle for the naturals alone.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1a4b31d3ef9d · pair key 944885b59f8f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
In fact, this principle is also true for arbitrary well-ordered sets, but since any well-ordered set can be indexed by ordinals in an order-preserving way , it suffices to establish the principle for ordinals. Show all
Ordinal. enum exact match
def Ordinal.enum {α : Type u} (r : α → α → Prop) [IsWellOrder α r] : (fun x1 x2 ↦ x1 < x2) ≃r r
Mathlib.SetTheory.Ordinal.Basic · lines 406–407
Note: The ordinals below the order type form the initial segment the passage speaks of, and the map carries each of them to the element it indexes, in both directions respecting the order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 26f9e94e62ce · pair key b3b882993c51.
Ordinal. typein close match
def Ordinal.typein {α : Type u} (r : α → α → Prop) [IsWellOrder α r] : PrincipalSeg r fun x1 x2 ↦ x1 < x2
Mathlib.SetTheory.Ordinal.Basic · lines 337–348
Why close, not exact: The library packages the comparison as an order embedding of the set into the ordinals whose image is cut off at a top ordinal, rather than as a map onto that segment.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2ac30a439f9a · pair key 0fe66512d2d5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · Subject of the article · Overview ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Let P (α ) be a property defined for all ordinals α . Suppose that whenever P (β ) is true for all β < α , then P (α ) is also true.[2] Then P is true for all ordinals. Show all
WellFoundedLT. induction more general
theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a
Mathlib.Order.RelClasses · lines 339–341
Why more general: Mathlib states it for every type with well-founded strict order; the index holds no declaration of the principle written for the ordinals alone.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 05d5a1bca79a · pair key 24e74c1d95f8.
WellFounded. induction more general
theorem WellFounded.induction {α : Sort u} {r : α → α → Prop} : WellFounded r → ∀ {C : α → Prop} (a : α), (∀ (x : α), (∀ (y : α), r y x → C y) → C x) → C a
Init.WF · lines 92–93
Why more general: The core library states induction along an arbitrary relation rather than along the order of the ordinals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 0619366af4a1 · pair key ad37b09aa0de.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Overview ✓ Formalized
Formalized: Mathlib states a more general result (proved).
If P is not true for all ordinals, then there exists an ordinal α such that P (β ) is true for all β < α , but P (α ) is false. Show all
exists_minimal_of_wellFoundedLT more general
theorem exists_minimal_of_wellFoundedLT {α : Type*} [Preorder α] [WellFoundedLT α] (P : α → Prop) : (∃ a, P a) → ∃ a, Minimal P a
Mathlib.Order.Minimal · lines 226–227
Why more general: Mathlib writes minimality as the absence of a smaller failing ordinal, and takes its hypothesis as the existence of a failing ordinal where the passage says the property is not true of all ordinals; passing between the two readings is negation over the linear order of the ordinals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f3bbc5226028 · pair key 387a48def204.
WellFounded. has_min more general
theorem WellFounded.has_min {α : Type*} {r : α → α → Prop} : WellFounded r → ∀ (s : Set α), s.Nonempty → ∃ a ∈ s, ∀ x ∈ s, ¬r x a
Mathlib.Order.WellFounded · lines 86–91
Why more general: The library states minimality as no member of the set lying below the chosen one, where the passage states that the property holds below it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d4360283c5e6 · pair key 7c78f5d2e5be.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Overview ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Such an α is just a minimal counterexample, the existence of which is guaranteed by the fact the class of ordinal numbers is well-ordered. Show all
exists_minimal_of_wellFoundedLT more general
theorem exists_minimal_of_wellFoundedLT {α : Type*} [Preorder α] [WellFoundedLT α] (P : α → Prop) : (∃ a, P a) → ∃ a, Minimal P a
Mathlib.Order.Minimal · lines 226–227
Why more general: The declaration rests on the well-foundedness instance for the ordinals, which is the ground the passage gives for the existence of such an ordinal.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key db2d32de0e5c · pair key 2d1d1d36488c.
Related, but states something else (1)
Ordinal. lt_wf related
instance Ordinal.lt_wf : WellFoundedLT Ordinal
Mathlib.SetTheory.Ordinal.Basic · lines 464–466
How it differs: It registers the well-founded strict order on the ordinals, which the passage names as the guarantee behind the minimal counterexample.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a90c021a0898 · pair key 384769b465e1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Overview › Induction by cases ◔ Partial
Partial: Mathlib states a special case (a definition).
A proof by transfinite induction is often broken down into three cases: Zero case: Prove that P (0) is true. Successor case: Prove that for any successor ordinal α + 1 , P (α + 1) follows from P (α ) (and, if necessary, P (β ) for all β < α ). Limit case: Prove that for any limit ordinal λ , if P (β ) holds for all β < λ , then P (λ ) . Show all
Ordinal. limitRecOn special case
def Ordinal.limitRecOn {motive : Ordinal → Sort*} (o : Ordinal) : motive 0 → ((o : Ordinal) → motive o → motive (o + 1)) → ((o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) → motive o
Mathlib.SetTheory.Ordinal.Arithmetic · lines 154–157
Why a special case: Its successor hypothesis asks for the step from the value at the predecessor alone, so it covers those readings of the passage in which the values below the predecessor are not used.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3c84e27e244d · pair key 6a92abf17f3f.
SuccOrder. limitRecOn special case
def SuccOrder.limitRecOn {α : Type*} (b : α) {motive : α → Sort*} [PartialOrder α] [SuccOrder α] [WellFoundedLT α] : ((a : α) → IsMin a → motive a) → ((a : α) → ¬IsMax a → motive a → motive (Order.succ a)) → ((a : α) → Order.IsSuccLimit a → ((b : α) → b < a → motive b) → motive a) → motive b
Mathlib.Order.SuccPred.Limit · lines 763–765
Why a special case: It singles out the minimal element where the passage names zero, and its successor step likewise may use only the value at the predecessor.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c83dcc650179 · pair key aed876e9b023.
Related, but states something else (1)
WellFoundedLT. induction related
theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a
Mathlib.Order.RelClasses · lines 339–341
How it differs: It is the one-hypothesis form of the principle; getting the passage's three cases out of it needs the separate division of ordinals into zero, successors and limits.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 94fd341cb605 · pair key 4b380679072f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Transfinite recursion ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Transfinite recursion is similar to transfinite induction; however, instead of proving that something holds for all ordinal numbers, we construct a sequence of objects, one for each ordinal. Show all
Ordinal. limitRecOn more general
def Ordinal.limitRecOn {motive : Ordinal → Sort*} (o : Ordinal) : motive 0 → ((o : Ordinal) → motive o → motive (o + 1)) → ((o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) → motive o
Mathlib.SetTheory.Ordinal.Arithmetic · lines 154–157
Why more general: Lean allows the object attached to an ordinal to live in a type depending on that ordinal, and the constant choice is the one the passage describes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f803ec3153ed · pair key de52885103d0.
WellFoundedLT. fix more general
def WellFoundedLT.fix {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Sort*} : ((x : α) → ((y : α) → y < x → motive y) → motive x) → (x : α) → motive x
Mathlib.Order.RelClasses · lines 352–354
Why more general: It is stated for any type whose strict order is well founded, the ordinals being one such type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c91883ad117b · pair key b42b063ac78e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Construction · supporting · Transfinite recursion ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
As an example, a basis for a (possibly infinite-dimensional) vector space can be created by starting with the empty set and for each ordinal α > 0 choosing a vector that is not in the span of the vectors {v β ∣ β < α } . Show all
Module.Basis. ofVectorSpace more general
def Module.Basis.ofVectorSpace (K : Type*) (V : Type*) [DivisionRing K] [AddCommGroup V] [_root_.Module K V] : Module.Basis (↑(Module.Basis.ofVectorSpaceIndex K V)) K V
Mathlib.LinearAlgebra.Basis.VectorSpace · lines 152–153
Why more general: It is stated over a division ring rather than over a field, and the library obtains its index set from a maximal linearly independent set instead of choosing a vector at each stage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 283d4359dd21 · pair key 59ab0fc57175.
Module.Basis. exists_basis more general
theorem Module.Basis.exists_basis (K : Type*) (V : Type*) [DivisionRing K] [AddCommGroup V] [_root_.Module K V] : ∃ s, Nonempty (Module.Basis (↑s) K V)
Mathlib.LinearAlgebra.Basis.VectorSpace · lines 176–177
Why more general: Stated over a division ring, it asserts that some set of vectors of the space carries a basis structure.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ccb3c1b0c9b6 · pair key 682973721791.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Transfinite recursion ◔ Partial
Partial: Mathlib states part of this (proved).
Transfinite Recursion Theorem (version 1). Given a class function[3] G: V → V (where V is the class of all sets), there exists a unique transfinite sequence F: Ord → V (where Ord is the class of all ordinals) such that F (α ) = G (F ↾ α ) for all ordinals α, where ↾ denotes the restriction of F's domain to ordinals < α. Show all
WellFoundedLT. fix_eq states part
theorem WellFoundedLT.fix_eq {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Sort*} (ind : (x : α) → ((y : α) → y < x → motive y) → motive x) (x : α) : WellFoundedLT.fix ind x = ind x fun y x ↦ WellFoundedLT.fix ind y
Mathlib.Order.RelClasses · lines 358–360
Why only part: Lean hands the earlier values to the rule as a family indexed by the smaller ordinals, where the passage speaks of the restriction of F below the ordinal.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ca5326d889c4 · pair key 9c911c2b8a30.
WellFounded. fix_eq states part
theorem WellFounded.fix_eq {α : Sort u} {C : α → Sort v} {r : α → α → Prop} (hwf : WellFounded r) (F : (x : α) → ((y : α) → r y x → C y) → C x) (x : α) : hwf.fix F x = F x fun y x ↦ hwf.fix F y
Init.WF · lines 139–141
Why only part: It is stated for an arbitrary well-founded relation on a type, with the well-foundedness proof an explicit argument.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 3b6ccf53824a · pair key fd82b621ab4a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Transfinite recursion ◔ Partial
Partial: Mathlib states part of this (a definition).
Transfinite Recursion Theorem (version 2). Given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that Show all
Ordinal. limitRecOn states part
def Ordinal.limitRecOn {motive : Ordinal → Sort*} (o : Ordinal) : motive 0 → ((o : Ordinal) → motive o → motive (o + 1)) → ((o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) → motive o
Mathlib.SetTheory.Ordinal.Arithmetic · lines 154–157
Why only part: It supplies the function the theorem asserts to exist, while the three conditions on that function are separate statements.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 340b1aa1fff5 · pair key 57e7192d1664.
Ordinal. limitRecOn_zero states part
theorem Ordinal.limitRecOn_zero {motive : Ordinal → Sort*} (H₁ : motive 0) (H₂ : (o : Ordinal) → motive o → motive (o + 1)) (H₃ : (o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) : Ordinal.limitRecOn 0 H₁ H₂ H₃ = H₁
Mathlib.SetTheory.Ordinal.Arithmetic · lines 160–161
Why only part: It establishes the first of the three conditions for the constructed function, not the whole existence claim.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ed59a6f7b354 · pair key d9c5b52a640d.
Ordinal. limitRecOn_succ states part
theorem Ordinal.limitRecOn_succ {motive : Ordinal → Sort*} (o : Ordinal) (H₁ : motive 0) (H₂ : (o : Ordinal) → motive o → motive (o + 1)) (H₃ : (o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) : Ordinal.limitRecOn (Order.succ o) H₁ H₂ H₃ = H₂ o (Ordinal.limitRecOn o H₁ H₂ H₃)
Deprecated at this commit, in favour of Ordinal. limitRecOn_add_one .
Mathlib.SetTheory.Ordinal.Arithmetic · lines 169–171
Why only part: It establishes the second of the three conditions for the constructed function only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3bfe19add15c · pair key 855a2923067d.
Ordinal. limitRecOn_limit states part
theorem Ordinal.limitRecOn_limit {motive : Ordinal → Sort*} (o : Ordinal) (H₁ : motive 0) (H₂ : (o : Ordinal) → motive o → motive (o + 1)) (H₃ : (o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) (h : Order.IsSuccLimit o) : Ordinal.limitRecOn o H₁ H₂ H₃ = H₃ o h fun x _h ↦ Ordinal.limitRecOn x H₁ H₂ H₃
Mathlib.SetTheory.Ordinal.Arithmetic · lines 174–176
Why only part: It establishes the third of the three conditions for the constructed function only.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e4f7a517c91a · pair key 234129e09df4.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Transfinite recursion ✓ Formalized
Formalized by 3 parts together (more general):
Ordinal. limitRecOn_zero Mathlib (proved) at 0 the function takes the given set as its value Ordinal. limitRecOn_succ Mathlib (proved) at a successor ordinal the value is the second class function applied to the value at the predecessor, for every ordinal Ordinal. limitRecOn_limit Mathlib (proved) at a nonzero limit ordinal the value is the third class function applied to the restriction of the function below that ordinal
Given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈ Ord, F (λ ) = G 3 (F ↾ λ ) , for all limit λ ≠ 0. Show all
Ordinal. limitRecOn_zero states part
theorem Ordinal.limitRecOn_zero {motive : Ordinal → Sort*} (H₁ : motive 0) (H₂ : (o : Ordinal) → motive o → motive (o + 1)) (H₃ : (o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) : Ordinal.limitRecOn 0 H₁ H₂ H₃ = H₁
Mathlib.SetTheory.Ordinal.Arithmetic · lines 160–161
Why only part: Lean states it for an arbitrary family of target types and arbitrary case data, among which the passage's g1, G2 and G3 are one choice.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 345c06a2954e · pair key a3336471e2f3.
Ordinal. limitRecOn_succ states part
theorem Ordinal.limitRecOn_succ {motive : Ordinal → Sort*} (o : Ordinal) (H₁ : motive 0) (H₂ : (o : Ordinal) → motive o → motive (o + 1)) (H₃ : (o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) : Ordinal.limitRecOn (Order.succ o) H₁ H₂ H₃ = H₂ o (Ordinal.limitRecOn o H₁ H₂ H₃)
Deprecated at this commit, in favour of Ordinal. limitRecOn_add_one .
Mathlib.SetTheory.Ordinal.Arithmetic · lines 169–171
Why only part: Lean's successor datum may also depend on the ordinal itself, and the passage's G2 is the choice that ignores it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7b966dc0e4d6 · pair key daa5971be320.
Ordinal. limitRecOn_limit states part
theorem Ordinal.limitRecOn_limit {motive : Ordinal → Sort*} (o : Ordinal) (H₁ : motive 0) (H₂ : (o : Ordinal) → motive o → motive (o + 1)) (H₃ : (o : Ordinal) → Order.IsSuccLimit o → ((o' : Ordinal) → o' < o → motive o') → motive o) (h : Order.IsSuccLimit o) : Ordinal.limitRecOn o H₁ H₂ H₃ = H₃ o h fun x _h ↦ Ordinal.limitRecOn x H₁ H₂ H₃
Mathlib.SetTheory.Ordinal.Arithmetic · lines 174–176
Why only part: Lean's limit datum may also use the ordinal and the proof that it is a limit, and the earlier values reach it as a family indexed by the smaller ordinals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 20739b05ea6f · pair key cbfd1795a8c7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Transfinite recursion ✓ Formalized
Formalized: Lean core states this exactly (a definition).
More generally, one can define objects by transfinite recursion on any well-founded relation R. Show all
WellFounded. fix exact match
def WellFounded.fix {α : Sort u} {C : α → Sort v} {r : α → α → Prop} : WellFounded r → ((x : α) → ((y : α) → r y x → C y) → C x) → (x : α) → C x
Init.WF · lines 135–136
Note: Lean lets the type of the object attached to an element depend on that element, the constant choice being the reading the passage describes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 8a64a5615f65 · pair key be54c792b8f2.
WellFounded. fix_eq exact match
theorem WellFounded.fix_eq {α : Sort u} {C : α → Sort v} {r : α → α → Prop} (hwf : WellFounded r) (F : (x : α) → ((y : α) → r y x → C y) → C x) (x : α) : hwf.fix F x = F x fun y x ↦ hwf.fix F y
Init.WF · lines 139–141
Note: It states the defining equation of the recursion at each element of the relation's domain.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key fffdc04e7492 · pair key 9ed8e2be2598.
WellFoundedLT. fix special case
def WellFoundedLT.fix {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Sort*} : ((x : α) → ((y : α) → y < x → motive y) → motive x) → (x : α) → motive x
Mathlib.Order.RelClasses · lines 352–354
Why a special case: It is the case in which the well-founded relation is the strict order of an ordered type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 05acea34c454 · pair key b50848402700.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Transfinite recursion ✕ Not formalized
More generally, one can define objects by transfinite recursion on any well-founded relation R. (R need not even be a set; it can be a proper class, provided it is a set-like relation; i.e. for any x, the collection of all y such that yRx is a set.) Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 3322430bae05). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
WellFounded. fix related
def WellFounded.fix {α : Sort u} {C : α → Sort v} {r : α → α → Prop} : WellFounded r → ((x : α) → ((y : α) → r y x → C y) → C x) → (x : α) → C x
Init.WF · lines 135–136
How it differs: It is stated for a relation on a type, so neither the proper-class case nor the set-like condition the passage names has a counterpart in it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd. Location key 3ca7d158910f · pair key 5c7306dd6b65.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Construction · supporting · Relationship to the axiom of choice ◔ Partial
Partial: Mathlib states part of this (proved).
The following construction of the Vitali set shows one way that the axiom of choice can be used in a proof by transfinite induction: First, well-order the real numbers (this is where the axiom of choice enters via the well-ordering theorem), giving a sequence ⟨r α ∣ α < β ⟩ , where β is an ordinal with the cardinality of the continuum. Show all
Cardinal. exists_ord_eq states part
theorem Cardinal.exists_ord_eq (α : Type*) : ∃ r, ∃ (x : IsWellOrder α r), (Cardinal.mk α).ord = Ordinal.type r
Mathlib.SetTheory.Ordinal.Basic · lines 990–992
Why only part: The declaration is stated for an arbitrary type and produces the well-order together with the ordinal; naming that ordinal's cardinality as the continuum still needs the separate lemmas on the cardinality of an ordinal and on the cardinality of the reals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3d6f7548bcbe · pair key f1d618b6241d.
WellOrderingRel. isWellOrder states part
instance WellOrderingRel.isWellOrder {α : Type u} : IsWellOrder α WellOrderingRel
Mathlib.SetTheory.Cardinal.Order · lines 527–528
Why only part: This is the choice-powered well-ordering theorem for an arbitrary type, and it says nothing about the length of the resulting enumeration or about the continuum.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 48ed38bc5e9e · pair key 1ac0c55ecc73.
Related, but states something else (1)
Cardinal. mk_real related
theorem Cardinal.mk_real : Cardinal.mk ℝ = Cardinal.continuum
Mathlib.Analysis.Real.Cardinality · lines 185–195
How it differs: It identifies the cardinality of the reals with the continuum, which is what fixes the length of the passage's enumeration, but on its own it asserts nothing about well-ordering or about indexing by ordinals.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 37e80cba38a8 · pair key d72d6ff3df8b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Relationship to the axiom of choice ✕ Not formalized
With community edits: Not formalized. As published it is Partial.
The final v sequence will enumerate the Vitali set. Show all
Related, but states something else (2)
AddSubgroup. exists_isComplement_left related
theorem AddSubgroup.exists_isComplement_left {G : Type*} [AddGroup G] (H : AddSubgroup G) (g : G) : ∃ S, AddSubgroup.IsComplement S ↑H ∧ g ∈ S
Mathlib.GroupTheory.Complement · line 272
Community Agent The pipeline said states part ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: Taken in the reals with the rationals as subgroup, this proves that a set of coset representatives (a Vitali set) exists, built by picking one element from each coset. The passage claims something else: that the sequence from the article's transfinite recursion lists such a set. The declaration says nothing about that recursion or its output, so it is related but does not formalize the passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8e7fadc3be03 · pair key 0c53c1da2f79.
MeasureTheory. vitali_nonmeasurable related
theorem MeasureTheory.vitali_nonmeasurable : ∃ s, ¬MeasureTheory.NullMeasurableSet s MeasureTheory.MeasureSpace.volume
MathlibExt.MeasureTheory.Measure.VitaliNonmeasurable · line 166
How it differs: It asserts that some subset of the reals is not Lebesgue measurable, which is the use the article's construction is usually put to, whereas the passage asserts the coset-representative property of the constructed set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key fdcfb5bc8534 · pair key 4c0beb723bed.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Relationship to the axiom of choice ✕ Not formalized
For inductions and recursions of countable length, the weaker axiom of dependent choice is sufficient. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 76cb3056f613). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Relationship to the axiom of choice ✕ Not formalized
Because there are models of Zermelo–Fraenkel set theory of interest to set theorists that satisfy the axiom of dependent choice but not the full axiom of choice , the knowledge that a particular proof only requires dependent choice can be useful. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 36f2f9de60a3). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗