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 all
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.
Related, but states something else (1)
TauCeti. exists_harmonicOnNhd_ball_continuousOn_closedBall_eq related
theorem TauCeti.exists_harmonicOnNhd_ball_continuousOn_closedBall_eq {n : ℕ} {g : ↑(Metric.sphere 0 1) → ℝ} : Continuous g → ∃ u, InnerProductSpace.HarmonicOnNhd u (Metric.ball 0 1) ∧ ContinuousOn u (Metric.closedBall 0 1) ∧ ∀ (z : ↑(Metric.sphere 0 1)), u ↑z = g z
TauCeti.Analysis.PDE.PoissonIntegral.Ball · lines 318–349
How it differs: This solves the boundary value problem on the unit ball, producing a harmonic function with prescribed continuous boundary data, which is the existence side and not the determination the passage asserts.
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 83245ab. Location key f0ac877f9f8f · pair key aef8d9a0988b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (2)
MathlibExt.Analysis.Calculus.BorelWanted. borel_jet_real related
theorem MathlibExt.Analysis.Calculus.BorelWanted.borel_jet_real (a : ℕ → ℝ) : ∃ f, ContDiff ℝ (↑⊤) f ∧ ∀ (n : ℕ), iteratedDeriv n f 0 = a n
MathlibExt.Analysis.Calculus.Borel · line 200
How it differs: It builds a smooth real function with any prescribed sequence of derivatives at the origin, but it produces one function only and so does not exhibit two smooth functions sharing all their derivatives 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. 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 64c2773. Location key 01283f196486 · pair key fc9cda6938a3.
expNegInvGlue. not_analyticAt_zero related
theorem expNegInvGlue.not_analyticAt_zero : ¬AnalyticAt ℝ expNegInvGlue 0
Mathlib.Analysis.SpecialFunctions.SmoothTransition · lines 72–78
How it differs: It says the standard smooth transition function is not analytic at the origin, which is about convergence of a power series and not about two functions with matching derivatives.
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 c6fd3cc397b0 · pair key 98f54d876d6b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Polynomial. eq_zero_of_hasseDeriv_eq_zero related
theorem Polynomial.eq_zero_of_hasseDeriv_eq_zero {R : Type*} [Semiring R] (f : R[X]) (r : R) : (∀ (k : ℕ), Polynomial.eval r ((Polynomial.hasseDeriv k) f) = 0) → f = 0
Mathlib.Algebra.Polynomial.Taylor · lines 114–118
How it differs: It concludes vanishing from the vanishing of all Hasse derivatives at a point, so the comparison of two polynomials is reached only after applying it to their difference.
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 f539b09b4bef · pair key f17687acfd54.
Complex. taylorSeries_eq_of_entire' related
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
How it differs: This is the determination of a function holomorphic on the plane by all of its derivatives at a point, the earlier example the passage leans on, and it does not say that finitely many of them suffice for a polynomial.
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 e41f2462be45 · pair key 39d58ffe5797.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
LinearMap. ext_on related
theorem LinearMap.ext_on {R : Type*} {R₂ : Type*} {M : Type*} {M₂ : Type*} [Semiring R] [AddCommMonoid M] [_root_.Module R M] [Semiring R₂] [AddCommMonoid M₂] [_root_.Module R₂ M₂] {σ₁₂ : R →+* R₂} {s : Set M} {f g : M →ₛₗ[σ₁₂] M₂} : Submodule.span R s = ⊤ → Set.EqOn (⇑f) (⇑g) s → f = g
Mathlib.LinearAlgebra.Span.Basic · lines 858–859
How it differs: Its hypothesis is that the set spans the whole space, so reaching the passage from it needs the separate fact that a basis spans X.
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 4cf818d9b41d · pair key 756eaddf0d66.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity. mostow_rigidity related
theorem MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.mostow_rigidity (n : ℕ) : … → ∀ (Γ Λ : Subgroup (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1)), IsDiscrete ↑Γ → IsDiscrete ↑Λ → ∀ [MeasureTheory.HasFundamentalDomain (↥Γ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume] [MeasureTheory.HasFundamentalDomain (↥Λ) …
Full type, as Lean prints it ∀ (n : ℕ), 3 ≤ n → ∀ (Γ Λ : Subgroup (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1)), IsDiscrete ↑Γ → IsDiscrete ↑Λ → ∀ [MeasureTheory.HasFundamentalDomain (↥Γ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume] [MeasureTheory.HasFundamentalDomain (↥Λ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume], MeasureTheory.covolume (↥Γ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume ≠ ⊤ → MeasureTheory.covolume (↥Λ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume ≠ ⊤ → ∀ (f : ↥Γ ≃* ↥Λ), ∃ g, ∀ (γ : ↥Γ), ↑(f γ) = g * ↑γ * g⁻¹
WantedExt.Geometry.MostowRigidityWanted · line 164
How it differs: It is phrased for discrete subgroups of the isometry group rather than for manifolds, so reaching the manifold formulation of the passage goes through the usual dictionary between the two.
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, which downgraded it. 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 b3f54892f3f9 · pair key 1b0ebcc8bb51.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
InitialSeg. instSubsingletonOfIsWellOrder related
instance InitialSeg.instSubsingletonOfIsWellOrder {α : Type*} {β : Type*} {r : α → α → Prop} {s : β → β → Prop} [IsWellOrder β s] : Subsingleton (InitialSeg r s)
Mathlib.Order.InitialSeg · lines 164–165
How it differs: It counts initial-segment embeddings rather than isomorphisms, so reaching the passage would need the map carrying an isomorphism to an initial segment together with its injectivity.
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 47e0ee3d4964 · pair key 2be4ac75173c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Related, but states something else (1)
MetaMathlibExt. IsSurjectiveRestrictedGrowthString related
def MetaMathlibExt.IsSurjectiveRestrictedGrowthString {n k : ℕ} : (Fin n → Fin k) → Prop
MathlibExt.Combinatorics.Enumerative.Partition.PeakGeneratingFunction · line 33
How it differs: It is a definition of the class of maps and proves no equivalence, so it leaves the passage's comparison of the three conditions unstated.
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 ed2e3e6a70cb · pair key 19fc25646a4f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
IndexedPartition. mk' related
def IndexedPartition.mk' {ι : Type*} {α : Type*} (s : ι → Set α) : Pairwise (Function.onFun Disjoint s) → (∀ (i : ι), (s i).Nonempty) → (∀ (x : α), ∃ i, x ∈ s i) → IndexedPartition s
Mathlib.Order.Setoid.Partition · lines 335–342
How it differs: It builds an indexed partition from a family that is pairwise disjoint, has nonempty members and covers the type, so reaching the passage's partition needs those three facts proved for the preimages of a surjection.
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, 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 b84f3363901d · pair key 6015f756b036.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 = A 0 ⊔ ⋯ ⊔ A m − 1 , order the A i by letting A i ≺ A j ⟺ min A i < min A j . Show all
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.
Related, but states something else (2)
OrderedFinpartition related
structure OrderedFinpartition : ℕ → Type
Mathlib.Analysis.Calculus.ContDiff.FaaDiBruno · lines 97–113
How it differs: This is the type of partitions of Fin n carrying an ordering of their parts, but by the library's own account the parts are ordered by increasing greatest element, which orders the blocks differently from the passage's least-element rule.
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 e4de76484806 · pair key 87ec1e71f2bd.
MetaMathlibExt. IsOrderedSetPartition related
def MetaMathlibExt.IsOrderedSetPartition {α : Type*} [DecidableEq α] : Finset α → List (Finset α) → Prop
MathlibExt.Combinatorics.Enumerative.OrderedSetPartition · line 21
How it differs: This says a list of nonempty finsets partitions a given finset, leaving the order of the list free; it imposes no condition tying a block's position to its least element.
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. 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 b375f8435f94 · pair key 80dbd8d05272.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Combinatorial use ✕ Not formalized
If n = B 0 ⊔ ⋯ ⊔ B m − 1 is now the ≺ -ordered partition, the function f : n → m defined by f (i ) = j ⟺ i ∈ B j is a rigid surjection. Show all
✕ 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).
Related, but states something else (2)
MetaMathlibExt. IsSurjectiveRestrictedGrowthString related
def MetaMathlibExt.IsSurjectiveRestrictedGrowthString {n k : ℕ} : (Fin n → Fin k) → Prop
MathlibExt.Combinatorics.Enumerative.Partition.PeakGeneratingFunction · line 33
How it differs: This defines, for a map between initial segments, the property that every label below the one at a position has already occurred earlier, which is the universe's rendering of the property the passage's map is claimed to have; it asserts nothing about a map built from a partition.
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 64c2773. Location key a9d6af5804b9 · pair key e72627adf23e.
Composition. index related
def Composition.index {n : ℕ} (c : Composition n) : Fin n → Fin c.length
Mathlib.Combinatorics.Enumerative.Composition · lines 316–317
How it differs: This is the map sending an element to the index of the block of a composition containing it, defined only for decompositions into consecutive intervals, and it is a definition rather than a claim that the map is a surjection with increasing preimage minima.
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 16f57a7e5f36 · pair key 6e4230962fb5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗