WikiLean · Articles Articles Brain Contribute About

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

Fixed point (mathematics)

36 passages10 formalized1 statement only12 partial13 not formalized

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1364471395, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: Start-class, High importance
  • 36 passages checked, 34 Lean locations (and 13 related declarations).

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

What the colours mean

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

Libraries searched

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

How these links were made

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

How the text is shown

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

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

Passages

What “exact match”, “more general” and the other labels mean
  1. Definition · Subject of the article

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    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.

    Show in article · Read it in context on Wikipedia

    Function.IsFixedPt exact match

    def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop

    Mathlib.Logic.Function.Defs · line 214

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d6e5f46a0738 · pair key 407d303087a6.
  2. Definition · main statement

    Formalized

    Formalized: Mathlib states this exactly (a Prop-valued definition: it states the claim without proving it).

    Specifically, for functions, a fixed point is an element that is mapped to itself by the function.

    Show in article · Read it in context on Wikipedia

    Function.IsFixedPt exact match

    def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop

    Mathlib.Logic.Function.Defs · line 214

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2f86a7ea24ed · pair key 3dbddd473f28.
  3. Theorem · main statement

    Partial

    Partial: Mathlib states a special case (proved).

    Any set of fixed points of a transformation is also an invariant set.

    Show in article · Read it in context on Wikipedia

    MulAction.set_mem_fixedBy_of_subset_fixedBy special case

    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

    Mathlib.GroupTheory.GroupAction.FixedPoints · lines 166–173

    Why a special case: The transformation here is restricted to one coming from a group action, and the conclusion is set equality rather than merely mapping into itself.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5c4a9d7e1511 · pair key 9013a9553880.
  4. Definition · main statement · Fixed point of a function

    Partial

    Partial: Mathlib states a special case (a Prop-valued definition: it states the claim without proving it).

    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.

    Show in article · Read it in context on Wikipedia

    Function.IsFixedPt special case

    def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop

    Mathlib.Logic.Function.Defs · line 214

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fc6125377418 · pair key 67ca63fe3490.
  5. Theorem · supporting · Fixed point of a function

    Not formalized
    In particular, f cannot have any fixed point if its domain is disjoint from its codomain.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt c98d78bdb205).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  6. Theorem · supporting · Fixed point of a function

    Not formalized
    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.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 505063cc88fe).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  7. Example · supporting · Fixed point of a function

    Not formalized
    For example, if f is defined on the real numbers by f(x) = x2 − 3x + 4, then 2 is a fixed point of f, because f(2) = 2.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 28b0d07c288f).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  8. Theorem · supporting · Fixed point of a function

    Partial

    Partial: Lean core states a special case (proved).

    Not all functions have fixed points: for example, f(x) = x + 1 has no fixed points because x + 1 is never equal to x for any real number.

    Show in article · Read it in context on Wikipedia

    Nat.add_one_ne_self special case

    theorem Nat.add_one_ne_self (n : Nat) : n + 1 ≠ n

    Init.Data.Nat.Basic · line 618

    Why a special case: The statement is carried out over the naturals rather than over the real line that the passage names.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 21452e9a226f · pair key 1895d2d93fc0.
  9. Definition · main statement · Fixed point iteration

    Formalized

    Formalized: Lean core states this up to a convention difference (a definition).

    Specifically, given a function f with the same domain and codomain, a point x0 in the domain of f, the fixed-point iteration is xn + 1 = f(xn),  n = 0, 1, 2, … which gives rise to the sequence x0, x1, x2, … of iterated function applications x0, f(x0), f(f(x0)), … which is hoped to converge to a point x.

    Show in article · Read it in context on Wikipedia

    Nat.repeat close match

    def Nat.repeat {α : Type u} : (α → α) → Nat → α → α

    Init.Data.Nat.Basic · lines 62–64

    Why close, not exact: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 6b98107b4af6 · pair key d06c6238d807.

    Function.iterate_succ_apply' close match

    theorem Function.iterate_succ_apply' {α : Type u} (f : α → α) (n : ℕ) (x : α) : f^[n.succ] x = f (f^[n] x)

    Mathlib.Logic.Function.Iterate · lines 174–176

    Why close, not exact: Mathlib proves that the library's iterated map obeys the step relation by which the passage defines its sequence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 39b4d533e2b0 · pair key bc2e817bea87.
  10. Theorem · main statement · Fixed point iteration

    Formalized

    Formalized: Mathlib states a more general result (proved).

    If f is continuous, then one can prove that the obtained x is a fixed point of f.

    Show in article · Read it in context on Wikipedia

    isFixedPt_of_tendsto_iterate more general

    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

    Mathlib.Dynamics.FixedPoints.Topology · lines 35–39

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a2cd884af3f3 · pair key c3a79ad8fd3f.
  11. Theorem · main statement · Fixed-point theorems

    Formalized

    Formalized: Mathlib states a more general result (proved).

    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.

    Show in article · Read it in context on Wikipedia

    ContractingWith.exists_fixedPoint more general

    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)

    Mathlib.Topology.MetricSpace.Contracting · lines 97–106

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5a95896a2cba · pair key e5c318d571cc.
  12. Theorem · main statement · Fixed-point theorems

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    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, but it doesn't describe how to find the fixed point.

    Show in article · Read it in context on Wikipedia

    MathlibExt.Analysis.FunctionalAnalysis.MarkovKakutani.markovKakutani_commonFixedPoint special case

    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

    MathlibExt.Analysis.FunctionalAnalysis.MarkovKakutani · line 240

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 4a8a8ac70024 · pair key 41683e739ed7.

    exists_mem_Icc_isFixedPt_of_mapsTo special case

    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

    Mathlib.Topology.Order.IntermediateValue · lines 620–622

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fe761aceae81 · pair key dbd11d7cf228.
  13. Definition · main statement · Fixed point of a group action

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    In algebra, for a group G acting on a set X with a group action ⋅, x in X is said to be a fixed point of g if g ⋅ x = x.

    Show in article · Read it in context on Wikipedia

    MulAction.fixedBy more general

    def MulAction.fixedBy {M : Type*} (α : Type*) [Monoid M] [MulAction M α] : M → Set α

    Mathlib.GroupTheory.GroupAction.Defs · lines 122–123

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c13ca3204dbe · pair key 50d131a2032d.
  14. Definition · main statement · Fixed point of a group action

    Formalized

    Formalized: TauCeti states a more general result (a definition).

    The fixed-point subgroup Gf of an automorphism f of a group G is the subgroup of G: Gf = {g ∈ G ∣ f(g) = g}.

    Show in article · Read it in context on Wikipedia

    TauCeti.fixedSubgroup more general

    abbrev TauCeti.fixedSubgroup {G : Type*} [Group G] : (G →* G) → Subgroup G

    TauCeti.GroupTheory.FixedSubgroup · line 62

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key c3c8fa39a93d · pair key a5118181f42d.
  15. Definition · main statement · Fixed point of a group action

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Similarly, the fixed-point subring Rf of an automorphism f of a ring R is the subring of the fixed points of f, that is, Rf = {r ∈ R ∣ f(r) = r}.

    Show in article · Read it in context on Wikipedia

    RingHom.eqLocus more general

    def RingHom.eqLocus {R : Type u} [NonAssocRing R] {S : Type v} [Semiring S] : (R →+* S) → (R →+* S) → Subring R

    Mathlib.Algebra.Ring.Subring.Basic · lines 859–860

    Why more general: Mathlib builds the subring on which two ring homomorphisms agree, which at the identity as second map is the subring the passage defines.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 946fa9ac737b · pair key d4857601b88a.
  16. Definition · main statement · Fixed point of a group action

    Partial

    Partial: Mathlib states a special case (a definition).

    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.

    Show in article · Read it in context on Wikipedia

    FixedPoints.subfield special case

    def FixedPoints.subfield (M : Type u) [Monoid M] (F : Type v) [Field F] [MulSemiringAction M F] : Subfield F

    Mathlib.FieldTheory.Fixed · lines 103–105

    Why a special case: Mathlib indexes the construction by an acting monoid, so it covers those of the passage's sets of automorphisms that form a monoid.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 072a89226953 · pair key 1e67173a5071.

    FixedBy.subfield special case

    def FixedBy.subfield {M : Type u} [Monoid M] (F : Type v) [Field F] [MulSemiringAction M F] : M → Subfield F

    Mathlib.FieldTheory.Fixed · lines 47–54

    Why a special case: It handles the one-element case of the passage's set of automorphisms.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 87124c7f2597 · pair key 3247f4e6bc18.
  17. Definition · main statement · Topological fixed point property

    Partial

    Partial: ATLAS (atlas-lean) states a special case (a Prop-valued definition: it states the claim without proving it).

    A topological space X is said to have the fixed point property (FPP) if for any continuous function f: X → X there exists x ∈ X such that f(x) = x.

    Show in article · Read it in context on Wikipedia

    MathlibExt.Topology.NonseparatingPlanarContinuumWanted.HasFixedPointProperty special case

    def MathlibExt.Topology.NonseparatingPlanarContinuumWanted.HasFixedPointProperty : Set (EuclideanSpace ℝ (Fin 2)) → Prop

    WantedExt.Topology.NonseparatingPlanarContinuumWanted · line 48

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 9e321c161db6 · pair key 784ee37c90b3.
  18. Theorem · main statement · Topological fixed point property

    Not formalized
    The FPP is a topological invariant, i.e., it is preserved by any homeomorphism.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0c0b52bd25a4).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  19. Theorem · supporting · Topological fixed point property

    Not formalized
    The FPP is also preserved by any retraction.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 371642692d5d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  20. Theorem · main statement · Topological fixed point property

    Partial

    Partial: Mathlib states a special case (proved).

    According to the Brouwer fixed-point theorem, every compact and convex subset of a Euclidean space has the FPP.

    Show in article · Read it in context on Wikipedia

    exists_mem_Icc_isFixedPt_of_mapsTo special case

    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

    Mathlib.Topology.Order.IntermediateValue · lines 620–622

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b51749cffe0d · pair key 412e8afb9f55.
  21. Theorem · supporting · Topological fixed point property

    Not formalized
    Compactness alone does not imply the FPP, and convexity is not even a topological property, so it makes sense to ask how to topologically characterize the FPP.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 363f97508ad1).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  22. Theorem · supporting · Topological fixed point property

    Not formalized
    Compactness alone does not imply the FPP, and convexity is not even a topological property, so it makes sense to ask how to topologically characterize the FPP.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 12ed9ee4c08a).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  23. Conjecture · supporting · Topological fixed point property

    Not formalized
    In 1932 Borsuk asked whether compactness together with contractibility could be a necessary and sufficient condition for the FPP to hold.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 0a7882e68155).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  24. Theorem · supporting · Topological fixed point property

    Not formalized
    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.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 03416f2cda19).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  25. Definition · main statement · Fixed points of partial orders

    Not formalized
    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.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt ae4d36423031).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  26. Definition · main statement · Fixed points of partial orders

    Not formalized
    Analogously, a postfixed point of f is any p such that p ≤ f(p).[3]

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt f294d7852aaf).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  27. Theorem · main statement · Fixed points of partial orders

    Formalized

    Formalized: Mathlib states a more general result (proved).

    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] A fixed point is a point that is both a prefixpoint and a postfixpoint.

    Show in article · Read it in context on Wikipedia

    le_antisymm_iff more general

    theorem le_antisymm_iff {α : Type*} [PartialOrder α] {a b : α} : a = b ↔ a ≤ b ∧ b ≤ a

    Mathlib.Order.Defs.PartialOrder · lines 193–194

    Why more general: The declaration quantifies over any two elements of the order; reading it at the image point and the point itself gives the passage.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3817a5a3d3c4 · pair key 340d768816b8.
  28. Definition · main statement · Fixed points of partial orders › Least fixed point

    Partial

    Partial: Mathlib states a special case (a definition).

    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.

    Show in article · Read it in context on Wikipedia

    OrderHom.lfp special case

    def OrderHom.lfp {α : Type u} [CompleteLattice α] : (α →o α) →o α

    Mathlib.Order.FixedPoints · lines 49–51

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6245a986b18b · pair key 8f26e6c35986.

    OrderHom.isLeast_lfp special case

    theorem OrderHom.isLeast_lfp {α : Type u} [CompleteLattice α] (f : α →o α) : IsLeast (Function.fixedPoints ⇑f) (OrderHom.lfp f)

    Mathlib.Order.FixedPoints · lines 86–87

    Why a special case: The defining property is proved only for monotone maps on complete lattices, so it covers those objects and not every poset the passage allows.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b8eb9d165288 · pair key f482ec83f6d7.
  29. Theorem · supporting · Fixed points of partial orders › Least fixed point

    Partial

    Partial: Mathlib states part of this (proved).

    A function need not have a least fixed point, but if it does then the least fixed point is unique.

    Show in article · Read it in context on Wikipedia

    IsLeast.unique states part

    theorem IsLeast.unique {α : Type*} [PartialOrder α] {s : Set α} {a b : α} : IsLeast s a → IsLeast s b → a = b

    Mathlib.Order.Bounds.Basic · lines 851–852

    Why only part: The library says nothing about functions that possess no least fixed point at all.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key bfdde7cdef61 · pair key 3e16c8280bc0.
  30. Theorem · main statement · Fixed points of partial orders › Least fixed point

    Partial

    Partial: Mathlib states part of this (proved).

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

    Show in article · Read it in context on Wikipedia

    OrderHom.isLeast_lfp states part

    theorem OrderHom.isLeast_lfp {α : Type u} [CompleteLattice α] (f : α →o α) : IsLeast (Function.fixedPoints ⇑f) (OrderHom.lfp f)

    Mathlib.Order.FixedPoints · lines 86–87

    Why only part: It does not record that this element is also the smallest point lying above its image.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0be881201211 · pair key 55b484405b76.

    OrderHom.isLeast_lfp_le states part

    theorem OrderHom.isLeast_lfp_le {α : Type u} [CompleteLattice α] (f : α →o α) : IsLeast {a | f a ≤ a} (OrderHom.lfp f)

    Mathlib.Order.FixedPoints · lines 83–84

    Why only part: On its own it does not record that this element is a fixed point.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key faadfefb1720 · pair key 5451681dc40f.

    OrderHom.isGreatest_gfp states part

    theorem OrderHom.isGreatest_gfp {α : Type u} [CompleteLattice α] (f : α →o α) : IsGreatest (Function.fixedPoints ⇑f) (OrderHom.gfp f)

    Mathlib.Order.FixedPoints · lines 120–121

    Why only part: It does not record that this element is also the largest point lying below its image.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 509cf0d7f83e · pair key f85934f81bc4.

    OrderHom.isGreatest_gfp_le states part

    theorem OrderHom.isGreatest_gfp_le {α : Type u} [CompleteLattice α] (f : α →o α) : IsGreatest {a | a ≤ f a} (OrderHom.gfp f)

    Mathlib.Order.FixedPoints · lines 117–118

    Why only part: On its own it does not record that this element is a fixed point.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 60562f754d14 · pair key 89715bada87b.
  31. Definition · main statement · Fixed-point combinator

    Partial

    Partial: Mathlib states a special case (a definition).

    In combinatory logic for computer science, a fixed-point combinator is a higher-order function fix that returns a fixed point of its argument function, if one exists.

    Show in article · Read it in context on Wikipedia

    Part.fix special case

    def Part.fix {α : Type*} {β : α → Type*} : (((a : α) → Part (β a)) → (a : α) → Part (β a)) → (x : α) → Part (β x)

    Mathlib.Control.Fix · lines 66–68

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7aa7bb1b2980 · pair key b4651930e7e8.

    LawfulFix special case

    class LawfulFix (α : Type*) [OmegaCompletePartialOrder α]

    Mathlib.Control.LawfulFix · lines 39–40

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 67288bd5a879 · pair key 078ccacdff92.
  32. Theorem · main statement · Fixed-point combinator

    Partial

    Partial: Mathlib states a special case (proved).

    Formally, if the function f has one or more fixed points, then mathsffix f = f(mathsffix f).

    Show in article · Read it in context on Wikipedia

    Part.fix_eq_of_ωScottContinuous special case

    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)

    Mathlib.Control.LawfulFix · lines 157–167

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3fa6c5a45802 · pair key 9d9d6d5cc00d.

    OrderHom.map_lfp special case

    theorem OrderHom.map_lfp {α : Type u} [CompleteLattice α] (f : α →o α) : f (OrderHom.lfp f) = OrderHom.lfp f

    Mathlib.Order.FixedPoints · lines 71–73

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0e66876b70bb · pair key fdf276d8b44f.
  33. Notation · supporting · Applications

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    In projective geometry, a fixed point of a projectivity has been called a double point.

    Show in article · Read it in context on Wikipedia

    Function.IsFixedPt more general

    def Function.IsFixedPt {α : Type u₁} : (α → α) → α → Prop

    Mathlib.Logic.Function.Defs · line 214

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 77f80bc6ce95 · pair key 5c5640623634.

    MulAction.fixedBy more general

    def MulAction.fixedBy {M : Type*} (α : Type*) [Monoid M] [MulAction M α] : M → Set α

    Mathlib.GroupTheory.GroupAction.Defs · lines 122–123

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 648c2c825ac5 · pair key 4d868d13ff32.

    Matrix.ProjectiveSpecialLinearGroup.IsParabolic.smul_parabolicFixedPoint special case

    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

    TauCeti.Topology.Compactification.OnePoint.ProjectiveLine · lines 301–303

    Why a special case: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key b60e8300399c · pair key c4dfca49076b.
  34. Theorem · supporting · Applications

    Not formalized
    In economics, a Nash equilibrium of a game is a fixed point of the game's best response correspondence.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt d7dd21c74530).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  35. Theorem · supporting · Applications

    Not formalized
    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.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt e1c2921374df).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  36. Theorem · supporting · Applications

    Statement only

    Statement only: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    The stationary distribution of a Markov chain is the fixed point of the one step transition probability function.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.Kernel.Invariant more general

    def ProbabilityTheory.Kernel.Invariant {α : Type*} {mα : MeasurableSpace α} : ProbabilityTheory.Kernel α α → MeasureTheory.Measure α → Prop

    Mathlib.Probability.Kernel.Invariance · lines 39–40

    Why more general: 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.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7016b9924afc · pair key d4d34c6401ec.

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