Skip to the passage panel
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
Passages
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.

Select a highlighted passage to see where Lean formalizes it.

In mathematics, a rigid collection C of mathematical objects c (for instance sets or functions) is one in which every c ∈ C is uniquely determined by less information about c than one would expect. The above statement does not define a mathematical property; instead, it describes in what sense the adjective "rigid" is typically used in mathematics, by mathematicians.

Examples

Some examples include:

  1. Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values.
  2. Holomorphic functions are determined by the set of all derivatives at a single point. 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. The Schwarz lemma is an example of such a rigidity theorem.
  3. 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. 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.
  4. 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.
  5. Mostow's rigidity theorem, which states that the geometric structure of negatively curved manifolds is determined by their topological structure.
  6. A well-ordered set is rigid in the sense that the only (order-preserving) automorphism on it is the identity function. Consequently, an isomorphism between two given well-ordered sets will be unique.
  7. 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.
  8. Alexandrov's uniqueness theorem states that a convex polyhedron in three dimensions is uniquely determined by the metric space of geodesics on its surface.
  9. Rigidity results in K-theory show isomorphisms between various algebraic K-theory groups.
  10. Rigid groups in the inverse Galois problem.

Combinatorial use

In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection f : n → m {\displaystyle f:n\to m} for which the following equivalent conditions hold:[1]

  1. For every i , j ∈ m {\displaystyle i,j\in m} , i < j ⟹ min f − 1 ( i ) < min f − 1 ( j ) {\displaystyle i<j\implies \min f^{-1}(i)<\min f^{-1}(j)} ;
  2. Considering f {\displaystyle f} as an n {\displaystyle n} -tuple ( f ( 0 ) , f ( 1 ) , … , f ( n − 1 ) ) {\displaystyle {\big (}f(0),f(1),\ldots ,f(n-1){\big )}} , the first occurrences of the elements in m {\displaystyle m} are in increasing order;
  3. f {\displaystyle f} maps initial segments of n {\displaystyle n} to initial segments of m {\displaystyle m} .

This relates to the above definition of rigid, in that each rigid surjection f {\displaystyle f} uniquely defines, and is uniquely defined by, a partition of n {\displaystyle n} into m {\displaystyle m} pieces. Given a rigid surjection f {\displaystyle f} , the partition is defined by n = f − 1 ( 0 ) ⊔ ⋯ ⊔ f − 1 ( m − 1 ) {\displaystyle n=f^{-1}(0)\sqcup \cdots \sqcup f^{-1}(m-1)} . Conversely, given a partition of n = A 0 ⊔ ⋯ ⊔ A m − 1 {\displaystyle n=A_{0}\sqcup \cdots \sqcup A_{m-1}} , order the A i {\displaystyle A_{i}} by letting A i ≺ A j ⟺ min A i < min A j {\displaystyle A_{i}\prec A_{j}\iff \min A_{i}<\min A_{j}} . If n = B 0 ⊔ ⋯ ⊔ B m − 1 {\displaystyle n=B_{0}\sqcup \cdots \sqcup B_{m-1}} is now the ≺ {\displaystyle \prec } -ordered partition, the function f : n → m {\displaystyle f:n\to m} defined by f ( i ) = j ⟺ i ∈ B j {\displaystyle f(i)=j\iff i\in B_{j}} is a rigid surjection.

See also

References

  1. ^ Prömel, Hans Jürgen; Voigt, Bernd (April 1986). "Hereditary attributes of surjections and parameter sets". European Journal of Combinatorics. 7 (2): 161–170. doi:10.1016/s0195-6698(86)80042-7. ISSN 0195-6698.

This article incorporates material from rigid on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.