Preliminary: these links have not yet had an independent audit.
Rigidity (mathematics)
17 passages·✓8 formalized·◔3 partial·✕6 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
exact match states the passage exactly
close match states it up to a convention or a difference the note names
more general states a more general result, which implies it
special case states a special case of it
states part states one part of it
related states something related but different; never counted
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.
TauCeti.eqOn_of_harmonicOnNhd_of_eqOn_frontiermore 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
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.
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.
theorem Complex.taylorSeries_eq_of_entire'(c z : ℂ){f : ℂ → ℂ} :Differentiable ℂ f →∑' (n : ℕ),(↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z
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.
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
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.
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
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.
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.
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).
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.
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.
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.
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.
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.
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.
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.
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.
theorem Complex.taylorSeries_eq_of_entire'(c z : ℂ){f : ℂ → ℂ} :Differentiable ℂ f →∑' (n : ℕ),(↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z
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.
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.
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.
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
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.
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.
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.
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.
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.
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.
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.
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.
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.
Alexandrov's uniqueness theorem states that a convex polyhedron in three dimensions is uniquely determined by the metric space of geodesics on its surface.
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.
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:
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.
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.
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.
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.
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.
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.
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.
def IndexedPartition.mk'{ι : Type*}{α : Type*}(s : ι → Set α) :Pairwise (Function.onFun Disjoint s) →(∀ (i : ι), (s i).Nonempty) →(∀ (x : α), ∃ i, x ∈ s i) →IndexedPartition s
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.
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.
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.
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.
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).
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.
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.