WikiLean · Articles Articles Brain Contribute About

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

Rigidity (mathematics)

17 passages8 formalized3 partial6 not formalized

Statement only

More ways to filter
Library
About this page

This page

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

Central statements: 7 of the 17 passages state the article's subject or a named result or definition; the other 10 are supporting (examples, setup). Of these 7: 2 formalized, 1 partial, 4 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 (4 locations and 4 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): 8 of 11 locations and 0 of 2 absences. In all, 12 of 15 Lean locations (80%) and 4 of 6 absences (67%) were re-checked.
  • Passage text: 17 of 17 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 1343796790 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

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

Passages

What “exact match”, “more general” and the other labels mean
  1. Theorem · supporting · Examples

    Formalized

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

    Some examples include:
    Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values.

    Show in article · Read it in context on Wikipedia

    TauCeti.eqOn_of_harmonicOnNhd_of_eqOn_frontier more general

    theorem TauCeti.eqOn_of_harmonicOnNhd_of_eqOn_frontier {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [Nontrivial E] {K : Set E} {f g : E → ℝ} : IsCompact K → ContinuousOn f K → ContinuousOn g K → InnerProductSpace.HarmonicOnNhd f (interior K) → InnerProductSpace.HarmonicOnNhd g (interior K) → (∀ ⦃x : E⦄, x ∈ frontier K → f x = g x) → Set.EqOn f g K

    TauCeti.Analysis.InnerProductSpace.Laplacian.Comparison · lines 115–124

    Why more general: The declaration is about real-valued harmonic functions on a compact set of a finite-dimensional real inner product space, with the unit disk one admissible choice of that set.

    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 6fe828bc1ab7 · pair key db5592474235.
  2. Theorem · supporting · Examples

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Mathlib states a special case (proved).

    Holomorphic functions are determined by the set of all derivatives at a single point.

    Show in article · Read it in context on Wikipedia

    Complex.taylorSeries_eq_of_entire' special case

    theorem Complex.taylorSeries_eq_of_entire' (c z : ℂ) {f : ℂ → ℂ} : Differentiable ℂ f → ∑' (n : ℕ), (↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z

    Mathlib.Analysis.Complex.TaylorSeries · lines 134–137

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why a special case: Complex.taylorSeries_eq_of_entire' shows that a function holomorphic on the whole complex plane equals its Taylor series at any point, so such a function is determined by its derivatives there. The passage covers holomorphic functions on any connected open domain, where that needs the identity theorem, so this is the special case of entire functions.

    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 139a04c38465 · pair key 5e927766254c.

    Complex.taylorSeries_eq_of_entire special case

    theorem Complex.taylorSeries_eq_of_entire {E : Type*} [NormedAddCommGroup E] [NormedSpace ℂ E] [CompleteSpace E] ⦃f : ℂ → E⦄ : Differentiable ℂ f → ∀ (c z : ℂ), ∑' (n : ℕ), (↑n.factorial)⁻¹ • (z - c) ^ n • iteratedDeriv n f c = f z

    Mathlib.Analysis.Complex.TaylorSeries · lines 128–130

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why a special case: Complex.taylorSeries_eq_of_entire shows that a function holomorphic on the whole complex plane, with values in any complete complex normed space, equals its Taylor series at any point, so it is determined by its derivatives there. The codomain is more general, but the domain is the whole plane only. The passage covers holomorphic functions on any connected open domain, so this covers only the entire case.

    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 477bac75e7d1 · pair key 26ef22acc2c6.

    Complex.taylorSeries_eq_on_ball' special case

    theorem Complex.taylorSeries_eq_on_ball' ⦃c : ℂ⦄ ⦃r : ℝ⦄ ⦃z : ℂ⦄ : z ∈ Metric.ball c r → ∀ {f : ℂ → ℂ}, DifferentiableOn ℂ f (Metric.ball c r) → ∑' (n : ℕ), (↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z

    Mathlib.Analysis.Complex.TaylorSeries · lines 72–75

    Why a special case: Here the domain is a single disk rather than the whole plane, so it covers the passage only for functions holomorphic on such a disk.

    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 3dfb8e2.
    • Location key c329dda102f3 · pair key c3ab98515b01.
  3. Theorem · supporting · Examples

    Not formalized
    A smooth function from the real line to the complex plane is not, in general, determined by all its derivatives at a single point, but it is if we require additionally that it be possible to extend the function to one on a neighbourhood of the real line in the complex plane.

    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 6 queries and 4 candidates examined (receipt ef44d2f9d68a).
    • 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).
  4. Theorem · main statement · Examples

    Formalized

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

    By the fundamental theorem of algebra, polynomials in C are rigid in the sense that any polynomial is completely determined by its values on any infinite set, say N, or the unit disk.

    Show in article · Read it in context on Wikipedia

    Polynomial.eq_of_infinite_eval_eq more general

    theorem Polynomial.eq_of_infinite_eval_eq {R : Type u} [CommRing R] [IsDomain R] (p q : R[X]) : {x | Polynomial.eval x p = Polynomial.eval x q}.Infinite → p = q

    Mathlib.Algebra.Polynomial.Roots · lines 164–168

    Why more general: Mathlib states it for polynomials over an arbitrary commutative integral domain, and the complex numbers form one.

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

    Polynomial.funext special case

    theorem Polynomial.funext {R : Type u} [CommRing R] [IsDomain R] [Infinite R] {p q : R[X]} : (∀ (r : R), Polynomial.eval r p = Polynomial.eval r q) → p = q

    Mathlib.Algebra.Polynomial.Roots · lines 469–473

    Why a special case: Here the infinite set is fixed to be the whole coefficient field instead of an arbitrary infinite subset 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 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 6e3a924ba3cb · pair key dee3fff7aeaf.
  5. Theorem · supporting · Examples

    Partial

    Partial: Mathlib states a special case (proved).

    By the previous example, a polynomial is also determined within the set of holomorphic functions by the finite set of its non-zero derivatives at any single point.

    Show in article · Read it in context on Wikipedia

    Polynomial.sum_taylor_eq special case

    theorem Polynomial.sum_taylor_eq {R : Type*} [CommRing R] (f : R[X]) (r : R) : (((Polynomial.taylor r) f).sum fun i a ↦ Polynomial.C a * (Polynomial.X - Polynomial.C r) ^ i) = f

    Mathlib.Algebra.Polynomial.Taylor · lines 208–211

    Why a special case: It pins the polynomial down within the polynomials rather than within all holomorphic functions, and it indexes the data by Taylor coefficients rather than by the derivatives themselves.

    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 8f534156decb · pair key 7d33265f1172.
  6. Theorem · supporting · Examples

    Formalized

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

    Linear maps L(X, Y) between vector spaces X, Y are rigid in the sense that any L ∈ L(X, Y) is completely determined by its values on any set of basis vectors of X.

    Show in article · Read it in context on Wikipedia

    Module.Basis.ext more general

    theorem Module.Basis.ext {ι : Type*} {R : Type*} {M : Type*} [Semiring R] [AddCommMonoid M] [_root_.Module R M] (b : Module.Basis ι R M) {R₁ : Type*} [Semiring R₁] {σ : R →+* R₁} {M₁ : Type*} [AddCommMonoid M₁] [_root_.Module R₁ M₁] {f₁ f₂ : M →ₛₗ[σ] M₁} : (∀ (i : ι), f₁ (b i) = f₂ (b i)) → f₁ = f₂

    Mathlib.LinearAlgebra.Basis.Defs · lines 315–318

    Why more general: Mathlib states it for semilinear maps of modules over semirings, and the passage's linear maps of vector spaces are the case of the identity ring map over a field.

    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 409d7bc87081 · pair key b9f1fc9c1f8a.
  7. Theorem · main statement · Examples

    Partial

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

    Mostow's rigidity theorem, which states that the geometric structure of negatively curved manifolds is determined by their topological structure.

    Show in article · Read it in context on Wikipedia

    TauCeti.MostowRigidity special case

    def TauCeti.MostowRigidity : Prop

    TauCeti.Geometry.Manifold.Riemannian.Hyperbolic.Mostow · lines 72–76

    Why a special case: The library confines the claim to hyperbolic metrics on closed connected manifolds of dimension at least three, where the passage speaks loosely of negatively curved manifolds.

    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 83245ab.
    • Location key c077267fd84f · pair key e0564286ce74.
  8. Theorem · supporting · Examples

    Formalized

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

    A well-ordered set is rigid in the sense that the only (order-preserving) automorphism on it is the identity function.

    Show in article · Read it in context on Wikipedia

    OrderIso.unique_of_wellFoundedLT close match

    instance OrderIso.unique_of_wellFoundedLT {α : Type*} [LinearOrder α] [WellFoundedLT α] : Unique (α ≃o α)

    Mathlib.Order.Hom.Set · line 224

    Why close, not exact: Mathlib records the fact as a Unique instance on the type of order-isomorphisms of the set with itself, in place of an equation between an arbitrary automorphism and the identity map.

    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 344411e76127 · pair key c1125e0e1822.

    OrderIso.subsingleton_of_wellFoundedLT more general

    instance OrderIso.subsingleton_of_wellFoundedLT {α : Type*} {β : Type*} [LinearOrder α] [WellFoundedLT α] [Preorder β] : Subsingleton (α ≃o β)

    Mathlib.Order.Hom.Set · lines 211–216

    Why more general: Mathlib allows any preordered target here, so the automorphism statement of the passage is the case where the target is the well-ordered set 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 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 7d55a08e89e5 · pair key 55fd03ac0c98.
  9. Theorem · supporting · Examples

    Formalized

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

    Consequently, an isomorphism between two given well-ordered sets will be unique.

    Show in article · Read it in context on Wikipedia

    OrderIso.subsingleton_of_wellFoundedLT more general

    instance OrderIso.subsingleton_of_wellFoundedLT {α : Type*} {β : Type*} [LinearOrder α] [WellFoundedLT α] [Preorder β] : Subsingleton (α ≃o β)

    Mathlib.Order.Hom.Set · lines 211–216

    Why more general: Mathlib asks for well-foundedness of the source order alone and leaves the target an arbitrary preorder.

    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 0b299c0a1359 · pair key 48c92048ad9c.
  10. Theorem · main statement · Examples

    Not formalized
    Cauchy's theorem on geometry of convex polytopes states that a convex polytope is uniquely determined by the geometry of its faces and combinatorial adjacency rules.

    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 fa9e7e7cbb52).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  11. Theorem · main statement · Examples

    Not formalized
    Alexandrov's uniqueness theorem states that a convex polyhedron in three dimensions is uniquely determined by the metric space of geodesics on its surface.

    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 962303c0b9f1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  12. Definition · main statement · Combinatorial use

    Formalized

    Formalized: ATLAS (atlas-lean) states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).

    In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection f : n → m for which the following equivalent conditions hold:

    Show in article · Read it in context on Wikipedia

    MetaMathlibExt.IsSurjectiveRestrictedGrowthString close match

    def MetaMathlibExt.IsSurjectiveRestrictedGrowthString {n k : ℕ} : (Fin n → Fin k) → Prop

    MathlibExt.Combinatorics.Enumerative.Partition.PeakGeneratingFunction · line 33

    Why close, not exact: Atlas writes the same class of maps with the restricted-growth wording, asking that every label below the one at a position already occur earlier, where the passage phrases it through the least elements of the preimages.

    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 58111ce5c4f6 · pair key a307e4dc0597.
  13. Theorem · main statement · Combinatorial use

    Not formalized
    In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection f : n → m for which the following equivalent conditions hold:[1]
    For every i, j ∈ m, i < j ⟹ min f−1(i) < min f−1(j); Considering f as an n -tuple (f(0), f(1), …, f(n − 1)), the first occurrences of the elements in m are in increasing order; f maps initial segments of n to initial segments of m.

    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 0 candidates examined (receipt f9f23cb0066f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  14. Theorem · main statement · Combinatorial use

    Not formalized
    This relates to the above definition of rigid, in that each rigid surjection f uniquely defines, and is uniquely defined by, a partition of n into m pieces.

    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 495168764411).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  15. Construction · supporting · Combinatorial use

    Formalized

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

    Given a rigid surjection f, the partition is defined by n = f−1(0) ⊔ ⋯ ⊔ f−1(m − 1).

    Show in article · Read it in context on Wikipedia

    Equiv.sigmaFiberEquiv more general

    def Equiv.sigmaFiberEquiv {α : Type*} {β : Type*} (f : α → β) : (y : β) × { x // f x = y } ≃ α

    Mathlib.Logic.Equiv.Sum · lines 236–237

    Why more general: Mathlib builds the canonical equivalence for an arbitrary map between arbitrary types, indexing the preimages by the whole codomain, so it also covers maps that are neither onto nor rigid.

    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 fb88409bf413 · pair key 611ddb49bef3.
  16. Construction · supporting · Combinatorial use

    Formalized

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

    Conversely, given a partition of n = A0 ⊔ ⋯ ⊔ Am − 1, order the Ai by letting Ai ≺ Aj ⟺ min Ai < min Aj.

    Show in article · Read it in context on Wikipedia

    Order.Preimage more general

    def Order.Preimage {α : Type*} {β : Type*} : (α → β) → (β → β → Prop) → α → α → Prop

    Mathlib.Order.Basic · line 97

    Why more general: Mathlib defines the comparison pulled back along an arbitrary key map; the passage's block precedence is the instance whose key sends a block to its least element and whose relation is < on ℕ.

    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, low 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 4daeddfc7e91 · pair key 9163885c7fe4.
  17. Theorem · supporting · Combinatorial use

    Not formalized
    If n = B0 ⊔ ⋯ ⊔ Bm − 1 is now the ≺ -ordered partition, the function f : n → m defined by f(i) = j ⟺ i ∈ Bj is a rigid surjection.

    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 4 candidates examined (receipt 51f4362c6d48).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).

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