WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Transfinite induction

19 passages11 formalized4 partial4 not formalized

Statement only

More ways to filter
Library
ATLAS related only
About this page

This page

  • Wikipedia revision 1355154855, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • Annotated article on WikiLean.
  • 19 passages checked, 34 Lean locations (and 6 related declarations).

Central statements: 9 of the 19 passages state the article's subject or a named result or definition; the other 10 are supporting (examples, setup). Of these 9: 6 formalized, 3 partial.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location on a central or subject passage (22 locations); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 9 of 12 locations and 0 of 3 absences. In all, 31 of 34 Lean locations (91%) and 0 of 3 absences (0%) were re-checked.
  • Passage text: 19 of 19 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1355154855 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. 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 in article · Read it in context on Wikipedia

    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.
  2. 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 in article · Read it in context on Wikipedia

    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.
  3. 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 in article · Read it in context on Wikipedia

    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.
  4. 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 in article · Read it in context on Wikipedia

    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.
  5. 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 in article · Read it in context on Wikipedia

    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.
  6. 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 in article · Read it in context on Wikipedia

    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.
  7. 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 in article · Read it in context on Wikipedia

    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.
  8. 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 in article · Read it in context on Wikipedia

    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.
  9. 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 in article · Read it in context on Wikipedia

    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.
  10. 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 in article · Read it in context on Wikipedia

    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.
  11. 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 in article · Read it in context on Wikipedia

    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.
  12. 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 in article · Read it in context on Wikipedia

    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.
  13. Theorem · main statement · Transfinite recursion

    Formalized

    Formalized by 3 parts together (more general):

    1. Ordinal.limitRecOn_zero Mathlib (proved)
      • at 0 the function takes the given set as its value
    2. 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
    3. 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(λ) = G3(F ↾ λ), for all limit λ ≠ 0.

    Show in article · Read it in context on Wikipedia

    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.
  14. 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 in article · Read it in context on Wikipedia

    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.
  15. 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 in article · Read it in context on Wikipedia

    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).
  16. 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 in article · Read it in context on Wikipedia

    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.
  17. 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 in article · Read it in context on Wikipedia

  18. 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 in article · Read it in context on Wikipedia

    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).
  19. 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 in article · Read it in context on Wikipedia

    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).

Data: view model (JSON) · Literature Links records (JSONL)