{"assessment":{"class":"Start","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":449738,"passages":[{"absence":null,"basis":"d6e5f46a07382e91d05ace862ac7444e1ca9c4a3a62db2f3c798e9eae80a4eee","coverage":null,"id":"enwiki-449738-1364471395::In-text #63eef5b8","item":"In-text #63eef5b8","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.IsFixedPt","end_line":214,"library":"mathlib","line":214,"location_key":"d6e5f46a07382e91d05ace862ac7444e1ca9c4a3a62db2f3c798e9eae80a4eee","module":"Mathlib.Logic.Function.Defs","note":null,"pair_key":"407d303087a624aae27179ee9082c50ef25a041095afda04cd83b90cfbb5f7c1","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.fixedPoints","end_line":29,"library":"mathlib","line":28,"location_key":"45d19dfaac439cc4492dcf14279b4ef2bd30b290c911ba5fafc89c7952eed40b","module":"Mathlib.Dynamics.FixedPoints.Defs","note":null,"pair_key":"a0ec26128f1bd6f580a1dc215363081bf5fa5bec6cbaf48e0e7e045761cff41a","path":"Mathlib/Dynamics/FixedPoints/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.fixedPoints {α : Type*} : (α → α) → Set α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c1265b623a7313d546df56d42020d2fcd26756f5ea2ecb6d1b8fe1dc772f1ee0","prominence":"subject","quote":{"exact":"In mathematics, a fixed point (sometimes shortened to fixpoint), also known as"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation.","segments":[{"text":"In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation."}]},"unresolved":null},{"absence":null,"basis":"2f86a7ea24ed6601cb7282e008556db92a4b35977a6f6162216115ec362ec6e1","coverage":null,"id":"enwiki-449738-1364471395::In-text #b54a4962","item":"In-text #b54a4962","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.IsFixedPt","end_line":214,"library":"mathlib","line":214,"location_key":"2f86a7ea24ed6601cb7282e008556db92a4b35977a6f6162216115ec362ec6e1","module":"Mathlib.Logic.Function.Defs","note":null,"pair_key":"3dbddd473f28957f38592600fdd08b93df8802d01f295ad9b5a075ec5d8595c0","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.mem_fixedPoints_iff","end_line":40,"library":"mathlib","line":39,"location_key":"710ed90a5fc771f863edcd3b14a3ef2132146efdb6f148d433f16f629b8dfd14","module":"Mathlib.Dynamics.FixedPoints.Defs","note":null,"pair_key":"9392cde541809863af9db535ca488ce2676d02756e2f9bdce522e603c4b94ec8","path":"Mathlib/Dynamics/FixedPoints/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.mem_fixedPoints_iff {α : Type*} {f : α → α} {x : α} : x ∈ Function.fixedPoints f ↔ f x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c9e84730d36ee5cd00a6db530300f5647e41becad31515a6a3037e9a0db03d52","prominence":"central","quote":{"exact":"Specifically, for functions, a fixed point is an element that is mapped"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Specifically, for functions, a fixed point is an element that is mapped to itself by the function.","segments":[{"text":"Specifically, for functions, a fixed point is an element that is mapped to itself by the function."}]},"unresolved":null},{"absence":null,"basis":"5c4a9d7e1511abd80abc11f64d16814a8db710278bf16c14996dd4182f85f946","coverage":null,"id":"enwiki-449738-1364471395::In-text #bc157043","item":"In-text #bc157043","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MulAction.set_mem_fixedBy_of_subset_fixedBy","end_line":173,"library":"mathlib","line":166,"location_key":"5c4a9d7e1511abd80abc11f64d16814a8db710278bf16c14996dd4182f85f946","module":"Mathlib.GroupTheory.GroupAction.FixedPoints","note":"The transformation here is restricted to one coming from a group action, and the conclusion is set equality rather than merely mapping into itself.","pair_key":"9013a95538804abf907c14a9f08f941c803d42f71b72358d58c1754b4e3b7f58","path":"Mathlib/GroupTheory/GroupAction/FixedPoints.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MulAction.set_mem_fixedBy_of_subset_fixedBy {α : Type*} {G : Type*} [Group G] [MulAction G α] {s : Set α} {g : G} : s ⊆ MulAction.fixedBy α g → s ∈ MulAction.fixedBy (Set α) g"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.IsFixedPt.eq","end_line":218,"library":"mathlib","line":217,"location_key":"7f382a94d617b4e395f7020f9937b7583c3eefae30201d29d72341021df5d737","module":"Mathlib.Logic.Function.Defs","note":null,"pair_key":"ef9501d232c50cc573b011667eaeec18de95c5c06ac1624341b3a8a0aba81fc0","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.IsFixedPt.eq {α : Type u₁} {f : α → α} {x : α} : Function.IsFixedPt f x → f x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e70f029fb784146471c11c65db3d79fa54b9213adff260545bacc5464fe94e3a","prominence":"central","quote":{"exact":"Any set of fixed points of a transformation is also an invariant"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Any set of fixed points of a transformation is also an invariant set.","segments":[{"text":"Any set of fixed points of a transformation is also an invariant set."}]},"unresolved":null},{"absence":null,"basis":"fc612537741812275395e745fa866467d7439ca2b292b01df6d403f1a4abde59","coverage":null,"id":"enwiki-449738-1364471395::In-text #b111548a","item":"In-text #b111548a","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.IsFixedPt","end_line":214,"library":"mathlib","line":214,"location_key":"fc612537741812275395e745fa866467d7439ca2b292b01df6d403f1a4abde59","module":"Mathlib.Logic.Function.Defs","note":"Lean's notion is only available for a map of a type to itself, so the two membership requirements of the passage hold automatically there.","pair_key":"67ca63fe3490597ca3cbeebbb0f83ab08d53524436be9432b0b06513f67c1a2e","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.mem_fixedPoints_iff","end_line":40,"library":"mathlib","line":39,"location_key":"541cf3b969ccf9bb8633e0539fed075e0b4e8c82b3d9b53bc36f681a4378f65a","module":"Mathlib.Dynamics.FixedPoints.Defs","note":null,"pair_key":"554481c0e7d8730eeeceb88b9834e098c25c2baa04dc10761cef7050faa03406","path":"Mathlib/Dynamics/FixedPoints/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.mem_fixedPoints_iff {α : Type*} {f : α → α} {x : α} : x ∈ Function.fixedPoints f ↔ f x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2bd232e81b9d1bcb52d5cc5108bc9989a0a66cdc73c318050332f59dede5f5c5","prominence":"central","quote":{"exact":"Formally, c is a fixed point of a function f if c"},"quote_capped":true,"section":["Fixed point of a function"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Formally, c is a fixed point of a function f if c belongs to both the domain and the codomain of f, and f(c) = c.","segments":[{"text":"Formally, c is a fixed point of a function f if c belongs to both the domain and the codomain of f, and f(c) = c."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"c98d78bdb205dc39adc71461a0f6aac6a9aa6dbe9b1f489c5eb379e8473747ef"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #614ee82c","item":"In-text #614ee82c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8a5a783ebac8c2c5f2629392d396cd3e73f08c5fdda4c652fcd520201bd507f3","prominence":"supporting","quote":{"exact":"In particular, f cannot have any fixed point if its domain is"},"quote_capped":true,"section":["Fixed point of a function"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In particular, f cannot have any fixed point if its domain is disjoint from its codomain.","segments":[{"text":"In particular, f cannot have any fixed point if its domain is disjoint from its codomain."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"505063cc88feb177ba6b2b05da2fcca893d8211f6b558fa49c1a930ab5309786"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #061b2976","item":"In-text #061b2976","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e2313ff4b1cf29dacaf304cd1fd18c2f238168e3fe2ab316de53488c04ee149f","prominence":"supporting","quote":{"exact":"If f is defined on the real numbers, it corresponds, in graphical"},"quote_capped":true,"section":["Fixed point of a function"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"If f is defined on the real numbers, it corresponds, in graphical terms, to a curve in the Euclidean plane, and each fixed-point c corresponds to an intersection of the curve with the line y = x, cf. picture.","segments":[{"text":"If f is defined on the real numbers, it corresponds, in graphical terms, to a curve in the Euclidean plane, and each fixed-point c corresponds to an intersection of the curve with the line y = x, cf. picture."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"28b0d07c288f63b94b2ecadc12e5bb762be2b4730ea26678147b63de9512b995"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #e4382607","item":"In-text #e4382607","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1826c151385d02909883f96e9b2777114d8f544754cb415bdb18fb7a5725f328","prominence":"supporting","quote":{"exact":"For example, if f is defined on the real numbers by f"},"quote_capped":true,"section":["Fixed point of a function"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"after":{"layer":", because f(2) = 2.","segments":[{"text":", because f(2) = 2."}]},"layer":"For example, if f is defined on the real numbers by f ( x ) = x 2 − 3 x + 4 , {\\displaystyle f(x)=x^{2}-3x+4,} then 2 is a fixed point of f","segments":[{"text":"For example, if f is defined on the real numbers by "},{"tex":"f(x)=x^{2}-3x+4,"},{"text":" then 2 is a fixed point of f"}]},"unresolved":null},{"absence":null,"basis":"21452e9a226f708ed19a5a03a080e854bad01fe70f66bbbf71b6563fcb46f696","coverage":null,"id":"enwiki-449738-1364471395::In-text #bc287eff","item":"In-text #bc287eff","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.add_one_ne_self","end_line":618,"library":"lean-core","line":618,"location_key":"21452e9a226f708ed19a5a03a080e854bad01fe70f66bbbf71b6563fcb46f696","module":"Init.Data.Nat.Basic","note":"The statement is carried out over the naturals rather than over the real line that the passage names.","pair_key":"1895d2d93fc025aa0bf3a326d310d71cd96ef1653d03995ac4dad4ba99ee0ac3","path":"src/Init/Data/Nat/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.add_one_ne_self (n : Nat) : n + 1 ≠ n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"lt_add_one","end_line":21,"library":"mathlib","line":19,"location_key":"2056cdfa0168cb63d43947f4474bb875ffce229617ca8a5905fbf8239615111d","module":"Mathlib.Algebra.Order.Monoid.NatCast","note":null,"pair_key":"36cdc6039c63deb3227c71d10e6d1c6adf2cba4418c248c812be87c59e416477","path":"Mathlib/Algebra/Order/Monoid/NatCast.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem lt_add_one {α : Type*} [One α] [AddZeroClass α] [PartialOrder α] [ZeroLEOneClass α] [NeZero 1] [AddLeftStrictMono α] (a : α) : a < a + 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cffcc85bef087b1685fdffbd3f25211686e28e39a0f626fa6c8b2a1f95419b8c","prominence":"supporting","quote":{"exact":"Not all functions have fixed points: for example, f(x) = x +"},"quote_capped":true,"section":["Fixed point of a function"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"after":{"layer":" because x + 1 is never equal to x for any real number.","segments":[{"text":" because x + 1 is never equal to x for any real number."}]},"layer":"Not all functions have fixed points: for example, f(x) = x + 1 has no fixed points","segments":[{"text":"Not all functions have fixed points: for example, f(x) = x + 1 has no fixed points"}]},"unresolved":null},{"absence":null,"basis":"6b98107b4af656a1f0d181e6680841efad4cb1e794f709e244bec015687144be","coverage":null,"id":"enwiki-449738-1364471395::In-text #ea1b47be","item":"In-text #ea1b47be","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.repeat","end_line":64,"library":"lean-core","line":62,"location_key":"6b98107b4af656a1f0d181e6680841efad4cb1e794f709e244bec015687144be","module":"Init.Data.Nat.Basic","note":"Lean core defines the result of applying f to the start value a given number of times, so the passage's sequence is this term read as a function of the index.","pair_key":"d06c6238d8075334933b88b35b01b2515f1c241c48f33a311c6697e4320e7eee","path":"src/Init/Data/Nat/Basic.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.repeat {α : Type u} : (α → α) → Nat → α → α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.iterate_succ_apply'","end_line":176,"library":"mathlib","line":174,"location_key":"39b4d533e2b01a62d0998b8600e9ca7833ba6b735b16f2d8bdef5649607c1c75","module":"Mathlib.Logic.Function.Iterate","note":"Mathlib proves that the library's iterated map obeys the step relation by which the passage defines its sequence.","pair_key":"bc2e817bea874342aff6bea653db4ea5264623d55f8b533b5a6d42098d73c52b","path":"Mathlib/Logic/Function/Iterate.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.iterate_succ_apply' {α : Type u} (f : α → α) (n : ℕ) (x : α) : f^[n.succ] x = f (f^[n] x)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f685f9ab8b3079cd65a4d6d3e93239f34093e87ed35152b28d1eedd3d5c16606","prominence":"central","quote":{"exact":"Specifically, given a function f {\\displaystyle f} with the same domain and"},"quote_capped":true,"section":["Fixed point iteration"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Specifically, given a function f {\\displaystyle f} with the same domain and codomain, a point x 0 {\\displaystyle x_{0}} in the domain of f {\\displaystyle f} , the fixed-point iteration is x n + 1 = f ( x n ) , n = 0 , 1 , 2 , … {\\displaystyle x_{n+1}=f(x_{n}),\\,n=0,1,2,\\dots } which gives rise to the sequence x 0 , x 1 , x 2 , … {\\displaystyle x_{0},x_{1},x_{2},\\dots } of iterated function applications x 0 , f ( x 0 ) , f ( f ( x 0 ) ) , … {\\displaystyle x_{0},f(x_{0}),f(f(x_{0})),\\dots } which is hoped to converge to a point x {\\displaystyle x} .","segments":[{"text":"Specifically, given a function "},{"tex":"f"},{"text":" with the same domain and codomain, a point "},{"tex":"x_{0}"},{"text":" in the domain of "},{"tex":"f"},{"text":" , the fixed-point iteration is "},{"display":true,"tex":"x_{n+1}=f(x_{n}),\\,n=0,1,2,\\dots"},{"text":" which gives rise to the sequence "},{"tex":"x_{0},x_{1},x_{2},\\dots"},{"text":" of iterated function applications "},{"tex":"x_{0},f(x_{0}),f(f(x_{0})),\\dots"},{"text":" which is hoped to converge to a point "},{"tex":"x"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"a2cd884af3f30d06029edfc147d54906ebe784bf9ce1c8c30c6d3ee976b3132e","coverage":null,"id":"enwiki-449738-1364471395::In-text #8de5a0b2","item":"In-text #8de5a0b2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"isFixedPt_of_tendsto_iterate","end_line":39,"library":"mathlib","line":35,"location_key":"a2cd884af3f30d06029edfc147d54906ebe784bf9ce1c8c30c6d3ee976b3132e","module":"Mathlib.Dynamics.FixedPoints.Topology","note":"Mathlib asks for continuity at the limit point alone and for a Hausdorff space, and concludes that the limit of the iterates is fixed by f.","pair_key":"c3a79ad8fd3f8be5bee55bf143831025d1a4499ee8afbc59e8326f17ae8f0ce6","path":"Mathlib/Dynamics/FixedPoints/Topology.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem isFixedPt_of_tendsto_iterate {α : Type*} [TopologicalSpace α] [T2Space α] {f : α → α} {x y : α} : Filter.Tendsto (fun n ↦ f^[n] x) Filter.atTop (𝓝 y) → ContinuousAt f y → Function.IsFixedPt f y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6f9b876ba858561bfee428efc8671ab628dca842a9c0639fdede48d11e2c4b6e","prominence":"central","quote":{"exact":"If f {\\displaystyle f} is continuous, then one can prove that the"},"quote_capped":true,"section":["Fixed point iteration"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"If f {\\displaystyle f} is continuous, then one can prove that the obtained x {\\displaystyle x} is a fixed point of f {\\displaystyle f} .","segments":[{"text":"If "},{"tex":"f"},{"text":" is continuous, then one can prove that the obtained "},{"tex":"x"},{"text":" is a fixed point of "},{"tex":"f"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"5a95896a2cbaf7c496069df2113de00235e84db2aa53f101b12035e4722ce773","coverage":null,"id":"enwiki-449738-1364471395::In-text #dc078cd2","item":"In-text #dc078cd2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ContractingWith.exists_fixedPoint","end_line":106,"library":"mathlib","line":97,"location_key":"5a95896a2cbaf7c496069df2113de00235e84db2aa53f101b12035e4722ce773","module":"Mathlib.Topology.MetricSpace.Contracting","note":"Mathlib works in an extended metric space and adds a rate estimate for the distance from the n-th iterate to the limit, both beyond what the passage reports.","pair_key":"e5c318d571cc15a9e78f13fc052d8a79302775bef892cd154131a83d6ac606c2","path":"Mathlib/Topology/MetricSpace/Contracting.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ContractingWith.exists_fixedPoint {α : Type*} [EMetricSpace α] {K : NNReal} {f : α → α} [CompleteSpace α] : ContractingWith K f → ∀ (x : α), EDist.edist x (f x) ≠ ⊤ → ∃ y, Function.IsFixedPt f y ∧ Filter.Tendsto (fun n ↦ f^[n] x) Filter.atTop (𝓝 y) ∧ ∀ (n : ℕ), EDist.edist (f^[n] x) y ≤ EDist.edist x (f x) * ↑K ^ n / (1 - ↑K)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ContractingWith.tendsto_iterate_fixedPoint","end_line":306,"library":"mathlib","line":302,"location_key":"18f3941d36cfbf27285dc169d2649c8b2db876e0f4042481096405acab0f466a","module":"Mathlib.Topology.MetricSpace.Contracting","note":"It gives convergence of the iterates to Mathlib's chosen point, and a second lemma is needed to know that point is fixed.","pair_key":"15d3a93af67deaecb7cfcd6a6ada6d4e71b5b8e9e7666823783786ebd499a169","path":"Mathlib/Topology/MetricSpace/Contracting.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ContractingWith.tendsto_iterate_fixedPoint {α : Type*} [MetricSpace α] {K : NNReal} {f : α → α} (hf : ContractingWith K f) [Nonempty α] [CompleteSpace α] (x : α) : Filter.Tendsto (fun n ↦ f^[n] x) Filter.atTop (𝓝 (ContractingWith.fixedPoint f hf))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"008a797ab3bff0f2efe413943b9a2457b5e0ee4208ca189c0184421c35830b5d","prominence":"central","quote":{"exact":"For example, the Banach fixed-point theorem (1922) gives a general criterion guaranteeing"},"quote_capped":true,"section":["Fixed-point theorems"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"For example, the Banach fixed-point theorem (1922) gives a general criterion guaranteeing that, if it is satisfied, fixed-point iteration will always converge to a fixed point.","segments":[{"text":"For example, the Banach fixed-point theorem (1922) gives a general criterion guaranteeing that, if it is satisfied, fixed-point iteration will always converge to a fixed point."}]},"unresolved":null},{"absence":null,"basis":"4a8a8ac7002459bba2b4731195cba2fadf4ee45e0aa8d36c4d8a6263f567dce5","coverage":null,"id":"enwiki-449738-1364471395::In-text #a42bda04","item":"In-text #a42bda04","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Analysis.FunctionalAnalysis.MarkovKakutani.markovKakutani_commonFixedPoint","library":"atlas","line":240,"location_key":"4a8a8ac7002459bba2b4731195cba2fadf4ee45e0aa8d36c4d8a6263f567dce5","module":"MathlibExt.Analysis.FunctionalAnalysis.MarkovKakutani","note":"It restricts the maps to continuous affine ones, where the passage allows every continuous self-map, and it allows any nonempty compact convex set, of which the closed unit ball is one.","pair_key":"41683e739ed709ab54e8a649be64139950ad44663ccb6f2d1236e80679aaf1de","path":"MathlibExt/Analysis/FunctionalAnalysis/MarkovKakutani.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Analysis.FunctionalAnalysis.MarkovKakutani.markovKakutani_commonFixedPoint {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {K : Set E} : K.Nonempty → IsCompact K → Convex ℝ K → ∀ {ι : Type*} (F : ι → E →ᴬ[ℝ] E), (∀ (i : ι), Set.MapsTo (⇑(F i)) K K) → (∀ (i j : ι) (x : E), (F i) ((F j) x) = (F j) ((F i) x)) → ∃ x ∈ K, ∀ (i : ι), (F i) x = x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"exists_mem_Icc_isFixedPt_of_mapsTo","end_line":622,"library":"mathlib","line":620,"location_key":"fe761aceae81a699056d21656bdbdb4097d1e894e2932740e8bc01ecc4c2359a","module":"Mathlib.Topology.Order.IntermediateValue","note":"It is the one-dimensional case, where the closed unit ball is a closed real interval, and it is stated for any suitable linear order rather than for Euclidean space.","pair_key":"dbd11d7cf228a18981c1af48dcedb8aa0ed0176fabf464a7723e5be34ec0d3f7","path":"Mathlib/Topology/Order/IntermediateValue.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem exists_mem_Icc_isFixedPt_of_mapsTo {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] [DenselyOrdered α] {a b : α} {f : α → α} : ContinuousOn f (Set.Icc a b) → a ≤ b → Set.MapsTo f (Set.Icc a b) (Set.Icc a b) → ∃ c ∈ Set.Icc a b, Function.IsFixedPt f c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cc0dd3503c23e2ec583dfd2ff630de1f5a51f8bd2a5dd6dddf557c0e25ceacfc","prominence":"central","quote":{"exact":"The Brouwer fixed-point theorem (1911) says that any continuous function from the"},"quote_capped":true,"section":["Fixed-point theorems"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"after":{"layer":", but it doesn't describe how to find the fixed point.","segments":[{"text":", but it doesn't describe how to find the fixed point."}]},"layer":"The Brouwer fixed-point theorem (1911) says that any continuous function from the closed unit ball in n-dimensional Euclidean space to itself must have a fixed point","segments":[{"text":"The Brouwer fixed-point theorem (1911) says that any continuous function from the closed unit ball in n-dimensional Euclidean space to itself must have a fixed point"}]},"unresolved":null},{"absence":null,"basis":"c13ca3204dbed5af55ce363590bcbacb7a4d4e94917a9991cd5d7c1d059f9fd1","coverage":null,"id":"enwiki-449738-1364471395::In-text #310be583","item":"In-text #310be583","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MulAction.fixedBy","end_line":123,"library":"mathlib","line":122,"location_key":"c13ca3204dbed5af55ce363590bcbacb7a4d4e94917a9991cd5d7c1d059f9fd1","module":"Mathlib.GroupTheory.GroupAction.Defs","note":"Mathlib collects the points an element sends to themselves into a set and states it for a monoid action, the passage's group action being one of those.","pair_key":"50d131a2032db5316ba4ea3700e85a3c08d8a2ed2097a89af51361b904fa0ae1","path":"Mathlib/GroupTheory/GroupAction/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MulAction.fixedBy {M : Type*} (α : Type*) [Monoid M] [MulAction M α] : M → Set α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0af2bee5e8d82cb7be624d3cbe93c91486adf6b6893b8ff616626af80479428c","prominence":"central","quote":{"exact":"In algebra, for a group G acting on a set X with"},"quote_capped":true,"section":["Fixed point of a group action"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In algebra, for a group G acting on a set X with a group action ⋅ {\\displaystyle \\cdot } , x in X is said to be a fixed point of g if g ⋅ x = x {\\displaystyle g\\cdot x=x} .","segments":[{"text":"In algebra, for a group G acting on a set X with a group action "},{"tex":"\\cdot"},{"text":" , x in X is said to be a fixed point of g if "},{"tex":"g\\cdot x=x"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"c3c8fa39a93dbf33d64ac13fc92c9cce0b1f08d419fc2f024f6de39f318f5993","coverage":null,"id":"enwiki-449738-1364471395::In-text #37628c1e","item":"In-text #37628c1e","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.fixedSubgroup","end_line":62,"library":"tauceti","line":62,"location_key":"c3c8fa39a93dbf33d64ac13fc92c9cce0b1f08d419fc2f024f6de39f318f5993","module":"TauCeti.GroupTheory.FixedSubgroup","note":"TauCeti returns the subgroup of points an endomorphism sends to themselves, as the place where the map agrees with the identity, and the passage's automorphism is one endomorphism.","pair_key":"a5118181f42d32d6096803a9d814ba3dbd0f5975997edc273b8d093da74cb7c3","path":"TauCeti/GroupTheory/FixedSubgroup.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"abbrev TauCeti.fixedSubgroup {G : Type*} [Group G] : (G →* G) → Subgroup G"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FixedPoints.subgroup","end_line":205,"library":"mathlib","line":203,"location_key":"67ee7af49805db924debfc201db6ad24400c8bc47065bea635fd1773d4e03d80","module":"Mathlib.GroupTheory.GroupAction.Defs","note":"It takes the elements fixed by every member of an acting monoid, so reaching the passage's single automorphism needs the monoid it generates and an argument over its powers.","pair_key":"889274594ebf1cf8b93af72bd168457834906704e293ecd9a16a67752b679a58","path":"Mathlib/GroupTheory/GroupAction/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FixedPoints.subgroup (M : Type u) (α : Type v) [Monoid M] [Group α] [MulDistribMulAction M α] : Subgroup α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"50f0184deb1b95037267998f03ea3baf90d387ae9eea9825b51c8db561095e4f","prominence":"central","quote":{"exact":"The fixed-point subgroup G f {\\displaystyle G^{f}} of an automorphism f of"},"quote_capped":true,"section":["Fixed point of a group action"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"The fixed-point subgroup G f {\\displaystyle G^{f}} of an automorphism f of a group G is the subgroup of G: G f = { g ∈ G ∣ f ( g ) = g } . {\\displaystyle G^{f}=\\{g\\in G\\mid f(g)=g\\}.}","segments":[{"text":"The fixed-point subgroup "},{"tex":"G^{f}"},{"text":" of an automorphism f of a group G is the subgroup of G: "},{"display":true,"tex":"G^{f}=\\{g\\in G\\mid f(g)=g\\}."}]},"unresolved":null},{"absence":null,"basis":"946fa9ac737b96aefb16806a2cfb5964bbd2844b56a97557deb053751ca618c0","coverage":null,"id":"enwiki-449738-1364471395::In-text #a1607322","item":"In-text #a1607322","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"RingHom.eqLocus","end_line":860,"library":"mathlib","line":859,"location_key":"946fa9ac737b96aefb16806a2cfb5964bbd2844b56a97557deb053751ca618c0","module":"Mathlib.Algebra.Ring.Subring.Basic","note":"Mathlib builds the subring on which two ring homomorphisms agree, which at the identity as second map is the subring the passage defines.","pair_key":"d4857601b88ac99ed0d7d9f9fbe248082e388d6a1875af5e615fd46c74475f81","path":"Mathlib/Algebra/Ring/Subring/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def RingHom.eqLocus {R : Type u} [NonAssocRing R] {S : Type v} [Semiring S] : (R →+* S) → (R →+* S) → Subring R"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FixedPoints.subring","end_line":97,"library":"mathlib","line":95,"location_key":"0c1db99382c7e0448ade331e554c46926a30dd58f342e99535c884d64e0db0c9","module":"Mathlib.Algebra.Algebra.Subalgebra.Operations","note":"It takes the elements fixed by every member of an acting monoid, so the passage's single automorphism is reached only through the monoid it generates.","pair_key":"848f785a45405b4754e468f4de12cabfd983866983d94be1ad3c3fe24e56a3a9","path":"Mathlib/Algebra/Algebra/Subalgebra/Operations.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FixedPoints.subring (B : Type*) [Ring B] (G : Type*) [Monoid G] [MulSemiringAction G B] : Subring B"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a1a4e896449620249883d02dcb5aab7050798d8be9f04c394f6f4254face7ec4","prominence":"central","quote":{"exact":"Similarly, the fixed-point subring R f {\\displaystyle R^{f}} of an automorphism f"},"quote_capped":true,"section":["Fixed point of a group action"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Similarly, the fixed-point subring R f {\\displaystyle R^{f}} of an automorphism f of a ring R is the subring of the fixed points of f, that is, R f = { r ∈ R ∣ f ( r ) = r } . {\\displaystyle R^{f}=\\{r\\in R\\mid f(r)=r\\}.}","segments":[{"text":"Similarly, the fixed-point subring "},{"tex":"R^{f}"},{"text":" of an automorphism f of a ring R is the subring of the fixed points of f, that is, "},{"display":true,"tex":"R^{f}=\\{r\\in R\\mid f(r)=r\\}."}]},"unresolved":null},{"absence":null,"basis":"072a89226953d39970f0b67ca2728521838d932400b8bc34f661b2f27bd822f4","coverage":null,"id":"enwiki-449738-1364471395::In-text #69cc1e42","item":"In-text #69cc1e42","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FixedPoints.subfield","end_line":105,"library":"mathlib","line":103,"location_key":"072a89226953d39970f0b67ca2728521838d932400b8bc34f661b2f27bd822f4","module":"Mathlib.FieldTheory.Fixed","note":"Mathlib indexes the construction by an acting monoid, so it covers those of the passage's sets of automorphisms that form a monoid.","pair_key":"1e67173a5071d035ced57d016d08f56623fe64690354845b39d51b700266d388","path":"Mathlib/FieldTheory/Fixed.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FixedPoints.subfield (M : Type u) [Monoid M] (F : Type v) [Field F] [MulSemiringAction M F] : Subfield F"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FixedBy.subfield","end_line":54,"library":"mathlib","line":47,"location_key":"87124c7f25970fde848d52c540191b107b7b8d9e8ebc8fbb4fccb8462b5fd8ee","module":"Mathlib.FieldTheory.Fixed","note":"It handles the one-element case of the passage's set of automorphisms.","pair_key":"3247f4e6bc188dbd421223f04b88dcc0ff2a6aa33d95644b663d76d8fb2bd128","path":"Mathlib/FieldTheory/Fixed.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FixedBy.subfield {M : Type u} [Monoid M] (F : Type v) [Field F] [MulSemiringAction M F] : M → Subfield F"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c31920cd719aba5fa28a1682b91ff9f78c6ffdfbb8258acb5ddc7eb2bb7744ba","prominence":"central","quote":{"exact":"In Galois theory, the set of the fixed points of a set"},"quote_capped":true,"section":["Fixed point of a group action"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In Galois theory, the set of the fixed points of a set of automorphisms of a field is called the fixed field of the set of automorphisms.","segments":[{"text":"In Galois theory, the set of the fixed points of a set of automorphisms of a field is called the fixed field of the set of automorphisms."}]},"unresolved":null},{"absence":null,"basis":"9e321c161db6886ae6d9cf116c99344abb83c1cc6d2a92449d21a8f79c24f9d2","coverage":null,"id":"enwiki-449738-1364471395::In-text #d9873c5f","item":"In-text #d9873c5f","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Topology.NonseparatingPlanarContinuumWanted.HasFixedPointProperty","library":"atlas","line":48,"location_key":"9e321c161db6886ae6d9cf116c99344abb83c1cc6d2a92449d21a8f79c24f9d2","module":"WantedExt.Topology.NonseparatingPlanarContinuumWanted","note":"The library predicate is written only for subsets of the two-dimensional Euclidean plane, while the passage defines the property for an arbitrary topological space.","pair_key":"784ee37c90b3b43e181b1a62f18dfb30794ec661da8d206eb6c455db8303a19c","path":"WantedExt/Topology/NonseparatingPlanarContinuumWanted.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Topology.NonseparatingPlanarContinuumWanted.HasFixedPointProperty : Set (EuclideanSpace ℝ (Fin 2)) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.IsFixedPt","end_line":214,"library":"mathlib","line":214,"location_key":"dcf50ca6573c12c86f6b99ed7d0749055d65f90e39ca3692803c4c9ac7927c5d","module":"Mathlib.Logic.Function.Defs","note":"This is the underlying notion of a point with f x = x, which the passage's definition quantifies over, not the property of the space itself.","pair_key":"6ed3f96670535dabaa37273a666437bfae11469b9a3c5f37c3f1b7ca6d3d8ba9","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"366da895cd86583ae5e284a67fe8bccabadd67fedd89f1966a1e893f2c4b1174","prominence":"central","quote":{"exact":"A topological space X {\\displaystyle X} is said to have the fixed"},"quote_capped":true,"section":["Topological fixed point property"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"A topological space X {\\displaystyle X} is said to have the fixed point property (FPP) if for any continuous function f : X → X {\\displaystyle f\\colon X\\to X} there exists x ∈ X {\\displaystyle x\\in X} such that f ( x ) = x {\\displaystyle f(x)=x} .","segments":[{"text":"A topological space "},{"tex":"X"},{"text":" is said to have the fixed point property (FPP) if for any continuous function "},{"tex":"f\\colon X\\to X"},{"text":" there exists "},{"tex":"x\\in X"},{"text":" such that "},{"tex":"f(x)=x"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"0c0b52bd25a4fa6505d0401110cbfc9a16f19c39691a075e888203c8dcbf97d0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #35e1482a","item":"In-text #35e1482a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f83a853e644e4cc38524151ce0afaab24803066684d01bc8aa21fdefbd46157e","prominence":"central","quote":{"exact":"The FPP is a topological invariant, i.e., it is preserved by any"},"quote_capped":true,"section":["Topological fixed point property"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"The FPP is a topological invariant, i.e., it is preserved by any homeomorphism.","segments":[{"text":"The FPP is a topological invariant, i.e., it is preserved by any homeomorphism."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"371642692d5ddcea8d2634e5cddc5e80aef2d3cafcfe62b13a755e450860514c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #b4109b78","item":"In-text #b4109b78","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"47a08a943a9b2576f93f7900e7431135838150b08c729a285fad9f479aa302a8","prominence":"supporting","quote":{"exact":"The FPP is also preserved by any retraction."},"quote_capped":false,"section":["Topological fixed point property"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"The FPP is also preserved by any retraction.","segments":[{"text":"The FPP is also preserved by any retraction."}]},"unresolved":null},{"absence":null,"basis":"b51749cffe0d9e5baec161e290ae965a61ae4aca260a2eac685d9d40491ed313","coverage":null,"id":"enwiki-449738-1364471395::In-text #1636d623","item":"In-text #1636d623","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"exists_mem_Icc_isFixedPt_of_mapsTo","end_line":622,"library":"mathlib","line":620,"location_key":"b51749cffe0d9e5baec161e290ae965a61ae4aca260a2eac685d9d40491ed313","module":"Mathlib.Topology.Order.IntermediateValue","note":"The declaration covers the one-dimensional sets of the passage, the nonempty closed intervals, and says nothing in higher dimension; it also assumes the endpoints are ordered, so the empty set is left out.","pair_key":"412e8afb9f550676f9278f44abc39fbf4ad9bc13756a2ddeea267e369864ded9","path":"Mathlib/Topology/Order/IntermediateValue.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem exists_mem_Icc_isFixedPt_of_mapsTo {α : Type u} [TopologicalSpace α] [ConditionallyCompleteLinearOrder α] [OrderTopology α] [DenselyOrdered α] {a b : α} {f : α → α} : ContinuousOn f (Set.Icc a b) → a ≤ b → Set.MapsTo f (Set.Icc a b) (Set.Icc a b) → ∃ c ∈ Set.Icc a b, Function.IsFixedPt f c"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Topology.NonseparatingPlanarContinuumWanted.conjecture_holds","library":"atlas","line":69,"location_key":"4567ee365f8b5b11a3494011461b6993fdc50994bcd0dcd49e77f806d4b49e75","module":"WantedExt.Topology.NonseparatingPlanarContinuumWanted","note":"It gives the property for path-connected compact plane sets whose complement is connected; reaching the passage's plane case from it needs the unstated facts that a compact convex set is path-connected and does not disconnect the plane.","pair_key":"09deb51040f0de4152e281def93b62c14348c133f3ef0a4fa13746884f92d709","path":"WantedExt/Topology/NonseparatingPlanarContinuumWanted.lean","proof_status":"wanted","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Topology.NonseparatingPlanarContinuumWanted.conjecture_holds : MathlibExt.Topology.NonseparatingPlanarContinuumWanted.conjecture"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"94c4f7550433cf4ef9c5f0f6452578118cba884a7eebc9579520f1853db5f618","prominence":"central","quote":{"exact":"According to the Brouwer fixed-point theorem, every compact and convex subset of"},"quote_capped":true,"section":["Topological fixed point property"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"According to the Brouwer fixed-point theorem, every compact and convex subset of a Euclidean space has the FPP.","segments":[{"text":"According to the Brouwer fixed-point theorem, every compact and convex subset of a Euclidean space has the FPP."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"363f97508ad1eeff43fb30bc10e048921aeed0705bcde35d7b58eca3177cc68e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #3c4b0fa4","item":"In-text #3c4b0fa4","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ffb8357cbdd0f8a5ae739eab7f17ee5410912788d61522c2f2bc59352173f2db","prominence":"supporting","quote":{"exact":"Compactness alone does not imply the FPP"},"quote_capped":false,"section":["Topological fixed point property"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"after":{"layer":", and convexity is not even a topological property, so it makes sense to ask how to topologically characterize the FPP.","segments":[{"text":", and convexity is not even a topological property, so it makes sense to ask how to topologically characterize the FPP."}]},"layer":"Compactness alone does not imply the FPP","segments":[{"text":"Compactness alone does not imply the FPP"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"12ed9ee4c08acab6cc142433798dc02f8f337e395d8ab8df4678c2282dd9f170"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #e9aa81aa","item":"In-text #e9aa81aa","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2da5c3a2deb6d38bfdb1416efb7005099f7b6917655bc78273146ff4921afad9","prominence":"supporting","quote":{"exact":"convexity is not even a topological property"},"quote_capped":false,"section":["Topological fixed point property"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"after":{"layer":", so it makes sense to ask how to topologically characterize the FPP.","segments":[{"text":", so it makes sense to ask how to topologically characterize the FPP."}]},"before":{"layer":"Compactness alone does not imply the FPP, and ","segments":[{"text":"Compactness alone does not imply the FPP, and "}]},"layer":"convexity is not even a topological property","segments":[{"text":"convexity is not even a topological property"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"0a7882e68155951822b7dc23ab8e65c0017432101d7448394ca86a379a84b01e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #e9863257","item":"In-text #e9863257","kind":"conjecture","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b7099c358313d4a4bb022423b60f84dfbf9be79d5535a75c875a4cacc82a56ad","prominence":"supporting","quote":{"exact":"In 1932 Borsuk asked whether compactness together with contractibility could be a"},"quote_capped":true,"section":["Topological fixed point property"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In 1932 Borsuk asked whether compactness together with contractibility could be a necessary and sufficient condition for the FPP to hold.","segments":[{"text":"In 1932 Borsuk asked whether compactness together with contractibility could be a necessary and sufficient condition for the FPP to hold."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"03416f2cda1923b6e8bf7171d2e505917c577ac7b8d99f009a74c61c3c680b4b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #9dbc4f3c","item":"In-text #9dbc4f3c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9b92657a1126255efb67343850b7b9379fbd99538926c120fc27ddc406cdad99","prominence":"supporting","quote":{"exact":"The problem was open for 20 years until the conjecture was disproved"},"quote_capped":true,"section":["Topological fixed point property"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"The problem was open for 20 years until the conjecture was disproved by Kinoshita, who found an example of a compact contractible space without the FPP.","segments":[{"text":"The problem was open for 20 years until the conjecture was disproved by Kinoshita, who found an example of a compact contractible space without the FPP."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"ae4d364230313778df11aca995d8247a5be96fbbfe56c8f8c8e1bde3db84e0a9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #f0be2443","item":"In-text #f0be2443","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"85c7082c2d5c3120caa892245eda0f30c605053a03212b68c5962166ca50eedc","prominence":"central","quote":{"exact":"Let ≤ be a partial order over a set X and let"},"quote_capped":true,"section":["Fixed points of partial orders"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Let ≤ be a partial order over a set X and let f: X → X be a function over X. Then a prefixed point (also spelled pre-fixed point, sometimes shortened to prefixpoint or pre-fixpoint)[citation needed] of f is any p such that f(p) ≤ p.","segments":[{"text":"Let ≤ be a partial order over a set X and let f: X → X be a function over X. Then a prefixed point (also spelled pre-fixed point, sometimes shortened to prefixpoint or pre-fixpoint)[citation needed] of f is any p such that f(p) ≤ p."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"f294d7852aaf97354ff275b411a177af95bc9eb66d19e4e77e96353d08af4cd1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #ce09d213","item":"In-text #ce09d213","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c7d18f75efc3a8cffb1b3d33cd7759c41a512010094196d47a41703f93ed76a2","prominence":"central","quote":{"exact":"Analogously, a postfixed point of f is any p such that p"},"quote_capped":true,"section":["Fixed points of partial orders"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Analogously, a postfixed point of f is any p such that p ≤ f(p).[3]","segments":[{"text":"Analogously, a postfixed point of f is any p such that p ≤ f(p)."},{"ref":"[3]"}]},"unresolved":null},{"absence":null,"basis":"3817a5a3d3c462645c8c99fdc81a5ac7d641de842e14dd9eeb6ac4a0313283b7","coverage":null,"id":"enwiki-449738-1364471395::In-text #7beca2f6","item":"In-text #7beca2f6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"le_antisymm_iff","end_line":194,"library":"mathlib","line":193,"location_key":"3817a5a3d3c462645c8c99fdc81a5ac7d641de842e14dd9eeb6ac4a0313283b7","module":"Mathlib.Order.Defs.PartialOrder","note":"The declaration quantifies over any two elements of the order; reading it at the image point and the point itself gives the passage.","pair_key":"340d768816b876a9af3227ab21407458e6e746237200993c8bc7eb94ad6e628a","path":"Mathlib/Order/Defs/PartialOrder.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem le_antisymm_iff {α : Type*} [PartialOrder α] {a b : α} : a = b ↔ a ≤ b ∧ b ≤ a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3d314e949cf4999e899b6258f4f9caad6fb85a5f34a6e3d5c320e13e498642bb","prominence":"central","quote":{"exact":"A fixed point is a point that is both a prefixpoint and"},"quote_capped":true,"section":["Fixed points of partial orders"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"before":{"layer":"Malkis justifies the definition presented here as follows: \"since f is before the inequality sign in the term f(x) ≤ x, such x is called a prefix point.\"[5] ","segments":[{"text":"Malkis justifies the definition presented here as follows: \"since f is before the inequality sign in the term f(x) ≤ x, such x is called a prefix point.\""},{"ref":"[5]"},{"text":" "}]},"layer":"A fixed point is a point that is both a prefixpoint and a postfixpoint.","segments":[{"text":"A fixed point is a point that is both a prefixpoint and a postfixpoint."}]},"unresolved":null},{"absence":null,"basis":"6245a986b18b631bdf3d1b7615e91a2c95e0e4248b1a3c612de2da113984137c","coverage":null,"id":"enwiki-449738-1364471395::In-text #c7dcbee7","item":"In-text #c7dcbee7","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderHom.lfp","end_line":51,"library":"mathlib","line":49,"location_key":"6245a986b18b631bdf3d1b7615e91a2c95e0e4248b1a3c612de2da113984137c","module":"Mathlib.Order.FixedPoints","note":"The library builds the object only where the order is a complete lattice and the map is monotone, which is narrower than the passage's arbitrary poset and arbitrary function.","pair_key":"8f26e6c35986978f2df2fe28ec393132d8744133d2b454a460673a200b0eec27","path":"Mathlib/Order/FixedPoints.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def OrderHom.lfp {α : Type u} [CompleteLattice α] : (α →o α) →o α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderHom.isLeast_lfp","end_line":87,"library":"mathlib","line":86,"location_key":"b8eb9d1652887e806a15e87e1502bf8aeb2b6c346b096ee5044f5c17f921d451","module":"Mathlib.Order.FixedPoints","note":"The defining property is proved only for monotone maps on complete lattices, so it covers those objects and not every poset the passage allows.","pair_key":"f482ec83f6d786856dfd7f75c18669b15d53e9886d470428e52c3d802ad8644c","path":"Mathlib/Order/FixedPoints.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem OrderHom.isLeast_lfp {α : Type u} [CompleteLattice α] (f : α →o α) : IsLeast (Function.fixedPoints ⇑f) (OrderHom.lfp f)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"da9477285ddb0859bbc0eb937f33523e97cb3c8e214f0ce692560bbb18a69e21","prominence":"central","quote":{"exact":"In order theory, the least fixed point of a function from a"},"quote_capped":true,"section":["Fixed points of partial orders","Least fixed point"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In order theory, the least fixed point of a function from a partially ordered set (poset) to itself is the fixed point which is less than each other fixed point, according to the order of the poset.","segments":[{"text":"In order theory, the least fixed point of a function from a partially ordered set (poset) to itself is the fixed point which is less than each other fixed point, according to the order of the poset."}]},"unresolved":null},{"absence":null,"basis":"bfdde7cdef61cb92ee8b6848da57e0e74fe515644db0e56cd5c96452dc3d5570","coverage":null,"id":"enwiki-449738-1364471395::In-text #59e0a26a","item":"In-text #59e0a26a","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"IsLeast.unique","end_line":852,"library":"mathlib","line":851,"location_key":"bfdde7cdef61cb92ee8b6848da57e0e74fe515644db0e56cd5c96452dc3d5570","module":"Mathlib.Order.Bounds.Basic","note":"The library says nothing about functions that possess no least fixed point at all.","pair_key":"3e16c8280bc01af73164d55d5d73a707d52216db44e475f62a6b9ee644090a3c","path":"Mathlib/Order/Bounds/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsLeast.unique {α : Type*} [PartialOrder α] {s : Set α} {a b : α} : IsLeast s a → IsLeast s b → a = b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d73075bb969793e2c90a8a8daaef84d0b385bdeded0eb54ef27c06de4b10ad71","prominence":"supporting","quote":{"exact":"A function need not have a least fixed point, but if it"},"quote_capped":true,"section":["Fixed points of partial orders","Least fixed point"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"A function need not have a least fixed point, but if it does then the least fixed point is unique.","segments":[{"text":"A function need not have a least fixed point, but if it does then the least fixed point is unique."}]},"unresolved":null},{"absence":null,"basis":"0be881201211cf69c91d4f973d188b2751415dfc93b16ccb079a75157f4527de","coverage":null,"id":"enwiki-449738-1364471395::In-text #25ec02a2","item":"In-text #25ec02a2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderHom.isLeast_lfp","end_line":87,"library":"mathlib","line":86,"location_key":"0be881201211cf69c91d4f973d188b2751415dfc93b16ccb079a75157f4527de","module":"Mathlib.Order.FixedPoints","note":"It does not record that this element is also the smallest point lying above its image.","pair_key":"55b484405b76baf9e48ee417de00a7c1f50f5ba16b69cc0dc54988cec4aa63fa","path":"Mathlib/Order/FixedPoints.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem OrderHom.isLeast_lfp {α : Type u} [CompleteLattice α] (f : α →o α) : IsLeast (Function.fixedPoints ⇑f) (OrderHom.lfp f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderHom.isLeast_lfp_le","end_line":84,"library":"mathlib","line":83,"location_key":"faadfefb1720f0270886ed3daab5bf11b39ba8f87f9abec36900333f7e2ae316","module":"Mathlib.Order.FixedPoints","note":"On its own it does not record that this element is a fixed point.","pair_key":"5451681dc40fd6e37c681af80202eb297c38a364c5df4b2ba3d406a375458a39","path":"Mathlib/Order/FixedPoints.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem OrderHom.isLeast_lfp_le {α : Type u} [CompleteLattice α] (f : α →o α) : IsLeast {a | f a ≤ a} (OrderHom.lfp f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderHom.isGreatest_gfp","end_line":121,"library":"mathlib","line":120,"location_key":"509cf0d7f83efa0df5e016ba0458511c183e862ba0ce69aa07beaf25f7287b0f","module":"Mathlib.Order.FixedPoints","note":"It does not record that this element is also the largest point lying below its image.","pair_key":"f85934f81bc4b69ccb40ee1b223f89be9e51ff30bb3fae9ffaa4ca34689bf3e5","path":"Mathlib/Order/FixedPoints.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem OrderHom.isGreatest_gfp {α : Type u} [CompleteLattice α] (f : α →o α) : IsGreatest (Function.fixedPoints ⇑f) (OrderHom.gfp f)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderHom.isGreatest_gfp_le","end_line":118,"library":"mathlib","line":117,"location_key":"60562f754d14fd9b444bb5a787a303c24ab0497ee063561d43b38075a023674c","module":"Mathlib.Order.FixedPoints","note":"On its own it does not record that this element is a fixed point.","pair_key":"89715bada87bd699409dc4ba08e58b338d866641c242012a417bcb4b581a25cd","path":"Mathlib/Order/FixedPoints.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem OrderHom.isGreatest_gfp_le {α : Type u} [CompleteLattice α] (f : α →o α) : IsGreatest {a | a ≤ f a} (OrderHom.gfp f)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d5c1aa2d07f5b986bf6b27db113bcaeb776f37b54141f7194b150f2079d9be1d","prominence":"central","quote":{"exact":"One way to express the Knaster–Tarski theorem is to say that a"},"quote_capped":true,"section":["Fixed points of partial orders","Least fixed point"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"One way to express the Knaster–Tarski theorem is to say that a monotone function on a complete lattice has a least fixed point that coincides with its least prefixpoint (and similarly its greatest fixed point coincides with its greatest postfixpoint).","segments":[{"text":"One way to express the Knaster–Tarski theorem is to say that a monotone function on a complete lattice has a least fixed point that coincides with its least prefixpoint (and similarly its greatest fixed point coincides with its greatest postfixpoint)."}]},"unresolved":null},{"absence":null,"basis":"7aa7bb1b2980e4814b85f63e2fb234cd64a7f7db32532957108dd3bf43f6f82c","coverage":null,"id":"enwiki-449738-1364471395::In-text #f93b4c66","item":"In-text #f93b4c66","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Part.fix","end_line":68,"library":"mathlib","line":66,"location_key":"7aa7bb1b2980e4814b85f63e2fb234cd64a7f7db32532957108dd3bf43f6f82c","module":"Mathlib.Control.Fix","note":"The library operator is built for partial-function types and delivers a fixed point for continuous arguments, which is narrower than the passage's unrestricted combinator.","pair_key":"b4651930e7e8fbaadc646f8753cf99d0135359955a0de6f8d2fef662bd23a469","path":"Mathlib/Control/Fix.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Part.fix {α : Type*} {β : α → Type*} : (((a : α) → Part (β a)) → (a : α) → Part (β a)) → (x : α) → Part (β x)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"LawfulFix","end_line":40,"library":"mathlib","line":39,"location_key":"67288bd5a879d8d5a07c0bbbb509f1b8b68f056f1fbad32611518714098b923c","module":"Mathlib.Control.LawfulFix","note":"The law is demanded only of continuous arguments, and the carrier must be an omega-complete partial order, so the notion is the passage's at those objects.","pair_key":"078ccacdff922e664ac9cd072ad24d5659d6513beee7932f0b901672800ff1dc","path":"Mathlib/Control/LawfulFix.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class LawfulFix (α : Type*) [OmegaCompletePartialOrder α]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a70b6bdede89897df0dc6795f194a4564019325f4839b2db550000a1db18f218","prominence":"central","quote":{"exact":"In combinatory logic for computer science, a fixed-point combinator is a higher-order"},"quote_capped":true,"section":["Fixed-point combinator"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In combinatory logic for computer science, a fixed-point combinator is a higher-order function f i x {\\displaystyle {\\mathsf {fix}}} that returns a fixed point of its argument function, if one exists.","segments":[{"text":"In combinatory logic for computer science, a fixed-point combinator is a higher-order function "},{"tex":"\\mathsf {fix}"},{"text":" that returns a fixed point of its argument function, if one exists."}]},"unresolved":null},{"absence":null,"basis":"3fa6c5a458029da0b5a0c1bd6b2d98493567834faf127f43a522e94f4eb1123b","coverage":null,"id":"enwiki-449738-1364471395::In-text #16db1b4e","item":"In-text #16db1b4e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Part.fix_eq_of_ωScottContinuous","end_line":167,"library":"mathlib","line":157,"location_key":"3fa6c5a458029da0b5a0c1bd6b2d98493567834faf127f43a522e94f4eb1123b","module":"Mathlib.Control.LawfulFix","note":"Continuity is assumed in place of the passage's weaker hypothesis that some fixed point exists, and continuous maps of this kind do have fixed points.","pair_key":"9d9d6d5cc00d6b547195544bc9cb524c379ec33a6b3b77b3878f3a6f1d83894c","path":"Mathlib/Control/LawfulFix.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Part.fix_eq_of_ωScottContinuous {α : Type*} {β : α → Type*} {g : ((a : α) → Part (β a)) → (a : α) → Part (β a)} : OmegaCompletePartialOrder.ωScottContinuous g → Part.fix g = g (Part.fix g)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"OrderHom.map_lfp","end_line":73,"library":"mathlib","line":71,"location_key":"0e66876b70bb1f6eefabc97d415c1eb3f39c3e8babc583501b8ba8f0ad452fd5","module":"Mathlib.Order.FixedPoints","note":"The hypotheses are a complete lattice and a monotone map, which are stronger than merely having a fixed point, and such maps always have one.","pair_key":"fdf276d8b44fda259f13d38deb4a4c46d51d299d19884eab1f37faf8ab913555","path":"Mathlib/Order/FixedPoints.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem OrderHom.map_lfp {α : Type u} [CompleteLattice α] (f : α →o α) : f (OrderHom.lfp f) = OrderHom.lfp f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b32c6cf41dfad5ebb1fda970bcf59d45ba8e5ad2d620c11878894d51ca218518","prominence":"central","quote":{"exact":"Formally, if the function f has one or more fixed points, then"},"quote_capped":true,"section":["Fixed-point combinator"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"Formally, if the function f has one or more fixed points, then f i x ⁡ f = f ( f i x ⁡ f ) . {\\displaystyle \\operatorname {\\mathsf {fix}} f=f(\\operatorname {\\mathsf {fix}} f).}","segments":[{"text":"Formally, if the function f has one or more fixed points, then "},{"tex":"\\operatorname {\\mathsf {fix}} f=f(\\operatorname {\\mathsf {fix}} f)."}]},"unresolved":null},{"absence":null,"basis":"77f80bc6ce950e7f016d642217837a193c1f99b985ee17953b1b4c5af75d6d49","coverage":null,"id":"enwiki-449738-1364471395::In-text #210b1bd3","item":"In-text #210b1bd3","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.IsFixedPt","end_line":214,"library":"mathlib","line":214,"location_key":"77f80bc6ce950e7f016d642217837a193c1f99b985ee17953b1b4c5af75d6d49","module":"Mathlib.Logic.Function.Defs","note":"Mathlib states the predicate for an arbitrary self-map of an arbitrary type, so it also covers maps with no projective geometry in them; no declaration in the universe carries the term double point.","pair_key":"5c56406236344310d248c4bcc502fe5f8f5e56275af938413dd6db3a1d508cb1","path":"Mathlib/Logic/Function/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop"},"statement":true},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MulAction.fixedBy","end_line":123,"library":"mathlib","line":122,"location_key":"648c2c825ac5a34a0724a1781abe14c76f42bf398315afbc7e21e2856583466c","module":"Mathlib.GroupTheory.GroupAction.Defs","note":"Mathlib defines the fixed set for any element of any monoid acting on any type; the projectivity acting on a projective space is one case of it, and the word used in the passage for such a point appears nowhere in the universe.","pair_key":"4d868d13ff324cee6841b2204d403a5438b5aa63a904e3a336d2117b51939c5c","path":"Mathlib/GroupTheory/GroupAction/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MulAction.fixedBy {M : Type*} (α : Type*) [Monoid M] [MulAction M α] : M → Set α"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Matrix.ProjectiveSpecialLinearGroup.IsParabolic.smul_parabolicFixedPoint","end_line":303,"library":"tauceti","line":301,"location_key":"b60e8300399ccd15a9b05109292f2a7f6c2cf73723312f054da64ae55b965e76","module":"TauCeti.Topology.Compactification.OnePoint.ProjectiveLine","note":"It treats only parabolic elements of the two dimensional projective special linear group acting on the projective line, one family among all projectivities, and it does not record any naming of such a point.","pair_key":"c4dfca49076be6dfbcde1ffe40ac2b12f81e432a1ad89ccadfe82e46971cfb77","path":"TauCeti/Topology/Compactification/OnePoint/ProjectiveLine.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Matrix.ProjectiveSpecialLinearGroup.IsParabolic.smul_parabolicFixedPoint {K : Type*} [Field K] [DecidableEq K] [NeZero 2] {g : Matrix.ProjectiveSpecialLinearGroup (Fin 2) K} : g.IsParabolic → g • g.parabolicFixedPoint = g.parabolicFixedPoint"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Projectivization.generalLinearGroup_smul_def","end_line":54,"library":"mathlib","line":52,"location_key":"26c73c1752378ae6daa0096c7e1994e60faa9e3e01ae3f79d7ff029c987a84e2","module":"Mathlib.LinearAlgebra.Projectivization.Action","note":"It unfolds how an invertible linear map acts on projective space and says nothing about points that stay put, so it only supplies the projectivity the passage talks about.","pair_key":"4941fce78c6e45d980e266c071bbc2a62276dd400d1521938236d2e3b9758cd4","path":"Mathlib/LinearAlgebra/Projectivization/Action.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Projectivization.generalLinearGroup_smul_def {K : Type*} {V : Type*} [AddCommGroup V] [DivisionRing K] [_root_.Module K V] (g : LinearMap.GeneralLinearGroup K V) (x : Projectivization K V) : g • x = Projectivization.map ↑g.toLinearEquiv ⋯ x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c1dca9c6d2f3f5a889af961404073039242a888e6da3252396399d2c926ddb85","prominence":"supporting","quote":{"exact":"In projective geometry, a fixed point of a projectivity has been called"},"quote_capped":true,"section":["Applications"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In projective geometry, a fixed point of a projectivity has been called a double point.","segments":[{"text":"In projective geometry, a fixed point of a projectivity has been called a double point."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"d7dd21c7453029f7320272a5a26c5bcb079f79ccbd7eb36b816fce719363f091"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #9cef9e31","item":"In-text #9cef9e31","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"af540073313fb613e8efe8c5e2ba4099cb9d79f5d365353e01d07fef09b4b738","prominence":"supporting","quote":{"exact":"In economics, a Nash equilibrium of a game is a fixed point"},"quote_capped":true,"section":["Applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"In economics, a Nash equilibrium of a game is a fixed point of the game's best response correspondence.","segments":[{"text":"In economics, a Nash equilibrium of a game is a fixed point of the game's best response correspondence."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"e1c2921374df60b1880cb0ddc4420c48db4824be06079c0df1b6d2185b1c43e2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-449738-1364471395::In-text #11b07035","item":"In-text #11b07035","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"415888a3950110d6e5b611d0645319c01273214cafae427f3b78b1020a9cb046","prominence":"supporting","quote":{"exact":"The vector of PageRank values of all web pages is the fixed"},"quote_capped":true,"section":["Applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"The vector of PageRank values of all web pages is the fixed point of a linear transformation derived from the World Wide Web's link structure.","segments":[{"text":"The vector of PageRank values of all web pages is the fixed point of a linear transformation derived from the World Wide Web's link structure."}]},"unresolved":null},{"absence":null,"basis":"7016b9924afc4bd18bb3f9dcc511c8c1d1f3f1dfc2f0f3b4db85681da2326b21","coverage":null,"id":"enwiki-449738-1364471395::In-text #c3bac157","item":"In-text #c3bac157","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.Kernel.Invariant","end_line":40,"library":"mathlib","line":39,"location_key":"7016b9924afc4bd18bb3f9dcc511c8c1d1f3f1dfc2f0f3b4db85681da2326b21","module":"Mathlib.Probability.Kernel.Invariance","note":"Mathlib states the notion for an arbitrary kernel and an arbitrary measure, so it also covers kernels that are not Markov and measures that are not probability distributions, cases with real content of their own; the chain of the passage is one instance of it.","pair_key":"d4d34c6401ec3f28a7d63b60c8e6058727568253747bfec29320308bebaf1d0f","path":"Mathlib/Probability/Kernel/Invariance.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ProbabilityTheory.Kernel.Invariant {α : Type*} {mα : MeasurableSpace α} : ProbabilityTheory.Kernel α α → MeasureTheory.Measure α → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.Kernel.Invariant.def","end_line":45,"library":"mathlib","line":44,"location_key":"6e677db919a0408838a729b2bd9295a653d55fc7e94aabad9f82971fe8d7dbe7","module":"Mathlib.Probability.Kernel.Invariance","note":"It only unfolds the invariance predicate into the equation that defines it, a definitional lemma rather than a statement of its own.","pair_key":"c67017da2b36a10e27a23383ab94903df9b531c3b89cdc1972ee41aab60ebeac","path":"Mathlib/Probability/Kernel/Invariance.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.Kernel.Invariant.def {α : Type*} {mα : MeasurableSpace α} {κ : ProbabilityTheory.Kernel α α} {μ : MeasureTheory.Measure α} : κ.Invariant μ → μ.bind ⇑κ = μ"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Probability.markovChainLaw_map_eval_succ","end_line":241,"library":"tauceti","line":237,"location_key":"e435bcf3068492016c6bf4a990a530516a2ebd069a524e35e47cabf60b61fed5","module":"TauCeti.Probability.Process.MarkovChain","note":"It says how the law at one time becomes the law at the next time under the transition kernel, which exhibits the one-step map but asserts nothing about a distribution that is unchanged by it.","pair_key":"795fcca6d2cbd5228f0953d829ad97935f8143cc58d3757f633bea34bde60835","path":"TauCeti/Probability/Process/MarkovChain.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.markovChainLaw_map_eval_succ {α : Type*} [MeasurableSpace α] (ν : MeasureTheory.Measure α) (κ : ProbabilityTheory.Kernel α α) [ProbabilityTheory.IsMarkovKernel κ] [MeasureTheory.IsProbabilityMeasure ν] (n : ℕ) : MeasureTheory.Measure.map (fun x ↦ x (n + 1)) (TauCeti.Probability.markovChainLaw ν κ) = (MeasureTheory.Measure.map (fun x ↦ x n) (TauCeti.Probability.markovChainLaw ν κ)).bind ⇑κ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e11c81177178ad94804aaeeb3363d0d32ac98d73e9b65dd7e5de88d621dc64c5","prominence":"supporting","quote":{"exact":"The stationary distribution of a Markov chain is the fixed point of"},"quote_capped":true,"section":["Applications"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=449738&oldid=1364471395","text":{"layer":"The stationary distribution of a Markov chain is the fixed point of the one step transition probability function.","segments":[{"text":"The stationary distribution of a Markov chain is the fixed point of the one step transition probability function."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":92836,"images":[{"author":"Jochen Burghardt","file":"Fixpoint012_svg.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Tkgd2007","file":"Question_book-new.svg","licence":"Cc-by-sa-3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"en"}],"marks":322,"passages":36,"sha256":"5de4ca36a5263e2ad4cb89a0d2bbb7241ca027b653de4ec4752fcfdd575d78fe","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"549abbd4485e391311496d897d9e746d5ea6ba42dc59babc2c1655d3c4eaa076","revision":1364471395,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"5d404c2611592b2d251c693cc8d83e0b2fbf1182eecc85569905873f8e9a6453","layer_sha256":"bb3acbdb4a73dad313611f31b71e671040753ec77fa5b412f0657ac9402850dd","renderer":"web-html/3"},"source_id":"enwiki-449738-1364471395","summary":{"by_library":{"atlas":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":1},"lean-core":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":0},"mathlib":{"complete":28,"incomplete":0,"locations":28,"passages":20,"related":11},"tauceti":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":1}},"by_prominence":{"central":{"by_status":{"formalized":8,"not_formalized":3,"partial":10,"statement_only":0,"unresolved":0},"passages":21},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":1,"not_formalized":10,"partial":2,"statement_only":1,"unresolved":0},"passages":14}},"by_proof_status":{"definition":20,"proved":26,"wanted":1},"by_relation":{"broadMatch":9,"closeMatch":2,"exactMatch":2,"hasPart":5,"narrowMatch":16,"relatedMatch":13},"by_status":{"formalized":10,"not_formalized":13,"partial":12,"statement_only":1,"unresolved":0},"locations":34,"passages":36,"related":13},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Fixed point (mathematics)","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q217608"}
