{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":30461,"passages":[{"absence":null,"basis":"46af365bc855e3370071aaedc94279a069922094202acf82aa86218625c6d2d9","coverage":null,"id":"enwiki-30461-1355154855::In-text #4fb966a4","item":"In-text #4fb966a4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WellFoundedLT.induction","end_line":341,"library":"mathlib","line":339,"location_key":"46af365bc855e3370071aaedc94279a069922094202acf82aa86218625c6d2d9","module":"Mathlib.Order.RelClasses","note":"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.","pair_key":"b840d743ae1ab2581479a498c08b4a60057e6c368f2fb07e2536f104170170e3","path":"Mathlib/Order/RelClasses.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.lt_wf","end_line":466,"library":"mathlib","line":464,"location_key":"75ae84ba025cf73138ffc234d6010c091c42a031a8fbfcaeec5fed7679690130","module":"Mathlib.SetTheory.Ordinal.Basic","note":"It registers the ordinals as a type with well-founded strict order, the fact the passage says the principle rests on.","pair_key":"d51b55284907dbc46d2506f9fedde2e6afbaed04f7dc22f268c3a09a9f65eb1f","path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Ordinal.lt_wf : WellFoundedLT Ordinal"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cd1e9bc3534d0b2ee08b31a9a0e10f8b0ffaa8b690d293e3e613aebfc48c62a7","prominence":"central","quote":{"exact":"Its correctness is a theorem of ZF, and relies on the fact"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"after":{"layer":", and thus a statement that is not universally true for all ordinals must have a minimal counterexample.","segments":[{"text":", and thus a statement that is not universally true for all ordinals must have a minimal counterexample."}]},"layer":"Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered","segments":[{"text":"Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered"}]},"unresolved":null},{"absence":null,"basis":"2ce09a7de5cfdb8cb3c5bffc25b1b6dd2257f273ef968da0c1e7ac89ca27df06","coverage":null,"id":"enwiki-30461-1355154855::In-text #433b98a2","item":"In-text #433b98a2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"exists_minimal_of_wellFoundedLT","end_line":227,"library":"mathlib","line":226,"location_key":"2ce09a7de5cfdb8cb3c5bffc25b1b6dd2257f273ef968da0c1e7ac89ca27df06","module":"Mathlib.Order.Minimal","note":"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.","pair_key":"2f9a13940c9d5818be2ad3c449926ede6a7c9574404d48716d44998e0cca942a","path":"Mathlib/Order/Minimal.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem exists_minimal_of_wellFoundedLT {α : Type*} [Preorder α] [WellFoundedLT α] (P : α → Prop) : (∃ a, P a) → ∃ a, Minimal P a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"WellFounded.has_min","end_line":91,"library":"mathlib","line":86,"location_key":"86c93247a9953c9438f018dcedc0037a0903b74c3e9f843a9467063d66577c95","module":"Mathlib.Order.WellFounded","note":"The library phrases the conclusion through a nonempty set of elements rather than through a failing property.","pair_key":"006de8e13d8d3b26c67a714a9f92deb46284f6e0d5ec215875f84762fef128f7","path":"Mathlib/Order/WellFounded.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem WellFounded.has_min {α : Type*} {r : α → α → Prop} : WellFounded r → ∀ (s : Set α), s.Nonempty → ∃ a ∈ s, ∀ x ∈ s, ¬r x a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2346a90069f8d5316f1ddb4357cea5abcbf8e0ed1d1fbc3402a77e500538b658","prominence":"supporting","quote":{"exact":"a statement that is not universally true for all ordinals must have"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered, and thus ","segments":[{"text":"Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered, and thus "}]},"layer":"a statement that is not universally true for all ordinals must have a minimal counterexample.","segments":[{"text":"a statement that is not universally true for all ordinals must have a minimal counterexample."}]},"unresolved":null},{"absence":null,"basis":"f33b5df1e0cbb77635b6b1e81666c6aef3ffbfa5b55aafb1ca24329aa4d9781c","coverage":null,"id":"enwiki-30461-1355154855::In-text #d06bd434","item":"In-text #d06bd434","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"WellFoundedLT.induction","end_line":341,"library":"mathlib","line":339,"location_key":"f33b5df1e0cbb77635b6b1e81666c6aef3ffbfa5b55aafb1ca24329aa4d9781c","module":"Mathlib.Order.RelClasses","note":"Mathlib states it for any type whose strict order is well-founded, so the linearity carried by the passage's set is not required.","pair_key":"80195243673fd048f60130177b5ca8fa46541287c418287e10b5b0cc54db8455","path":"Mathlib/Order/RelClasses.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"WellFounded.induction","end_line":93,"library":"lean-core","line":92,"location_key":"19e92791f9a69a1ad295a1d2cbaef908e8651b355fa9bdb62ee2b5b0d68d5672","module":"Init.WF","note":"The core library states it for an arbitrary relation rather than for an order.","pair_key":"5f40443cab327da026cd2b53e6455919d6bdbb02fcd9ef1170939344ae9c7a1a","path":"src/Init/WF.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem WellFounded.induction {α : Sort u} {r : α → α → Prop} : WellFounded r → ∀ {C : α → Prop} (a : α), (∀ (x : α), (∀ (y : α), r y x → C y) → C x) → C a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.strong_induction_on","end_line":255,"library":"mathlib","line":253,"location_key":"1a4b31d3ef9d95cead4a8333bd191bc76c2d826dbb02db7b89a538489abbc137","module":"Mathlib.Data.Nat.Init","note":"It is the passage's principle for the naturals alone.","pair_key":"944885b59f8f426f5e6d1513cda79144ff03cc73280947abbab1053da03250b3","path":"Mathlib/Data/Nat/Init.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.strong_induction_on {p : ℕ → Prop} (n : ℕ) : (∀ (n : ℕ), (∀ m < n, p m) → p n) → p n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1bccd04b3765b299b7a4bbc9f292e10b9fe4892b66824348c39b578c0951c348","prominence":"central","quote":{"exact":"In fact, this principle is also true for arbitrary well-ordered sets"},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"after":{"layer":", but since any well-ordered set can be indexed by ordinals in an order-preserving way, it suffices to establish the principle for ordinals.","segments":[{"text":", but since any well-ordered set can be indexed by ordinals in an order-preserving way, it suffices to establish the principle for ordinals."}]},"layer":"In fact, this principle is also true for arbitrary well-ordered sets","segments":[{"text":"In fact, this principle is also true for arbitrary well-ordered sets"}]},"unresolved":null},{"absence":null,"basis":"26f9e94e62ce3ade2a212e394a1e74a4cf2f50788ad28b0c2b46bb75d28288d1","coverage":null,"id":"enwiki-30461-1355154855::In-text #6f8708b0","item":"In-text #6f8708b0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.enum","end_line":407,"library":"mathlib","line":406,"location_key":"26f9e94e62ce3ade2a212e394a1e74a4cf2f50788ad28b0c2b46bb75d28288d1","module":"Mathlib.SetTheory.Ordinal.Basic","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.","pair_key":"b3b882993c51b4b22444092cd24297a15c51c0f83c6c4e3f050bf9d307ac6ea3","path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Ordinal.enum {α : Type u} (r : α → α → Prop) [IsWellOrder α r] : (fun x1 x2 ↦ x1 < x2) ≃r r"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.typein","end_line":348,"library":"mathlib","line":337,"location_key":"2ac30a439f9aaa4f17daac855e15ec7184495cd0b452e5e22942d67c1230f43e","module":"Mathlib.SetTheory.Ordinal.Basic","note":"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.","pair_key":"0fe66512d2d5fcde15f949c240db0f57b30e7943507e27eaacf9b4fe9dce4881","path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Ordinal.typein {α : Type u} (r : α → α → Prop) [IsWellOrder α r] : PrincipalSeg r fun x1 x2 ↦ x1 < x2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"50a12fbd3a7339f7a5ab30776185399cb84226505eb9addd11d69f01c1138974","prominence":"supporting","quote":{"exact":"any well-ordered set can be indexed by ordinals in an order-preserving way"},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"after":{"layer":", it suffices to establish the principle for ordinals.","segments":[{"text":", it suffices to establish the principle for ordinals."}]},"before":{"layer":"In fact, this principle is also true for arbitrary well-ordered sets, but since ","segments":[{"text":"In fact, this principle is also true for arbitrary well-ordered sets, but since "}]},"layer":"any well-ordered set can be indexed by ordinals in an order-preserving way","segments":[{"text":"any well-ordered set can be indexed by ordinals in an order-preserving way"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-30461-1355154855::In-text #e129417f","item":"In-text #e129417f","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"10c9727dae3dc32b24478c3215b0d98ffc3fc6af01f9ce417b39fd49b6361a8b","prominence":"supporting","quote":{"exact":"it suffices to establish the principle for ordinals"},"quote_capped":false,"section":[],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"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, ","segments":[{"text":"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, "}]},"layer":"it suffices to establish the principle for ordinals","segments":[{"text":"it suffices to establish the principle for ordinals"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"05d5a1bca79a71c768d4e817a11f9e9fd63b0739734993eeb870be40f9537f35","coverage":null,"id":"enwiki-30461-1355154855::In-text #b7056452","item":"In-text #b7056452","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"WellFoundedLT.induction","end_line":341,"library":"mathlib","line":339,"location_key":"05d5a1bca79a71c768d4e817a11f9e9fd63b0739734993eeb870be40f9537f35","module":"Mathlib.Order.RelClasses","note":"Mathlib states it for every type with well-founded strict order; the index holds no declaration of the principle written for the ordinals alone.","pair_key":"24e74c1d95f86595c581e9806e4303a542af78334c312db56910cdd7f25af37d","path":"Mathlib/Order/RelClasses.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"WellFounded.induction","end_line":93,"library":"lean-core","line":92,"location_key":"0619366af4a1f99cb18a52e41bbd3662589d3dec83b75c4934045a6fbd3cf1a7","module":"Init.WF","note":"The core library states induction along an arbitrary relation rather than along the order of the ordinals.","pair_key":"ad37b09aa0dee80245827449037534a860abafdf565587a3e4f23355a986dd9a","path":"src/Init/WF.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem WellFounded.induction {α : Sort u} {r : α → α → Prop} : WellFounded r → ∀ {C : α → Prop} (a : α), (∀ (x : α), (∀ (y : α), r y x → C y) → C x) → C a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0ceb1424ef0c0cd0babd9dd3d4e37475d67141ff30e6c1f35e78d1dface20aea","prominence":"subject","quote":{"exact":"Let P ( α ) {\\displaystyle P(\\alpha )} be a property defined"},"quote_capped":true,"section":["Overview"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"Let P ( α ) {\\displaystyle P(\\alpha )} be a property defined for all ordinals α {\\displaystyle \\alpha } . Suppose that whenever P ( β ) {\\displaystyle P(\\beta )} is true for all ⁠ β < α {\\displaystyle \\beta <\\alpha } ⁠, then P ( α ) {\\displaystyle P(\\alpha )} is also true.[2] Then P {\\displaystyle P} is true for all ordinals.","segments":[{"text":"Let "},{"tex":"P(\\alpha )"},{"text":" be a property defined for all ordinals "},{"tex":"\\alpha"},{"text":" . Suppose that whenever "},{"tex":"P(\\beta )"},{"text":" is true for all ⁠ "},{"tex":"\\beta <\\alpha"},{"text":" ⁠, then "},{"tex":"P(\\alpha )"},{"text":" is also true."},{"ref":"[2]"},{"text":" Then "},{"tex":"P"},{"text":" is true for all ordinals."}]},"unresolved":null},{"absence":null,"basis":"f3bbc5226028a2dd14a5afa040d004bc36e22d731d12557a5e331a506addf875","coverage":null,"id":"enwiki-30461-1355154855::In-text #f9fa1476","item":"In-text #f9fa1476","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"exists_minimal_of_wellFoundedLT","end_line":227,"library":"mathlib","line":226,"location_key":"f3bbc5226028a2dd14a5afa040d004bc36e22d731d12557a5e331a506addf875","module":"Mathlib.Order.Minimal","note":"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.","pair_key":"387a48def2042df1474d3027e41b65aa19c2f25dc434911d6d431834be4f2bfc","path":"Mathlib/Order/Minimal.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem exists_minimal_of_wellFoundedLT {α : Type*} [Preorder α] [WellFoundedLT α] (P : α → Prop) : (∃ a, P a) → ∃ a, Minimal P a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WellFounded.has_min","end_line":91,"library":"mathlib","line":86,"location_key":"d4360283c5e6beb9c92bea882ab792e6563873d0f9f705accaf80cca78c26c00","module":"Mathlib.Order.WellFounded","note":"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.","pair_key":"7c78f5d2e5be1a47af780e4242932d54be3d60c1f30eacae858c7e7caf2ac787","path":"Mathlib/Order/WellFounded.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem WellFounded.has_min {α : Type*} {r : α → α → Prop} : WellFounded r → ∀ (s : Set α), s.Nonempty → ∃ a ∈ s, ∀ x ∈ s, ¬r x a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bec1d219a59ad45475c106ae45f5de87d06c6de55f11f87b83eb18f6c04ff90e","prominence":"supporting","quote":{"exact":"If ⁠ P {\\displaystyle P} ⁠ is not true for all ordinals,"},"quote_capped":true,"section":["Overview"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"If ⁠ P {\\displaystyle P} ⁠ is not true for all ordinals, then there exists an ordinal ⁠ α {\\displaystyle \\alpha } ⁠ such that ⁠ P ( β ) {\\displaystyle P(\\beta )} ⁠ is true for all ⁠ β < α {\\displaystyle \\beta <\\alpha } ⁠, but ⁠ P ( α ) {\\displaystyle P(\\alpha )} ⁠ is false.","segments":[{"text":"If ⁠ "},{"tex":"P"},{"text":" ⁠ is not true for all ordinals, then there exists an ordinal ⁠ "},{"tex":"\\alpha"},{"text":" ⁠ such that ⁠ "},{"tex":"P(\\beta )"},{"text":" ⁠ is true for all ⁠ "},{"tex":"\\beta <\\alpha"},{"text":" ⁠, but ⁠ "},{"tex":"P(\\alpha )"},{"text":" ⁠ is false."}]},"unresolved":null},{"absence":null,"basis":"db2d32de0e5c19cb2ac096c0ffe180e52d76f368cf89ff785c6138cbe2d7f1b7","coverage":null,"id":"enwiki-30461-1355154855::In-text #ceda9865","item":"In-text #ceda9865","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"exists_minimal_of_wellFoundedLT","end_line":227,"library":"mathlib","line":226,"location_key":"db2d32de0e5c19cb2ac096c0ffe180e52d76f368cf89ff785c6138cbe2d7f1b7","module":"Mathlib.Order.Minimal","note":"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.","pair_key":"2d1d1d36488c0d27b986a155d2a697e976e9eafe3b242e96517db1c27d461821","path":"Mathlib/Order/Minimal.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem exists_minimal_of_wellFoundedLT {α : Type*} [Preorder α] [WellFoundedLT α] (P : α → Prop) : (∃ a, P a) → ∃ a, Minimal P a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.lt_wf","end_line":466,"library":"mathlib","line":464,"location_key":"a90c021a0898abb37b71242a2047f39339d662fb98522e9a7af4161ade36946f","module":"Mathlib.SetTheory.Ordinal.Basic","note":"It registers the well-founded strict order on the ordinals, which the passage names as the guarantee behind the minimal counterexample.","pair_key":"384769b465e1d860b7e697782fcc9e52467bcc420f52d8f48b39fff3a8095c6a","path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Ordinal.lt_wf : WellFoundedLT Ordinal"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6faea01d703ee012dcd9be5f42b506f0750b69ae966db1bc8d364d9bd620e6f3","prominence":"supporting","quote":{"exact":"Such an ⁠ α {\\displaystyle \\alpha } ⁠ is just a minimal"},"quote_capped":true,"section":["Overview"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"Such an ⁠ α {\\displaystyle \\alpha } ⁠ is just a minimal counterexample, the existence of which is guaranteed by the fact the class of ordinal numbers is well-ordered.","segments":[{"text":"Such an ⁠ "},{"tex":"\\alpha"},{"text":" ⁠ is just a minimal counterexample, the existence of which is guaranteed by the fact the class of ordinal numbers is well-ordered."}]},"unresolved":null},{"absence":null,"basis":"3c84e27e244d6975e08d139e05eb517b2489eb3afece56af4152d1606d8daf77","coverage":null,"id":"enwiki-30461-1355154855::In-text #12792a25","item":"In-text #12792a25","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn","end_line":157,"library":"mathlib","line":154,"location_key":"3c84e27e244d6975e08d139e05eb517b2489eb3afece56af4152d1606d8daf77","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"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.","pair_key":"6a92abf17f3fd660967868f12927568a48c0ee12310fd533e39844f1915dcc59","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"SuccOrder.limitRecOn","end_line":765,"library":"mathlib","line":763,"location_key":"c83dcc650179d0e1a168e99c482b47760ec5cd950d3fc17ae92e998a158b4dfd","module":"Mathlib.Order.SuccPred.Limit","note":"It singles out the minimal element where the passage names zero, and its successor step likewise may use only the value at the predecessor.","pair_key":"aed876e9b0234779ac23cef2304ff64d0dfa79cb06f5aaff62174e194cd5d1af","path":"Mathlib/Order/SuccPred/Limit.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WellFoundedLT.induction","end_line":341,"library":"mathlib","line":339,"location_key":"94fd341cb60529c1c3f886b15e81c3d403904b934f41fbc8d3c6e20d24adbb82","module":"Mathlib.Order.RelClasses","note":"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.","pair_key":"4b380679072f1a8125fec7cc89c76cfb437258af623797495494800701cf4118","path":"Mathlib/Order/RelClasses.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem WellFoundedLT.induction {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Prop} (a : α) : (∀ (x : α), (∀ y < x, motive y) → motive x) → motive a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"193a1824e2bdabd79deb1c1aeca913f473dea336b9a398f4ecaf354bb01672b1","prominence":"central","quote":{"exact":"Zero case: Prove that P ( 0 ) {\\displaystyle P(0)} is true."},"quote_capped":true,"section":["Overview","Induction by cases"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"A proof by transfinite induction is often broken down into three cases: ","lead_in":true,"segments":[{"text":"A proof by transfinite induction is often broken down into three cases: "}]},"layer":"Zero case: Prove that P ( 0 ) {\\displaystyle P(0)} is true. Successor case: Prove that for any successor ordinal α + 1 {\\displaystyle \\alpha +1} , P ( α + 1 ) {\\displaystyle P(\\alpha +1)} follows from P ( α ) {\\displaystyle P(\\alpha )} (and, if necessary, P ( β ) {\\displaystyle P(\\beta )} for all β < α {\\displaystyle \\beta <\\alpha } ). Limit case: Prove that for any limit ordinal λ {\\displaystyle \\lambda } , if P ( β ) {\\displaystyle P(\\beta )} holds for all β < λ {\\displaystyle \\beta <\\lambda } , then P ( λ ) {\\displaystyle P(\\lambda )} .","segments":[{"text":"Zero case: Prove that "},{"tex":"P(0)"},{"text":" is true. Successor case: Prove that for any successor ordinal "},{"tex":"\\alpha +1"},{"text":" , "},{"tex":"P(\\alpha +1)"},{"text":" follows from "},{"tex":"P(\\alpha )"},{"text":" (and, if necessary, "},{"tex":"P(\\beta )"},{"text":" for all "},{"tex":"\\beta <\\alpha"},{"text":" ). Limit case: Prove that for any limit ordinal "},{"tex":"\\lambda"},{"text":" , if "},{"tex":"P(\\beta )"},{"text":" holds for all "},{"tex":"\\beta <\\lambda"},{"text":" , then "},{"tex":"P(\\lambda )"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"f803ec3153edd0ff7440920575b8439af8e3f5606a9df2bbd3ca0adb86e3f23a","coverage":null,"id":"enwiki-30461-1355154855::In-text #76e00ee1","item":"In-text #76e00ee1","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn","end_line":157,"library":"mathlib","line":154,"location_key":"f803ec3153edd0ff7440920575b8439af8e3f5606a9df2bbd3ca0adb86e3f23a","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"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.","pair_key":"de52885103d013807cc988d271d888a42b5201a01f68cdce17ac4ed5ee171f9f","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WellFoundedLT.fix","end_line":354,"library":"mathlib","line":352,"location_key":"c91883ad117b145393ba72e087ff9ae6d95d4ff20240a0159d11953ce557e4b9","module":"Mathlib.Order.RelClasses","note":"It is stated for any type whose strict order is well founded, the ordinals being one such type.","pair_key":"b42b063ac78e87b2ab589a67f73ccdfcabcf751a3d657ddd64ed4a80c4d2541d","path":"Mathlib/Order/RelClasses.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def WellFoundedLT.fix {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Sort*} : ((x : α) → ((y : α) → y < x → motive y) → motive x) → (x : α) → motive x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0dc6c64aa984cd908e09d39549370d93fd792e19d1573af32f751267ce4674fe","prominence":"central","quote":{"exact":"however, instead of proving that something holds for all ordinal numbers, we"},"quote_capped":true,"section":["Transfinite recursion"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"Transfinite recursion is similar to transfinite induction; ","segments":[{"text":"Transfinite recursion is similar to transfinite induction; "}]},"layer":"however, instead of proving that something holds for all ordinal numbers, we construct a sequence of objects, one for each ordinal.","segments":[{"text":"however, instead of proving that something holds for all ordinal numbers, we construct a sequence of objects, one for each ordinal."}]},"unresolved":null},{"absence":null,"basis":"283d4359dd219af6977433809aa8a4ed6a0d2e87e7838554043544c2ac03d8b4","coverage":null,"id":"enwiki-30461-1355154855::In-text #d24a7acd","item":"In-text #d24a7acd","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Module.Basis.ofVectorSpace","end_line":153,"library":"mathlib","line":152,"location_key":"283d4359dd219af6977433809aa8a4ed6a0d2e87e7838554043544c2ac03d8b4","module":"Mathlib.LinearAlgebra.Basis.VectorSpace","note":"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.","pair_key":"59ab0fc57175be7273b1770cf7e1255e0209e5b63853ec88f111569588efb837","path":"Mathlib/LinearAlgebra/Basis/VectorSpace.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Module.Basis.exists_basis","end_line":177,"library":"mathlib","line":176,"location_key":"ccb3c1b0c9b64c6f21660f7b9843b1f5fc74d0ea450b44fab7d2ca85eec770db","module":"Mathlib.LinearAlgebra.Basis.VectorSpace","note":"Stated over a division ring, it asserts that some set of vectors of the space carries a basis structure.","pair_key":"682973721791cd72b5a2d5d105fc9d7f5fa6ae5f3b626903f43cb2d6739db15a","path":"Mathlib/LinearAlgebra/Basis/VectorSpace.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Module.Basis.exists_basis (K : Type*) (V : Type*) [DivisionRing K] [AddCommGroup V] [_root_.Module K V] : ∃ s, Nonempty (Module.Basis (↑s) K V)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bfb010c0394099b241eae6d9d6844d5cb4a473864994174bf8f289a5d3d2e6b5","prominence":"supporting","quote":{"exact":"As an example, a basis for a (possibly infinite-dimensional) vector space can"},"quote_capped":true,"section":["Transfinite recursion"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"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 β ∣ β < α } {\\displaystyle \\{v_{\\beta }\\mid \\beta <\\alpha \\}} .","segments":[{"text":"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 "},{"tex":"\\{v_{\\beta }\\mid \\beta <\\alpha \\}"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"ca5326d889c46ceb5e9d00e76595ff4176977967139233dd23e5ea061e53fd9d","coverage":null,"id":"enwiki-30461-1355154855::In-text #22dcf083","item":"In-text #22dcf083","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"WellFoundedLT.fix_eq","end_line":360,"library":"mathlib","line":358,"location_key":"ca5326d889c46ceb5e9d00e76595ff4176977967139233dd23e5ea061e53fd9d","module":"Mathlib.Order.RelClasses","note":"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.","pair_key":"9c911c2b8a3047801cebc21a71a6219db7d073f4d84f0c32802506beec00a1b3","path":"Mathlib/Order/RelClasses.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"WellFounded.fix_eq","end_line":141,"library":"lean-core","line":139,"location_key":"3b6ccf53824a2f85c592475ed62e41a013cd279322c6f6e0e2f45b5331705701","module":"Init.WF","note":"It is stated for an arbitrary well-founded relation on a type, with the well-foundedness proof an explicit argument.","pair_key":"fd82b621ab4a95a0a9cda011da4697820b535ab55d334a23b6e70d17b74670f0","path":"src/Init/WF.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ee960412d3b55fc4e96253fec0682ae324b1bed27ed65487bd44f37e2dd956c2","prominence":"central","quote":{"exact":"Transfinite Recursion Theorem (version 1). Given a class function[3] G: V →"},"quote_capped":true,"section":["Transfinite recursion"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"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 ↾ α ) {\\displaystyle F(\\alpha )=G(F\\upharpoonright \\alpha )} for all ordinals α, where ↾ {\\displaystyle \\upharpoonright } denotes the restriction of F's domain to ordinals < α.","segments":[{"text":"Transfinite Recursion Theorem (version 1). Given a class function"},{"ref":"[3]"},{"text":" 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 "},{"tex":"F(\\alpha )=G(F\\upharpoonright \\alpha )"},{"text":" for all ordinals α, where "},{"tex":"\\upharpoonright"},{"text":" denotes the restriction of F's domain to ordinals < α."}]},"unresolved":null},{"absence":null,"basis":"340b1aa1fff508d72acf5f4ea7c7deea1e2f58b3e05cd6fcc8438a77eb39c39c","coverage":null,"id":"enwiki-30461-1355154855::In-text #9226413d","item":"In-text #9226413d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn","end_line":157,"library":"mathlib","line":154,"location_key":"340b1aa1fff508d72acf5f4ea7c7deea1e2f58b3e05cd6fcc8438a77eb39c39c","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"It supplies the function the theorem asserts to exist, while the three conditions on that function are separate statements.","pair_key":"57e7192d16645ce22532c64553d4c1c47978cc397679ed66e0e3781a3633a38a","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn_zero","end_line":161,"library":"mathlib","line":160,"location_key":"ed59a6f7b35499cba8ad15c71605f8ad6e57917100a89e7fc1a2fb1bf16cc0f9","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"It establishes the first of the three conditions for the constructed function, not the whole existence claim.","pair_key":"d9c5b52a640d634a8a680671201ab71cac1c7ee8cab1cca53c27acaad3747db5","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₁"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn_succ","end_line":171,"library":"mathlib","line":169,"location_key":"3bfe19add15cdc9ed99f3868ecf7e70735b08619089760c4d9829938607ac4fe","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"It establishes the second of the three conditions for the constructed function only.","pair_key":"855a2923067de083f408f1f4a7fa6fa1b28e28b9f75c6c297ef12ee7c83e8841","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Ordinal.limitRecOn_add_one","elided":false,"text":"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₃)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn_limit","end_line":176,"library":"mathlib","line":174,"location_key":"e4f7a517c91a0b9ae2d419f2b4a2e0e34b252db7f3ea8c50276f55c561a7a330","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"It establishes the third of the three conditions for the constructed function only.","pair_key":"234129e09df440c32769fcd35a2ba7d0228e0c3fedfd23202d27345323ac7330","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₃"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5a616597cd36619cf54d29ecb30b0ce9b404c178c1558cc87133d2aee883d4f8","prominence":"central","quote":{"exact":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions"},"quote_capped":true,"section":["Transfinite recursion"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that","segments":[{"text":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"555f3c57576e0453f9477d1c418bce09af47ee7f598a87a7e7244076c4d14987","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"345c06a2954e15f675fb517d4a65cc05c739ce05378fb0b8d033970fae846906","text":"at 0 the function takes the given set as its value"},{"id":"c2","part":"7b966dc0e4d65e159ae88895605b098bda5b70f7dedaf110ea0f70d1f93bc8e2","text":"at a successor ordinal the value is the second class function applied to the value at the predecessor, for every ordinal"},{"id":"c3","part":"20739b05ea6fda55424820c7c6d306b4a4445b58f8fb2f04675dc1c3dc38a182","text":"at a nonzero limit ordinal the value is the third class function applied to the restriction of the function below that ordinal"}],"parts":["345c06a2954e15f675fb517d4a65cc05c739ce05378fb0b8d033970fae846906","7b966dc0e4d65e159ae88895605b098bda5b70f7dedaf110ea0f70d1f93bc8e2","20739b05ea6fda55424820c7c6d306b4a4445b58f8fb2f04675dc1c3dc38a182"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-30461-1355154855::In-text #71a86c27","item":"In-text #71a86c27","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn_zero","end_line":161,"library":"mathlib","line":160,"location_key":"345c06a2954e15f675fb517d4a65cc05c739ce05378fb0b8d033970fae846906","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"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.","pair_key":"a3336471e2f357c7c0633f6d1f141faf75c2cbfb39509e4c60db2cd34e791a3c","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₁"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn_succ","end_line":171,"library":"mathlib","line":169,"location_key":"7b966dc0e4d65e159ae88895605b098bda5b70f7dedaf110ea0f70d1f93bc8e2","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"Lean's successor datum may also depend on the ordinal itself, and the passage's G2 is the choice that ignores it.","pair_key":"daa5971be320292fd367079e87a44058ac128029b01acb01640e099a22581306","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Ordinal.limitRecOn_add_one","elided":false,"text":"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₃)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ordinal.limitRecOn_limit","end_line":176,"library":"mathlib","line":174,"location_key":"20739b05ea6fda55424820c7c6d306b4a4445b58f8fb2f04675dc1c3dc38a182","module":"Mathlib.SetTheory.Ordinal.Arithmetic","note":"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.","pair_key":"cbfd1795a8c73d4d51e60732139dd81dc087173f221cf9dbe76cc50d212c8860","path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₃"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"485d128eb649d074c4d4fb449763b3385219b76bc4df9f04e0dc09212feaebfc","prominence":"central","quote":{"exact":"F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈"},"quote_capped":true,"section":["Transfinite recursion"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"Given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that ","lead_in":true,"segments":[{"text":"Given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that "}]},"layer":"F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈ Ord, F ( λ ) = G 3 ( F ↾ λ ) {\\displaystyle F(\\lambda )=G_{3}(F\\upharpoonright \\lambda )} , for all limit λ ≠ 0.","segments":[{"text":"F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈ Ord, "},{"tex":"F(\\lambda )=G_{3}(F\\upharpoonright \\lambda )"},{"text":" , for all limit λ ≠ 0."}]},"unresolved":null},{"absence":null,"basis":"8a64a5615f654e282ebef3c9b76e99fbe017d28c3e15f09e35277d12b1eda94c","coverage":null,"id":"enwiki-30461-1355154855::In-text #e9fdadef","item":"In-text #e9fdadef","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"WellFounded.fix","end_line":136,"library":"lean-core","line":135,"location_key":"8a64a5615f654e282ebef3c9b76e99fbe017d28c3e15f09e35277d12b1eda94c","module":"Init.WF","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.","pair_key":"be54c792b8f2bc0ed3636f5e6733f1e05906521625475229148c840db1ce0cbc","path":"src/Init/WF.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def WellFounded.fix {α : Sort u} {C : α → Sort v} {r : α → α → Prop} : WellFounded r → ((x : α) → ((y : α) → r y x → C y) → C x) → (x : α) → C x"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"WellFounded.fix_eq","end_line":141,"library":"lean-core","line":139,"location_key":"fffdc04e7492f2723bb2734cbdc28e07ac5315e830d6c5de15fcd6ec7d6510fe","module":"Init.WF","note":"It states the defining equation of the recursion at each element of the relation's domain.","pair_key":"9ed8e2be25982e166f44f1620d29e52d5b75a8dc8fc527c151f16c87f27185b8","path":"src/Init/WF.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"WellFoundedLT.fix","end_line":354,"library":"mathlib","line":352,"location_key":"05acea34c454d574c5a0b284c598ea4fa18073c3a9e738ea789f6c8395ce6272","module":"Mathlib.Order.RelClasses","note":"It is the case in which the well-founded relation is the strict order of an ordered type.","pair_key":"b50848402700057abc2fe4bd6c8a78543bb1c4f4081ea1ea021fdb92657fe1f9","path":"Mathlib/Order/RelClasses.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def WellFoundedLT.fix {α : Type u} [LT α] [WellFoundedLT α] {motive : α → Sort*} : ((x : α) → ((y : α) → y < x → motive y) → motive x) → (x : α) → motive x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dec6c563146139c9c0d0a00adc15916fae7750eeffa9c38a6c8584a5986d5b54","prominence":"central","quote":{"exact":"More generally, one can define objects by transfinite recursion on any well-founded"},"quote_capped":true,"section":["Transfinite recursion"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"More generally, one can define objects by transfinite recursion on any well-founded relation R.","segments":[{"text":"More generally, one can define objects by transfinite recursion on any well-founded relation R."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"3322430bae052eeb175246a0f90e4c28dfa92e47456e32e4724d7a12fa02a870"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-30461-1355154855::In-text #7171eca3","item":"In-text #7171eca3","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"WellFounded.fix","end_line":136,"library":"lean-core","line":135,"location_key":"3ca7d158910f84822000e1e9888f149651f3c529191a95f4223c31e5eb9e6676","module":"Init.WF","note":"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.","pair_key":"5c7306dd6b65322de557b97cfa784aa3aa173a429f352cfd70f43079656ba03c","path":"src/Init/WF.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def WellFounded.fix {α : Sort u} {C : α → Sort v} {r : α → α → Prop} : WellFounded r → ((x : α) → ((y : α) → r y x → C y) → C x) → (x : α) → C x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a4f0d41fc47f19e0e8696411dcf6ec2ef087c101cbcfba761989294e9cb3ce07","prominence":"supporting","quote":{"exact":"(R need not even be a set; it can be a proper"},"quote_capped":true,"section":["Transfinite recursion"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"More generally, one can define objects by transfinite recursion on any well-founded relation R. ","segments":[{"text":"More generally, one can define objects by transfinite recursion on any well-founded relation R. "}]},"layer":"(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.)","segments":[{"text":"(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.)"}]},"unresolved":null},{"absence":null,"basis":"3d6f7548bcbecb749363016c8464d4c44c71d269033fac9dec56f8e0b1e1f5f6","coverage":null,"id":"enwiki-30461-1355154855::In-text #c3f67a19","item":"In-text #c3f67a19","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.exists_ord_eq","end_line":992,"library":"mathlib","line":990,"location_key":"3d6f7548bcbecb749363016c8464d4c44c71d269033fac9dec56f8e0b1e1f5f6","module":"Mathlib.SetTheory.Ordinal.Basic","note":"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.","pair_key":"f1d618b6241dc5327f9455015596b03d9e9ce3ae729b679704f1bbe471b6b668","path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.exists_ord_eq (α : Type*) : ∃ r, ∃ (x : IsWellOrder α r), (Cardinal.mk α).ord = Ordinal.type r"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"WellOrderingRel.isWellOrder","end_line":528,"library":"mathlib","line":527,"location_key":"48ed38bc5e9ee160eaceaf91d568ef0db762e63b23d25faeea3ec35c3143e23e","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"1ac0c55ecc732fdaeeaba960ddc6ae55651cd38552052bc2b98926f4864d3654","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance WellOrderingRel.isWellOrder {α : Type u} : IsWellOrder α WellOrderingRel"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_real","end_line":195,"library":"mathlib","line":185,"location_key":"37e80cba38a848a35018cb0f3e69bc09e5e2aabf3ff606a74f4266ca5f2469f2","module":"Mathlib.Analysis.Real.Cardinality","note":"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.","pair_key":"d72d6ff3df8b4f918700f894584f7f9c04754d68480d244170c723b04d66e805","path":"Mathlib/Analysis/Real/Cardinality.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_real : Cardinal.mk ℝ = Cardinal.continuum"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bc8512486a78ade87b74d9402bd2eb0eb25ad928a6893d0ddac018160bfecccc","prominence":"supporting","quote":{"exact":"First, well-order the real numbers (this is where the axiom of choice"},"quote_capped":true,"section":["Relationship to the axiom of choice"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"before":{"layer":"The following construction of the Vitali set shows one way that the axiom of choice can be used in a proof by transfinite induction: ","lead_in":true,"segments":[{"text":"The following construction of the Vitali set shows one way that the axiom of choice can be used in a proof by transfinite induction: "}]},"layer":"First, well-order the real numbers (this is where the axiom of choice enters via the well-ordering theorem), giving a sequence ⟨ r α ∣ α < β ⟩ {\\displaystyle \\langle r_{\\alpha }\\mid \\alpha <\\beta \\rangle } , where β is an ordinal with the cardinality of the continuum.","segments":[{"text":"First, well-order the real numbers (this is where the axiom of choice enters via the well-ordering theorem), giving a sequence "},{"tex":"\\langle r_{\\alpha }\\mid \\alpha <\\beta \\rangle"},{"text":" , where β is an ordinal with the cardinality of the continuum."}]},"unresolved":null},{"absence":null,"basis":"8e7fadc3be03faf2647dc29790c4e6de537a55a62a1378f7f7345dfb931c0ee3","coverage":null,"id":"enwiki-30461-1355154855::In-text #48f47485","item":"In-text #48f47485","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"AddSubgroup.exists_isComplement_left","end_line":272,"library":"mathlib","line":272,"location_key":"8e7fadc3be03faf2647dc29790c4e6de537a55a62a1378f7f7345dfb931c0ee3","module":"Mathlib.GroupTheory.Complement","note":"The declaration is stated for an arbitrary additive group and subgroup; Mathlib's own characterisation of a complement rewrites the conclusion as one representative per coset, and nothing in it refers to the recursion the article performs.","pair_key":"0c53c1da2f7963620621cb76211e890495168f2046f9b62db3e74b74db95cdb1","path":"Mathlib/GroupTheory/Complement.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem AddSubgroup.exists_isComplement_left {G : Type*} [AddGroup G] (H : AddSubgroup G) (g : G) : ∃ S, AddSubgroup.IsComplement S ↑H ∧ g ∈ S"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MeasureTheory.vitali_nonmeasurable","library":"atlas","line":166,"location_key":"fdcfb5bc853432da050997772798ac42c83dbf56ba031616ced0f25b6873ac6b","module":"MathlibExt.MeasureTheory.Measure.VitaliNonmeasurable","note":"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.","pair_key":"4c0beb723bed78633deb3d014022069f60e9f57b9ef7879ad9de348e2e21ead6","path":"MathlibExt/MeasureTheory/Measure/VitaliNonmeasurable.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MeasureTheory.vitali_nonmeasurable : ∃ s, ¬MeasureTheory.NullMeasurableSet s MeasureTheory.MeasureSpace.volume"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8909345a643875572277ae2a61026984d079b83f29789b2b491535d2745a4e50","prominence":"supporting","quote":{"exact":"The final v sequence will enumerate the Vitali set."},"quote_capped":false,"section":["Relationship to the axiom of choice"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"The final v sequence will enumerate the Vitali set.","segments":[{"text":"The final v sequence will enumerate the Vitali set."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"76cb3056f6135e644215491744f18ba4861ac69e85dff78621cb55a7f17b571e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-30461-1355154855::In-text #aa968c64","item":"In-text #aa968c64","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ce206ea786d90dc26354e8b24c119e0ea009f97efb83f96c340a5585ac059a82","prominence":"supporting","quote":{"exact":"For inductions and recursions of countable length, the weaker axiom of dependent"},"quote_capped":true,"section":["Relationship to the axiom of choice"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"layer":"For inductions and recursions of countable length, the weaker axiom of dependent choice is sufficient.","segments":[{"text":"For inductions and recursions of countable length, the weaker axiom of dependent choice is sufficient."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"36f2f9de60a32875cea845728f9dbb75b72b316fe917a39b6d232efcbbd1ac0d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-30461-1355154855::In-text #4f019e3f","item":"In-text #4f019e3f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"db7a6ed96613c9e53f229d7d92f2849854f3389b4d2d7f9226861d45ff8feb35","prominence":"supporting","quote":{"exact":"there are models of Zermelo–Fraenkel set theory of interest to set theorists"},"quote_capped":true,"section":["Relationship to the axiom of choice"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","text":{"after":{"layer":", the knowledge that a particular proof only requires dependent choice can be useful.","segments":[{"text":", the knowledge that a particular proof only requires dependent choice can be useful."}]},"before":{"layer":"Because ","segments":[{"text":"Because "}]},"layer":"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","segments":[{"text":"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"}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":133326,"images":[{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Pop-up casket (talk); original by User:Fool","file":"Omega-exp-omega-labeled.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"Cepheus","file":"Venn_A_intersect_B.svg","licence":"Public domain","licence_url":null,"project":"commons"}],"marks":208,"passages":19,"sha256":"95659c7adb40936c2e951846534ca0bbe1815caa973a36daff85b168c3153568","unplaced":["enwiki-30461-1355154855::In-text #e129417f"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"41b30f845865cafab7e08c3cc0c413a39ffdf55e2a9c557cbaaa57717d8a1c53","revision":1355154855,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","renderer":"web-html/3"},"source_id":"enwiki-30461-1355154855","summary":{"by_library":{"atlas":{"complete":0,"incomplete":0,"locations":0,"passages":0,"related":1},"lean-core":{"complete":5,"incomplete":0,"locations":5,"passages":4,"related":1},"mathlib":{"complete":29,"incomplete":0,"locations":29,"passages":16,"related":4}},"by_prominence":{"central":{"by_status":{"formalized":5,"not_formalized":0,"partial":3,"statement_only":0,"unresolved":0},"passages":8},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":5,"not_formalized":3,"partial":2,"statement_only":0,"unresolved":1},"passages":11}},"by_proof_status":{"definition":11,"proved":29},"by_relation":{"broadMatch":14,"closeMatch":1,"exactMatch":3,"hasPart":12,"narrowMatch":4,"relatedMatch":6},"by_status":{"formalized":11,"not_formalized":3,"partial":5,"statement_only":0,"unresolved":1},"locations":34,"passages":20,"related":6},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Transfinite induction","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q840810"}
