{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #4fb966a4","location_key":"46af365bc855e3370071aaedc94279a069922094202acf82aa86218625c6d2d9","pair_key":"b840d743ae1ab2581479a498c08b4a60057e6c368f2fb07e2536f104170170e3","passage_key":"cd1e9bc3534d0b2ee08b31a9a0e10f8b0ffaa8b690d293e3e613aebfc48c62a7","prominence":"central","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #4fb966a4","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":341,"library":"mathlib","line":339,"path":"Mathlib/Order/RelClasses.lean","proof_status":"proved"}},"location":{"declaration":"WellFoundedLT.induction","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[477,577],"span_sha256":"c38088c5dc745c3e71bdba6714f386aa17d0e8a589f71bc98730b451499f98be"}},"location":{"quote":{"exact":"Its correctness is a theorem of ZF, and relies on the fact"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #4fb966a4","location_key":"75ae84ba025cf73138ffc234d6010c091c42a031a8fbfcaeec5fed7679690130","pair_key":"d51b55284907dbc46d2506f9fedde2e6afbaed04f7dc22f268c3a09a9f65eb1f","passage_key":"cd1e9bc3534d0b2ee08b31a9a0e10f8b0ffaa8b690d293e3e613aebfc48c62a7","prominence":"central","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #4fb966a4","kind":"theorem","note":"It registers the ordinals as a type with well-founded strict order, the fact the passage says the principle rests on.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":466,"library":"mathlib","line":464,"path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.lt_wf","module":"Mathlib.SetTheory.Ordinal.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[477,577],"span_sha256":"c38088c5dc745c3e71bdba6714f386aa17d0e8a589f71bc98730b451499f98be"}},"location":{"quote":{"exact":"Its correctness is a theorem of ZF, and relies on the fact"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #433b98a2","location_key":"2ce09a7de5cfdb8cb3c5bffc25b1b6dd2257f273ef968da0c1e7ac89ca27df06","pair_key":"2f9a13940c9d5818be2ad3c449926ede6a7c9574404d48716d44998e0cca942a","passage_key":"2346a90069f8d5316f1ddb4357cea5abcbf8e0ed1d1fbc3402a77e500538b658","prominence":"supporting","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #433b98a2","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":227,"library":"mathlib","line":226,"path":"Mathlib/Order/Minimal.lean","proof_status":"proved"}},"location":{"declaration":"exists_minimal_of_wellFoundedLT","module":"Mathlib.Order.Minimal"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[588,681],"span_sha256":"353ab67ab20812fbae06a0ba34a2fd3763686fc95c133498291e7d82a293680f"}},"location":{"quote":{"exact":"a statement that is not universally true for all ordinals must have"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #433b98a2","location_key":"86c93247a9953c9438f018dcedc0037a0903b74c3e9f843a9467063d66577c95","pair_key":"006de8e13d8d3b26c67a714a9f92deb46284f6e0d5ec215875f84762fef128f7","passage_key":"2346a90069f8d5316f1ddb4357cea5abcbf8e0ed1d1fbc3402a77e500538b658","prominence":"supporting","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #433b98a2","kind":"theorem","note":"The library phrases the conclusion through a nonempty set of elements rather than through a failing property.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":91,"library":"mathlib","line":86,"path":"Mathlib/Order/WellFounded.lean","proof_status":"proved"}},"location":{"declaration":"WellFounded.has_min","module":"Mathlib.Order.WellFounded"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[588,681],"span_sha256":"353ab67ab20812fbae06a0ba34a2fd3763686fc95c133498291e7d82a293680f"}},"location":{"quote":{"exact":"a statement that is not universally true for all ordinals must have"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #d06bd434","location_key":"f33b5df1e0cbb77635b6b1e81666c6aef3ffbfa5b55aafb1ca24329aa4d9781c","pair_key":"80195243673fd048f60130177b5ca8fa46541287c418287e10b5b0cc54db8455","passage_key":"1bccd04b3765b299b7a4bbc9f292e10b9fe4892b66824348c39b578c0951c348","prominence":"central","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #d06bd434","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":341,"library":"mathlib","line":339,"path":"Mathlib/Order/RelClasses.lean","proof_status":"proved"}},"location":{"declaration":"WellFoundedLT.induction","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[682,750],"span_sha256":"aafc964cebb84c3514e51d6b26eb34f63b68ea234be48fe0a80b702b152c0935"}},"location":{"quote":{"exact":"In fact, this principle is also true for arbitrary well-ordered sets"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #d06bd434","location_key":"19e92791f9a69a1ad295a1d2cbaef908e8651b355fa9bdb62ee2b5b0d68d5672","pair_key":"5f40443cab327da026cd2b53e6455919d6bdbb02fcd9ef1170939344ae9c7a1a","passage_key":"1bccd04b3765b299b7a4bbc9f292e10b9fe4892b66824348c39b578c0951c348","prominence":"central","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #d06bd434","kind":"theorem","note":"The core library states it for an arbitrary relation rather than for an order.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":93,"library":"lean-core","line":92,"path":"src/Init/WF.lean","proof_status":"proved"}},"location":{"declaration":"WellFounded.induction","module":"Init.WF"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[682,750],"span_sha256":"aafc964cebb84c3514e51d6b26eb34f63b68ea234be48fe0a80b702b152c0935"}},"location":{"quote":{"exact":"In fact, this principle is also true for arbitrary well-ordered sets"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #d06bd434","location_key":"1a4b31d3ef9d95cead4a8333bd191bc76c2d826dbb02db7b89a538489abbc137","pair_key":"944885b59f8f426f5e6d1513cda79144ff03cc73280947abbab1053da03250b3","passage_key":"1bccd04b3765b299b7a4bbc9f292e10b9fe4892b66824348c39b578c0951c348","prominence":"central","rank":3,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #d06bd434","kind":"theorem","note":"It is the passage's principle for the naturals alone.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":255,"library":"mathlib","line":253,"path":"Mathlib/Data/Nat/Init.lean","proof_status":"proved"}},"location":{"declaration":"Nat.strong_induction_on","module":"Mathlib.Data.Nat.Init"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[682,750],"span_sha256":"aafc964cebb84c3514e51d6b26eb34f63b68ea234be48fe0a80b702b152c0935"}},"location":{"quote":{"exact":"In fact, this principle is also true for arbitrary well-ordered sets"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #6f8708b0","location_key":"26f9e94e62ce3ade2a212e394a1e74a4cf2f50788ad28b0c2b46bb75d28288d1","pair_key":"b3b882993c51b4b22444092cd24297a15c51c0f83c6c4e3f050bf9d307ac6ea3","passage_key":"50a12fbd3a7339f7a5ab30776185399cb84226505eb9addd11d69f01c1138974","prominence":"supporting","rank":1,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #6f8708b0","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":407,"library":"mathlib","line":406,"path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"definition"}},"location":{"declaration":"Ordinal.enum","module":"Mathlib.SetTheory.Ordinal.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"exactMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[762,836],"span_sha256":"cd5b5f0d5dea1add695085df7abd4bc2ad31885292267f8280db2958eeb59fa0"}},"location":{"quote":{"exact":"any well-ordered set can be indexed by ordinals in an order-preserving way"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #6f8708b0","location_key":"2ac30a439f9aaa4f17daac855e15ec7184495cd0b452e5e22942d67c1230f43e","pair_key":"0fe66512d2d5fcde15f949c240db0f57b30e7943507e27eaacf9b4fe9dce4881","passage_key":"50a12fbd3a7339f7a5ab30776185399cb84226505eb9addd11d69f01c1138974","prominence":"supporting","rank":2,"section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #6f8708b0","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":348,"library":"mathlib","line":337,"path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"definition"}},"location":{"declaration":"Ordinal.typein","module":"Mathlib.SetTheory.Ordinal.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[762,836],"span_sha256":"cd5b5f0d5dea1add695085df7abd4bc2ad31885292267f8280db2958eeb59fa0"}},"location":{"quote":{"exact":"any well-ordered set can be indexed by ordinals in an order-preserving way"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #e129417f","passage_key":"10c9727dae3dc32b24478c3215b0d98ffc3fc6af01f9ce417b39fd49b6361a8b","prominence":"supporting","section":[],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #e129417f","kind":"theorem","object":[],"subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[838,889],"span_sha256":"c2c31f6656dcdf675f2bff8b439184ea5cf11384c4a0facd3bd9087faedeb57a"}},"location":{"quote":{"exact":"it suffices to establish the principle for ordinals"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #b7056452","location_key":"05d5a1bca79a71c768d4e817a11f9e9fd63b0739734993eeb870be40f9537f35","pair_key":"24e74c1d95f86595c581e9806e4303a542af78334c312db56910cdd7f25af37d","passage_key":"0ceb1424ef0c0cd0babd9dd3d4e37475d67141ff30e6c1f35e78d1dface20aea","prominence":"subject","rank":1,"section":["Overview"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #b7056452","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":341,"library":"mathlib","line":339,"path":"Mathlib/Order/RelClasses.lean","proof_status":"proved"}},"location":{"declaration":"WellFoundedLT.induction","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[957,1284],"span_sha256":"40d696589ad3f84cc704e7cbb2e79e56f5a73ca77953bb237478fab572d4000e"}},"identifiers":{"wikidata":"Q840810"},"location":{"quote":{"exact":"Let P ( α ) {\\displaystyle P(\\alpha )} be a property defined"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #b7056452","location_key":"0619366af4a1f99cb18a52e41bbd3662589d3dec83b75c4934045a6fbd3cf1a7","pair_key":"ad37b09aa0dee80245827449037534a860abafdf565587a3e4f23355a986dd9a","passage_key":"0ceb1424ef0c0cd0babd9dd3d4e37475d67141ff30e6c1f35e78d1dface20aea","prominence":"subject","rank":2,"section":["Overview"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #b7056452","kind":"theorem","note":"The core library states induction along an arbitrary relation rather than along the order of the ordinals.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":93,"library":"lean-core","line":92,"path":"src/Init/WF.lean","proof_status":"proved"}},"location":{"declaration":"WellFounded.induction","module":"Init.WF"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[957,1284],"span_sha256":"40d696589ad3f84cc704e7cbb2e79e56f5a73ca77953bb237478fab572d4000e"}},"identifiers":{"wikidata":"Q840810"},"location":{"quote":{"exact":"Let P ( α ) {\\displaystyle P(\\alpha )} be a property defined"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #f9fa1476","location_key":"f3bbc5226028a2dd14a5afa040d004bc36e22d731d12557a5e331a506addf875","pair_key":"387a48def2042df1474d3027e41b65aa19c2f25dc434911d6d431834be4f2bfc","passage_key":"bec1d219a59ad45475c106ae45f5de87d06c6de55f11f87b83eb18f6c04ff90e","prominence":"supporting","rank":1,"section":["Overview"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #f9fa1476","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":227,"library":"mathlib","line":226,"path":"Mathlib/Order/Minimal.lean","proof_status":"proved"}},"location":{"declaration":"exists_minimal_of_wellFoundedLT","module":"Mathlib.Order.Minimal"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1361,1635],"span_sha256":"c5ef15262c147b3aefbb4dcc8f64d65adc90ade51d54ad939c98d7580e596acb"}},"location":{"quote":{"exact":"If ⁠ P {\\displaystyle P} ⁠ is not true for all ordinals,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #f9fa1476","location_key":"d4360283c5e6beb9c92bea882ab792e6563873d0f9f705accaf80cca78c26c00","pair_key":"7c78f5d2e5be1a47af780e4242932d54be3d60c1f30eacae858c7e7caf2ac787","passage_key":"bec1d219a59ad45475c106ae45f5de87d06c6de55f11f87b83eb18f6c04ff90e","prominence":"supporting","rank":2,"section":["Overview"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #f9fa1476","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":91,"library":"mathlib","line":86,"path":"Mathlib/Order/WellFounded.lean","proof_status":"proved"}},"location":{"declaration":"WellFounded.has_min","module":"Mathlib.Order.WellFounded"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1361,1635],"span_sha256":"c5ef15262c147b3aefbb4dcc8f64d65adc90ade51d54ad939c98d7580e596acb"}},"location":{"quote":{"exact":"If ⁠ P {\\displaystyle P} ⁠ is not true for all ordinals,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #ceda9865","location_key":"db2d32de0e5c19cb2ac096c0ffe180e52d76f368cf89ff785c6138cbe2d7f1b7","pair_key":"2d1d1d36488c0d27b986a155d2a697e976e9eafe3b242e96517db1c27d461821","passage_key":"6faea01d703ee012dcd9be5f42b506f0750b69ae966db1bc8d364d9bd620e6f3","prominence":"supporting","rank":1,"section":["Overview"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #ceda9865","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":227,"library":"mathlib","line":226,"path":"Mathlib/Order/Minimal.lean","proof_status":"proved"}},"location":{"declaration":"exists_minimal_of_wellFoundedLT","module":"Mathlib.Order.Minimal"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1636,1802],"span_sha256":"e543d8f2da65ca9d0a3b398c69e43ab366198a4cbd0a2fe319830ceaeda41dfd"}},"location":{"quote":{"exact":"Such an ⁠ α {\\displaystyle \\alpha } ⁠ is just a minimal"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #ceda9865","location_key":"a90c021a0898abb37b71242a2047f39339d662fb98522e9a7af4161ade36946f","pair_key":"384769b465e1d860b7e697782fcc9e52467bcc420f52d8f48b39fff3a8095c6a","passage_key":"6faea01d703ee012dcd9be5f42b506f0750b69ae966db1bc8d364d9bd620e6f3","prominence":"supporting","rank":2,"section":["Overview"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #ceda9865","kind":"theorem","note":"It registers the well-founded strict order on the ordinals, which the passage names as the guarantee behind the minimal counterexample.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":466,"library":"mathlib","line":464,"path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.lt_wf","module":"Mathlib.SetTheory.Ordinal.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1636,1802],"span_sha256":"e543d8f2da65ca9d0a3b398c69e43ab366198a4cbd0a2fe319830ceaeda41dfd"}},"location":{"quote":{"exact":"Such an ⁠ α {\\displaystyle \\alpha } ⁠ is just a minimal"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #12792a25","location_key":"3c84e27e244d6975e08d139e05eb517b2489eb3afece56af4152d1606d8daf77","pair_key":"6a92abf17f3fd660967868f12927568a48c0ee12310fd533e39844f1915dcc59","passage_key":"193a1824e2bdabd79deb1c1aeca913f473dea336b9a398f4ecaf354bb01672b1","prominence":"central","rank":1,"section":["Overview","Induction by cases"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #12792a25","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":157,"library":"mathlib","line":154,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"definition"}},"location":{"declaration":"Ordinal.limitRecOn","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1894,2439],"span_sha256":"8f713f5632fa47138258bfbd2964ab7364a0a307f269a1b6d1cbead0bc63170c"}},"location":{"quote":{"exact":"Zero case: Prove that P ( 0 ) {\\displaystyle P(0)} is true."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #12792a25","location_key":"c83dcc650179d0e1a168e99c482b47760ec5cd950d3fc17ae92e998a158b4dfd","pair_key":"aed876e9b0234779ac23cef2304ff64d0dfa79cb06f5aaff62174e194cd5d1af","passage_key":"193a1824e2bdabd79deb1c1aeca913f473dea336b9a398f4ecaf354bb01672b1","prominence":"central","rank":2,"section":["Overview","Induction by cases"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #12792a25","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":765,"library":"mathlib","line":763,"path":"Mathlib/Order/SuccPred/Limit.lean","proof_status":"definition"}},"location":{"declaration":"SuccOrder.limitRecOn","module":"Mathlib.Order.SuccPred.Limit"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1894,2439],"span_sha256":"8f713f5632fa47138258bfbd2964ab7364a0a307f269a1b6d1cbead0bc63170c"}},"location":{"quote":{"exact":"Zero case: Prove that P ( 0 ) {\\displaystyle P(0)} is true."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #12792a25","location_key":"94fd341cb60529c1c3f886b15e81c3d403904b934f41fbc8d3c6e20d24adbb82","pair_key":"4b380679072f1a8125fec7cc89c76cfb437258af623797495494800701cf4118","passage_key":"193a1824e2bdabd79deb1c1aeca913f473dea336b9a398f4ecaf354bb01672b1","prominence":"central","rank":3,"section":["Overview","Induction by cases"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #12792a25","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":341,"library":"mathlib","line":339,"path":"Mathlib/Order/RelClasses.lean","proof_status":"proved"}},"location":{"declaration":"WellFoundedLT.induction","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[1894,2439],"span_sha256":"8f713f5632fa47138258bfbd2964ab7364a0a307f269a1b6d1cbead0bc63170c"}},"location":{"quote":{"exact":"Zero case: Prove that P ( 0 ) {\\displaystyle P(0)} is true."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #76e00ee1","location_key":"f803ec3153edd0ff7440920575b8439af8e3f5606a9df2bbd3ca0adb86e3f23a","pair_key":"de52885103d013807cc988d271d888a42b5201a01f68cdce17ac4ed5ee171f9f","passage_key":"0dc6c64aa984cd908e09d39549370d93fd792e19d1573af32f751267ce4674fe","prominence":"central","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #76e00ee1","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":157,"library":"mathlib","line":154,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"definition"}},"location":{"declaration":"Ordinal.limitRecOn","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[2866,2997],"span_sha256":"21bdcad758136cb1dbf514886d5ca91205eea19f151d363353872a2261be49fa"}},"location":{"quote":{"exact":"however, instead of proving that something holds for all ordinal numbers, we"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #76e00ee1","location_key":"c91883ad117b145393ba72e087ff9ae6d95d4ff20240a0159d11953ce557e4b9","pair_key":"b42b063ac78e87b2ab589a67f73ccdfcabcf751a3d657ddd64ed4a80c4d2541d","passage_key":"0dc6c64aa984cd908e09d39549370d93fd792e19d1573af32f751267ce4674fe","prominence":"central","rank":2,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #76e00ee1","kind":"definition","note":"It is stated for any type whose strict order is well founded, the ordinals being one such type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":354,"library":"mathlib","line":352,"path":"Mathlib/Order/RelClasses.lean","proof_status":"definition"}},"location":{"declaration":"WellFoundedLT.fix","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[2866,2997],"span_sha256":"21bdcad758136cb1dbf514886d5ca91205eea19f151d363353872a2261be49fa"}},"location":{"quote":{"exact":"however, instead of proving that something holds for all ordinal numbers, we"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #d24a7acd","location_key":"283d4359dd219af6977433809aa8a4ed6a0d2e87e7838554043544c2ac03d8b4","pair_key":"59ab0fc57175be7273b1770cf7e1255e0209e5b63853ec88f111569588efb837","passage_key":"bfb010c0394099b241eae6d9d6844d5cb4a473864994174bf8f289a5d3d2e6b5","prominence":"supporting","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #d24a7acd","kind":"construction","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":153,"library":"mathlib","line":152,"path":"Mathlib/LinearAlgebra/Basis/VectorSpace.lean","proof_status":"definition"}},"location":{"declaration":"Module.Basis.ofVectorSpace","module":"Mathlib.LinearAlgebra.Basis.VectorSpace"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[2998,3269],"span_sha256":"f0167685f79f02d89f827f55a97b47306b56ec19f5aa395b541cb2f3c9cf427b"}},"location":{"quote":{"exact":"As an example, a basis for a (possibly infinite-dimensional) vector space can"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #d24a7acd","location_key":"ccb3c1b0c9b64c6f21660f7b9843b1f5fc74d0ea450b44fab7d2ca85eec770db","pair_key":"682973721791cd72b5a2d5d105fc9d7f5fa6ae5f3b626903f43cb2d6739db15a","passage_key":"bfb010c0394099b241eae6d9d6844d5cb4a473864994174bf8f289a5d3d2e6b5","prominence":"supporting","rank":2,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #d24a7acd","kind":"construction","note":"Stated over a division ring, it asserts that some set of vectors of the space carries a basis structure.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":177,"library":"mathlib","line":176,"path":"Mathlib/LinearAlgebra/Basis/VectorSpace.lean","proof_status":"proved"}},"location":{"declaration":"Module.Basis.exists_basis","module":"Mathlib.LinearAlgebra.Basis.VectorSpace"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[2998,3269],"span_sha256":"f0167685f79f02d89f827f55a97b47306b56ec19f5aa395b541cb2f3c9cf427b"}},"location":{"quote":{"exact":"As an example, a basis for a (possibly infinite-dimensional) vector space can"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #22dcf083","location_key":"ca5326d889c46ceb5e9d00e76595ff4176977967139233dd23e5ea061e53fd9d","pair_key":"9c911c2b8a3047801cebc21a71a6219db7d073f4d84f0c32802506beec00a1b3","passage_key":"ee960412d3b55fc4e96253fec0682ae324b1bed27ed65487bd44f37e2dd956c2","prominence":"central","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #22dcf083","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":360,"library":"mathlib","line":358,"path":"Mathlib/Order/RelClasses.lean","proof_status":"proved"}},"location":{"declaration":"WellFoundedLT.fix_eq","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[3393,3804],"span_sha256":"89717f6019f5b09c3bc19d1bed38696932e7c91f30436574cd6ec2395a1c912c"}},"location":{"quote":{"exact":"Transfinite Recursion Theorem (version 1). Given a class function[3] G: V →"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #22dcf083","location_key":"3b6ccf53824a2f85c592475ed62e41a013cd279322c6f6e0e2f45b5331705701","pair_key":"fd82b621ab4a95a0a9cda011da4697820b535ab55d334a23b6e70d17b74670f0","passage_key":"ee960412d3b55fc4e96253fec0682ae324b1bed27ed65487bd44f37e2dd956c2","prominence":"central","rank":2,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #22dcf083","kind":"theorem","note":"It is stated for an arbitrary well-founded relation on a type, with the well-foundedness proof an explicit argument.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":141,"library":"lean-core","line":139,"path":"src/Init/WF.lean","proof_status":"proved"}},"location":{"declaration":"WellFounded.fix_eq","module":"Init.WF"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[3393,3804],"span_sha256":"89717f6019f5b09c3bc19d1bed38696932e7c91f30436574cd6ec2395a1c912c"}},"location":{"quote":{"exact":"Transfinite Recursion Theorem (version 1). Given a class function[3] G: V →"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #9226413d","location_key":"340b1aa1fff508d72acf5f4ea7c7deea1e2f58b3e05cd6fcc8438a77eb39c39c","pair_key":"57e7192d16645ce22532c64553d4c1c47978cc397679ed66e0e3781a3633a38a","passage_key":"5a616597cd36619cf54d29ecb30b0ce9b404c178c1558cc87133d2aee883d4f8","prominence":"central","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #9226413d","kind":"theorem","note":"It supplies the function the theorem asserts to exist, while the three conditions on that function are separate statements.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":157,"library":"mathlib","line":154,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"definition"}},"location":{"declaration":"Ordinal.limitRecOn","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[3950,4088],"span_sha256":"b331b6c4dd728215f8dced80fe36666d834ae9f335d6cc4f82554e08efe19adb"}},"location":{"quote":{"exact":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #9226413d","location_key":"ed59a6f7b35499cba8ad15c71605f8ad6e57917100a89e7fc1a2fb1bf16cc0f9","pair_key":"d9c5b52a640d634a8a680671201ab71cac1c7ee8cab1cca53c27acaad3747db5","passage_key":"5a616597cd36619cf54d29ecb30b0ce9b404c178c1558cc87133d2aee883d4f8","prominence":"central","rank":2,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #9226413d","kind":"theorem","note":"It establishes the first of the three conditions for the constructed function, not the whole existence claim.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":161,"library":"mathlib","line":160,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.limitRecOn_zero","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[3950,4088],"span_sha256":"b331b6c4dd728215f8dced80fe36666d834ae9f335d6cc4f82554e08efe19adb"}},"location":{"quote":{"exact":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #9226413d","location_key":"3bfe19add15cdc9ed99f3868ecf7e70735b08619089760c4d9829938607ac4fe","pair_key":"855a2923067de083f408f1f4a7fa6fa1b28e28b9f75c6c297ef12ee7c83e8841","passage_key":"5a616597cd36619cf54d29ecb30b0ce9b404c178c1558cc87133d2aee883d4f8","prominence":"central","rank":3,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #9226413d","kind":"theorem","note":"It establishes the second of the three conditions for the constructed function only.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":171,"library":"mathlib","line":169,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.limitRecOn_succ","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[3950,4088],"span_sha256":"b331b6c4dd728215f8dced80fe36666d834ae9f335d6cc4f82554e08efe19adb"}},"location":{"quote":{"exact":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #9226413d","location_key":"e4f7a517c91a0b9ae2d419f2b4a2e0e34b252db7f3ea8c50276f55c561a7a330","pair_key":"234129e09df440c32769fcd35a2ba7d0228e0c3fedfd23202d27345323ac7330","passage_key":"5a616597cd36619cf54d29ecb30b0ce9b404c178c1558cc87133d2aee883d4f8","prominence":"central","rank":4,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #9226413d","kind":"theorem","note":"It establishes the third of the three conditions for the constructed function only.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":176,"library":"mathlib","line":174,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.limitRecOn_limit","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[3950,4088],"span_sha256":"b331b6c4dd728215f8dced80fe36666d834ae9f335d6cc4f82554e08efe19adb"}},"location":{"quote":{"exact":"Transfinite Recursion Theorem (version 2). Given a set g1, and class functions"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","coverage":{"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"},"item":"In-text #71a86c27","location_key":"345c06a2954e15f675fb517d4a65cc05c739ce05378fb0b8d033970fae846906","pair_key":"a3336471e2f357c7c0633f6d1f141faf75c2cbfb39509e4c60db2cd34e791a3c","passage_key":"485d128eb649d074c4d4fb449763b3385219b76bc4df9f04e0dc09212feaebfc","prominence":"central","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #71a86c27","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":161,"library":"mathlib","line":160,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.limitRecOn_zero","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4089,4245],"span_sha256":"e6c6be2a2b8cf6aa11c49bce6bd1e12d3bd29643822da0f8b7fa39ed1fef7896"}},"location":{"quote":{"exact":"F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","coverage":{"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"},"item":"In-text #71a86c27","location_key":"7b966dc0e4d65e159ae88895605b098bda5b70f7dedaf110ea0f70d1f93bc8e2","pair_key":"daa5971be320292fd367079e87a44058ac128029b01acb01640e099a22581306","passage_key":"485d128eb649d074c4d4fb449763b3385219b76bc4df9f04e0dc09212feaebfc","prominence":"central","rank":2,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #71a86c27","kind":"theorem","note":"Lean's successor datum may also depend on the ordinal itself, and the passage's G2 is the choice that ignores it.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":171,"library":"mathlib","line":169,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.limitRecOn_succ","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4089,4245],"span_sha256":"e6c6be2a2b8cf6aa11c49bce6bd1e12d3bd29643822da0f8b7fa39ed1fef7896"}},"location":{"quote":{"exact":"F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","coverage":{"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"},"item":"In-text #71a86c27","location_key":"20739b05ea6fda55424820c7c6d306b4a4445b58f8fb2f04675dc1c3dc38a182","pair_key":"cbfd1795a8c73d4d51e60732139dd81dc087173f221cf9dbe76cc50d212c8860","passage_key":"485d128eb649d074c4d4fb449763b3385219b76bc4df9f04e0dc09212feaebfc","prominence":"central","rank":3,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #71a86c27","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":176,"library":"mathlib","line":174,"path":"Mathlib/SetTheory/Ordinal/Arithmetic.lean","proof_status":"proved"}},"location":{"declaration":"Ordinal.limitRecOn_limit","module":"Mathlib.SetTheory.Ordinal.Arithmetic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4089,4245],"span_sha256":"e6c6be2a2b8cf6aa11c49bce6bd1e12d3bd29643822da0f8b7fa39ed1fef7896"}},"location":{"quote":{"exact":"F(0) = g1, F(α + 1) = G2(F(α)), for all α ∈"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #e9fdadef","location_key":"8a64a5615f654e282ebef3c9b76e99fbe017d28c3e15f09e35277d12b1eda94c","pair_key":"be54c792b8f2bc0ed3636f5e6733f1e05906521625475229148c840db1ce0cbc","passage_key":"dec6c563146139c9c0d0a00adc15916fae7750eeffa9c38a6c8584a5986d5b54","prominence":"central","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #e9fdadef","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":136,"library":"lean-core","line":135,"path":"src/Init/WF.lean","proof_status":"definition"}},"location":{"declaration":"WellFounded.fix","module":"Init.WF"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"exactMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4451,4546],"span_sha256":"0d51c0ff2c9b95ab88c8bc0356f70a61d70a25e9957fcf5661520a4fb221285b"}},"location":{"quote":{"exact":"More generally, one can define objects by transfinite recursion on any well-founded"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #e9fdadef","location_key":"fffdc04e7492f2723bb2734cbdc28e07ac5315e830d6c5de15fcd6ec7d6510fe","pair_key":"9ed8e2be25982e166f44f1620d29e52d5b75a8dc8fc527c151f16c87f27185b8","passage_key":"dec6c563146139c9c0d0a00adc15916fae7750eeffa9c38a6c8584a5986d5b54","prominence":"central","rank":2,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #e9fdadef","kind":"theorem","note":"It states the defining equation of the recursion at each element of the relation's domain.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":141,"library":"lean-core","line":139,"path":"src/Init/WF.lean","proof_status":"proved"}},"location":{"declaration":"WellFounded.fix_eq","module":"Init.WF"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"exactMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4451,4546],"span_sha256":"0d51c0ff2c9b95ab88c8bc0356f70a61d70a25e9957fcf5661520a4fb221285b"}},"location":{"quote":{"exact":"More generally, one can define objects by transfinite recursion on any well-founded"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #e9fdadef","location_key":"05acea34c454d574c5a0b284c598ea4fa18073c3a9e738ea789f6c8395ce6272","pair_key":"b50848402700057abc2fe4bd6c8a78543bb1c4f4081ea1ea021fdb92657fe1f9","passage_key":"dec6c563146139c9c0d0a00adc15916fae7750eeffa9c38a6c8584a5986d5b54","prominence":"central","rank":3,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #e9fdadef","kind":"theorem","note":"It is the case in which the well-founded relation is the strict order of an ordered type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":354,"library":"mathlib","line":352,"path":"Mathlib/Order/RelClasses.lean","proof_status":"definition"}},"location":{"declaration":"WellFoundedLT.fix","module":"Mathlib.Order.RelClasses"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"narrowMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4451,4546],"span_sha256":"0d51c0ff2c9b95ab88c8bc0356f70a61d70a25e9957fcf5661520a4fb221285b"}},"location":{"quote":{"exact":"More generally, one can define objects by transfinite recursion on any well-founded"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #7171eca3","location_key":"3ca7d158910f84822000e1e9888f149651f3c529191a95f4223c31e5eb9e6676","pair_key":"5c7306dd6b65322de557b97cfa784aa3aa173a429f352cfd70f43079656ba03c","passage_key":"a4f0d41fc47f19e0e8696411dcf6ec2ef087c101cbcfba761989294e9cb3ce07","prominence":"supporting","rank":1,"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #7171eca3","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":136,"library":"lean-core","line":135,"path":"src/Init/WF.lean","proof_status":"definition"}},"location":{"declaration":"WellFounded.fix","module":"Init.WF"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4547,4700],"span_sha256":"abb62b60d3173849e8331ce492d514d70eddb697ed435526eecade88c6af03c0"}},"location":{"quote":{"exact":"(R need not even be a set; it can be a proper"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #7171eca3","passage_key":"a4f0d41fc47f19e0e8696411dcf6ec2ef087c101cbcfba761989294e9cb3ce07","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"3322430bae052eeb175246a0f90e4c28dfa92e47456e32e4724d7a12fa02a870"},"section":["Transfinite recursion"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #7171eca3","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[4547,4700],"span_sha256":"abb62b60d3173849e8331ce492d514d70eddb697ed435526eecade88c6af03c0"}},"location":{"quote":{"exact":"(R need not even be a set; it can be a proper"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #c3f67a19","location_key":"3d6f7548bcbecb749363016c8464d4c44c71d269033fac9dec56f8e0b1e1f5f6","pair_key":"f1d618b6241dc5327f9455015596b03d9e9ce3ae729b679704f1bbe471b6b668","passage_key":"bc8512486a78ade87b74d9402bd2eb0eb25ad928a6893d0ddac018160bfecccc","prominence":"supporting","rank":1,"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #c3f67a19","kind":"construction","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":992,"library":"mathlib","line":990,"path":"Mathlib/SetTheory/Ordinal/Basic.lean","proof_status":"proved"}},"location":{"declaration":"Cardinal.exists_ord_eq","module":"Mathlib.SetTheory.Ordinal.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[5384,5652],"span_sha256":"bb15b8051ba1e34449e5dbc0202398d62a8e60e4d571438c01a6fa306ff94929"}},"location":{"quote":{"exact":"First, well-order the real numbers (this is where the axiom of choice"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #c3f67a19","location_key":"48ed38bc5e9ee160eaceaf91d568ef0db762e63b23d25faeea3ec35c3143e23e","pair_key":"1ac0c55ecc732fdaeeaba960ddc6ae55651cd38552052bc2b98926f4864d3654","passage_key":"bc8512486a78ade87b74d9402bd2eb0eb25ad928a6893d0ddac018160bfecccc","prominence":"supporting","rank":2,"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #c3f67a19","kind":"construction","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":528,"library":"mathlib","line":527,"path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved"}},"location":{"declaration":"WellOrderingRel.isWellOrder","module":"Mathlib.SetTheory.Cardinal.Order"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[5384,5652],"span_sha256":"bb15b8051ba1e34449e5dbc0202398d62a8e60e4d571438c01a6fa306ff94929"}},"location":{"quote":{"exact":"First, well-order the real numbers (this is where the axiom of choice"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #c3f67a19","location_key":"37e80cba38a848a35018cb0f3e69bc09e5e2aabf3ff606a74f4266ca5f2469f2","pair_key":"d72d6ff3df8b4f918700f894584f7f9c04754d68480d244170c723b04d66e805","passage_key":"bc8512486a78ade87b74d9402bd2eb0eb25ad928a6893d0ddac018160bfecccc","prominence":"supporting","rank":3,"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #c3f67a19","kind":"construction","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":195,"library":"mathlib","line":185,"path":"Mathlib/Analysis/Real/Cardinality.lean","proof_status":"proved"}},"location":{"declaration":"Cardinal.mk_real","module":"Mathlib.Analysis.Real.Cardinality"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[5384,5652],"span_sha256":"bb15b8051ba1e34449e5dbc0202398d62a8e60e4d571438c01a6fa306ff94929"}},"location":{"quote":{"exact":"First, well-order the real numbers (this is where the axiom of choice"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #48f47485","location_key":"8e7fadc3be03faf2647dc29790c4e6de537a55a62a1378f7f7345dfb931c0ee3","pair_key":"0c53c1da2f7963620621cb76211e890495168f2046f9b62db3e74b74db95cdb1","passage_key":"8909345a643875572277ae2a61026984d079b83f29789b2b491535d2745a4e50","prominence":"supporting","rank":1,"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #48f47485","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":272,"library":"mathlib","line":272,"path":"Mathlib/GroupTheory/Complement.lean","proof_status":"proved"}},"location":{"declaration":"AddSubgroup.exists_isComplement_left","module":"Mathlib.GroupTheory.Complement"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[5978,6029],"span_sha256":"dd1d834fcb44b45c14933919b0ccf629aa598a0df759ea67d6c61b6dfb9ec74e"}},"location":{"quote":{"exact":"The final v sequence will enumerate the Vitali set."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #48f47485","location_key":"fdcfb5bc853432da050997772798ac42c83dbf56ba031616ced0f25b6873ac6b","pair_key":"4c0beb723bed78633deb3d014022069f60e9f57b9ef7879ad9de348e2e21ead6","passage_key":"8909345a643875572277ae2a61026984d079b83f29789b2b491535d2745a4e50","prominence":"supporting","rank":2,"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #48f47485","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":166,"path":"MathlibExt/MeasureTheory/Measure/VitaliNonmeasurable.lean","proof_status":"proved"}},"location":{"declaration":"MeasureTheory.vitali_nonmeasurable","module":"MathlibExt.MeasureTheory.Measure.VitaliNonmeasurable"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[5978,6029],"span_sha256":"dd1d834fcb44b45c14933919b0ccf629aa598a0df759ea67d6c61b6dfb9ec74e"}},"location":{"quote":{"exact":"The final v sequence will enumerate the Vitali set."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #aa968c64","passage_key":"ce206ea786d90dc26354e8b24c119e0ea009f97efb83f96c340a5585ac059a82","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"76cb3056f6135e644215491744f18ba4861ac69e85dff78621cb55a7f17b571e"},"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #aa968c64","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[6699,6801],"span_sha256":"c3e050a9a6c6ad68d1c92a50f24300c68c07ae7604bc18576fa3b009d19a3128"}},"location":{"quote":{"exact":"For inductions and recursions of countable length, the weaker axiom of dependent"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #4f019e3f","passage_key":"db7a6ed96613c9e53f229d7d92f2849854f3389b4d2d7f9226861d45ff8feb35","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"36f2f9de60a32875cea845728f9dbb75b72b316fe917a39b6d232efcbbd1ac0d"},"section":["Relationship to the axiom of choice"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-30461-1355154855::In-text #4f019e3f","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","container-title":"Wikipedia","id":"enwiki-30461-1355154855","title":"Transfinite induction","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"5c80015882e651eabf7e850890fb6520a1f17c048c90e09f5c32bc3f0aa0d5c9","layer_sha256":"3ae7af2d481d48eb585516864d5484d7226ba178849db8585a716455d5a6de3f","licence":"CC-BY-SA-4.0","pageid":30461,"renderer":"web-html/3","span":[6810,6962],"span_sha256":"5b4cbb748e0e6542796f1cdd5b803bbe2d11590b22382fb73726fe7765ff2c60"}},"location":{"quote":{"exact":"there are models of Zermelo–Fraenkel set theory of interest to set theorists"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=30461&oldid=1355154855","version":"1355154855"}]}
