Definition · Subject of the article ◔ Partial
Partial: ATLAS (atlas-lean) states a special case (a Prop-valued definition: it states the claim without proving it).
In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Show all
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope. IsRegular special case
def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular {n : ℕ} : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope n → Prop
WantedExt.Geometry.PlatonicClassificationWanted · line 118
Why a special case: Regularity is written here as a full-dimensional convex polytope whose symmetry group is transitive on flags, which for a plane polygon amounts to equal sides together with equal angles, while the convex hull setting leaves out the star polygons the article also admits.
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 3c307b10ffe7 · pair key 425fa29086c6.
Erdos94. regularNGon special case
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
Why a special case: The object is built from equally spaced points of the unit circle rather than from a condition on sides and angles, and it fixes both the centre and the circumradius.
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. 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 e754a78. Location key 1085282cd23e · pair key 9e3aa5301dd5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✕ Not formalized
Regular polygons may be either convex or star. 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 514f9d143e35). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✕ Not formalized
In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a straight line), if the edge length is fixed. 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 89a37f030393). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · General properties ✕ Not formalized
These properties apply to all regular polygons, whether convex or star: A regular n-sided polygon has rotational symmetry of order n. 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 3 candidates examined (receipt 765ac3af06b6). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · General properties ◔ Partial
Partial: Mathlib states a special case (proved).
All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon. Show all
Affine.Simplex. mem_circumsphere special case
theorem Affine.Simplex.mem_circumsphere {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} (s : Affine.Simplex ℝ P n) (i : Fin (n + 1)) : s.points i ∈ s.circumsphere
Mathlib.Geometry.Euclidean.Circumcenter · lines 235–237
Why a special case: The declaration speaks of a simplex of arbitrary dimension, so inside the plane it reaches the three-sided polygons of the article, and the common circle is the circumsphere Mathlib attaches to the simplex.
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 744f653b1da6 · pair key bae0cc872b3a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · General properties ✕ Not formalized
Together with the property of equal-length sides, this implies that every regular polygon also has an inscribed circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon. 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 0719458f93a6). 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 · General properties ◐ Statement only
Statement only: ATLAS (atlas-lean) states this up to a convention difference (wanted: stated as a goal, with no proof).
A regular n-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of n are distinct Fermat primes. Show all
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. gauss_wantzel_constructible_polygon close match
theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)
WantedExt.NumberTheory.GaussWantzelWanted · line 82
Why close, not exact: The library writes the drawing of the n-gon as membership of the cosine of two pi over n in the smallest subfield of the reals closed under square roots, and names the arithmetic side after Gauss and Wantzel, asking there that each odd prime factor of n be a distinct Fermat prime; it is asserted for n of three or more, the range in which an n-gon is a polygon at all.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. 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 a5e362d69903 · pair key 94043df1b5b2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · General properties ✕ Not formalized
(See constructible polygon.) A regular n-sided polygon can be constructed with origami if and only if n = 2a 3b p 1 ⋯p r for some r ∈ ℕ , where each distinct p i is a Pierpont prime. 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 c3c0cabdac46). 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 · General properties › Symmetry ✕ Not formalized
The symmetry group of an n-sided regular polygon is the dihedral group Dn (of order 2n): D2, D3, D4, ... 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 3 candidates examined (receipt 758df7405bf9). 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 (2)
DihedralGroup. nat_card related
theorem DihedralGroup.nat_card {n : ℕ} : Nat.card (DihedralGroup n) = 2 * n
Mathlib.GroupTheory.SpecificGroups.Dihedral · lines 159–162
How it differs: It counts the elements of the abstract dihedral group and mentions no geometric figure.
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 a2fb27933926 · pair key 11f1cafec21d.
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: It names the vertex set of a regular n-gon on the unit circle but proves nothing about its symmetries.
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 e754a78. Location key d503fbed617a · pair key ffbe5945a6bd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · General properties › Symmetry ✕ Not formalized
It consists of the rotations in Cn, together with reflection symmetry in n axes that pass through the center. 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 e2703cec79ff). 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)
TauCeti. isCyclic_dihedralRotations related
instance TauCeti.isCyclic_dihedralRotations (n : ℕ) : IsCyclic ↥(TauCeti.dihedralRotations n)
TauCeti.GroupTheory.SpecificGroups.Dihedral.Basic · lines 527–528
How it differs: It says the rotation subgroup of the abstract dihedral group is cyclic, with no plane figure and no axes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key cf3f92927dbf · pair key 66a026ff2de7.
TauCeti. index_dihedralRotations related
theorem TauCeti.index_dihedralRotations (n : ℕ) : (TauCeti.dihedralRotations n).index = 2
TauCeti.GroupTheory.SpecificGroups.Dihedral.Basic · lines 436–439
How it differs: It gives the index two of the rotation subgroup, which counts non-rotations abstractly rather than describing reflection axes.
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. 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 ffdf8a5e0e5c · pair key 30a2dd35c929.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · General properties › Symmetry ✕ Not formalized
If n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides. 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 50bc09ba1961). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · General properties › Symmetry ✕ Not formalized
If n is odd then all axes pass through a vertex and the midpoint of the opposite side. 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 9daabe80914a). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons ✕ Not formalized
All regular simple polygons (a simple polygon is one that does not intersect itself anywhere) are convex. 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 3 candidates examined (receipt f37ce940d4d2). 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)
Polygon.IsSimple. isJordanCurve_boundary related
theorem Polygon.IsSimple.isJordanCurve_boundary {V : Type*} {P : Type*} {n : ℕ} [AddCommGroup V] [_root_.Module ℝ V] [AddTorsor V P] [NeZero n] {poly : Polygon P n} [TopologicalSpace V] [ContinuousSMul ℝ V] [TopologicalSpace P] [IsTopologicalAddTorsor P] [T2Space P] : Polygon.IsSimple ℝ poly → TauCeti.IsJordanCurve (Polygon.boundary ℝ poly)
TauCeti.Geometry.Polygon.Simple · lines 412–420
How it differs: It concludes that a simple polygon's boundary is a Jordan curve, which is not convexity and uses no regularity.
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 74faa74dcdd8 · pair key ad06c02d0d02.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons ◔ Partial
Partial: Mathlib states a special case (proved).
Those having the same number of sides are also similar. Show all
similar_of_dist_mul_eq_dist_mul_eq special case
theorem similar_of_dist_mul_eq_dist_mul_eq {P₁ : Type*} {P₂ : Type*} [PseudoMetricSpace P₁] [PseudoMetricSpace P₂] {a b c : P₁} {a' b' c' : P₂} : Dist.dist a b ≠ 0 → Dist.dist a' b' ≠ 0 → Dist.dist a b * Dist.dist b' c' = Dist.dist b c * Dist.dist a' b' → Dist.dist a b * Dist.dist c' a' = Dist.dist c a * Dist.dist a' b' → Similar ![a, b, c] ![a', b', c']
Mathlib.Topology.MetricSpace.Similarity · lines 313–324
Why a special case: The lemma reaches only the three-sided case of the passage, since it is stated for triples of points rather than for n-gons.
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 e6defdf3362a · pair key 0f99b7ff86cf.
Related, but states something else (1)
similar_iff_exists_dist_eq related
theorem similar_iff_exists_dist_eq {ι : Type*} {P₁ : Type*} {P₂ : Type*} {v₁ : ι → P₁} {v₂ : ι → P₂} [PseudoMetricSpace P₁] [PseudoMetricSpace P₂] : Similar v₁ v₂ ↔ ∃ r, r ≠ 0 ∧ ∀ (i₁ i₂ : ι), Dist.dist (v₁ i₁) (v₁ i₂) = ↑r * Dist.dist (v₂ i₁) (v₂ i₂)
Mathlib.Topology.MetricSpace.Similarity · lines 226–231
How it differs: It unfolds similarity of two point families into a common ratio of distances and mentions no polygon.
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 022234b35449 · pair key 4e22f61ebf0c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Regular convex polygons ◔ Partial
Partial: Formal Conjectures states a special case (a definition).
An n-sided convex regular polygon is denoted by its Schläfli symbol {n } . Show all
Erdos94. regularNGon special case
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
Why a special case: The library object fixes the centre and the circumradius and is carried by the vertex finset, so it is one placed copy of the convex regular n-gon rather than the general one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key fe35cd1653a6 · pair key 823c3f799c9b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons ✕ Not formalized
As a corollary of the annulus chord formula, the area bounded by the circumcircle and incircle of every unit convex regular polygon is π/4 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 a609fcad71ec). 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 (1)
TauCeti.Green.Examples. green_annulus_region_area related
theorem TauCeti.Green.Examples.green_annulus_region_area {r R : ℝ} : … → have D := Metric.ball 0 R \ Metric.closedBall 0 r; IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (circleMap 0 R)) MeasureTheory.MeasureSpace.volume 0 (2 * π) ∧ IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (TauCeti.Green.Examples.clockwiseCircle r)) MeasureTheory.MeasureSpace.volume 0 (2 * π) ∧ …
Full type, as Lean prints it ∀ {r R : ℝ}, 0 < r → r < R → have D := Metric.ball 0 R \ Metric.closedBall 0 r; IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (circleMap 0 R)) MeasureTheory.MeasureSpace.volume 0 (2 * Real.pi) ∧ IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (TauCeti.Green.Examples.clockwiseCircle r)) MeasureTheory.MeasureSpace.volume 0 (2 * Real.pi) ∧ MeasureTheory.IntegrableOn (fun x ↦ 1) D MeasureTheory.MeasureSpace.volume ∧ ∫ (x : ℂ) in D, 1 = Real.pi * (R ^ 2 - r ^ 2) ∧ MeasureTheory.MeasureSpace.volume D = ENNReal.ofReal (Real.pi * (R ^ 2 - r ^ 2)) ∧ (∫ (t : ℝ) in 0..2 * Real.pi, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (circleMap 0 R) t) + ∫ (t : ℝ) in 0..2 * Real.pi, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (TauCeti.Green.Examples.clockwiseCircle r) t = Real.pi * (R ^ 2 - r ^ 2)
TauCeti.Analysis.Green.Examples.CurveArea.Green · lines 180–220
How it differs: It computes the measure of the region between two concentric circles as pi times the difference of the squared radii, with no polygon in sight.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 6da22bf26ded · pair key 2c31b6fd8d57.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Angles ◔ Partial
Partial: Mathlib states part of this (proved).
For a regular convex n-gon, each interior angle has a measure of: (n − 2)180 n degrees; (n − 2)π n radians; or (n − 2) 2n = 1 2 − 1 n full turns, and each exterior angle (i.e., supplementary to the interior angle) has a measure of 360 n degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn. Show all
Affine.Simplex.Equilateral. angle_eq_pi_div_three states part
theorem Affine.Simplex.Equilateral.angle_eq_pi_div_three {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} {s : Affine.Simplex ℝ P n} : s.Equilateral → ∀ {i₁ i₂ i₃ : Fin (n + 1)}, i₁ ≠ i₂ → i₁ ≠ i₃ → i₂ ≠ i₃ → EuclideanGeometry.angle (s.points i₁) (s.points i₂) (s.points i₃) = π / 3
Mathlib.Geometry.Euclidean.Simplex · lines 37–51
Why only part: The lemma also covers equilateral simplices of higher dimension, where the angle is a face angle; at a planar triangle it fixes the three-sided value of the angle formula, and it gives nothing about the exterior angles of c2 and c3.
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 bbdeadd0d121 · pair key 8255a7c198ca.
Related, but states something else (1)
EuclideanGeometry. exterior_angle_eq_angle_add_angle related
theorem EuclideanGeometry.exterior_angle_eq_angle_add_angle {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {p₁ p₂ p₃ : P} (p : P) : Sbtw ℝ p p₁ p₂ → EuclideanGeometry.angle p₃ p₁ p = EuclideanGeometry.angle p₁ p₃ p₂ + EuclideanGeometry.angle p₃ p₂ p₁
Mathlib.Geometry.Euclidean.Triangle · lines 325–328
How it differs: It states the Euclidean exterior angle theorem for a triangle; reaching the value 360 over n for a regular polygon needs the interior-angle value as a second ingredient.
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 8e91583e3738 · pair key e2b28b53f4d8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Angles ✕ Not formalized
As n approaches infinity, the internal angle approaches 180 degrees. 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 918ddbf5444a). 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 ↗
Example · supporting · Regular convex polygons › Angles ✕ Not formalized
For a regular polygon with 10,000 sides (a myriagon) the internal angle is 179.964°. 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 174b8ec7147e). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Angles ✕ Not formalized
As the number of sides increases, the internal angle can come very close to 180°, and the shape of the polygon approaches that of a circle. 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 1 candidates examined (receipt d707810c5971). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Angles ✕ Not formalized
However the polygon can never become a circle. 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 7891b81513d4). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Angles ✕ Not formalized
The value of the internal angle can never become exactly equal to 180° , as the circumference would effectively become a straight line (see apeirogon). 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 4e28c3f1bf7b). 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 (1)
TauCeti.UpperHalfPlane.CompactConvexPolygon. interiorAngle_lt_pi related
theorem TauCeti.UpperHalfPlane.CompactConvexPolygon.interiorAngle_lt_pi {n : ℕ} [NeZero n] (P : TauCeti.UpperHalfPlane.CompactConvexPolygon n) (i : Fin n) : P.interiorAngle i < π
TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Basic · lines 200–201
How it differs: Its polygons are hyperbolic ones in the upper half plane, a setting that neither contains nor sits inside the Euclidean plane of this passage.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, 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 503af02360d8 · pair key 1190c7c63e5f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Angles ✕ Not formalized
For this reason, a circle is not a polygon with an infinite number of sides. 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 a4a9bc4fd9ec). 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 · Regular convex polygons › Diagonals ✕ Not formalized
For n > 2 , the number of diagonals is 1 2 n (n − 3) ; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... . 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 eaa41084f344). 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 · supporting · Regular convex polygons › Diagonals ✕ Not formalized
The diagonals divide the polygon into 1, 4, 11, 24, ... 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 4 queries and 2 candidates examined (receipt fa96a481c484). 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 · Regular convex polygons › Diagonals ✕ Not formalized
For a regular n-gon inscribed in a circle of radius 1 , the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals n. 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 8d1411dd9d3d). 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)
IsPrimitiveRoot. prod_one_sub_pow_eq_order related
theorem IsPrimitiveRoot.prod_one_sub_pow_eq_order {R : Type*} [CommRing R] [IsDomain R] {n : ℕ} {μ : R} : IsPrimitiveRoot μ (n + 1) → ∏ k ∈ Finset.range n, (1 - μ ^ (k + 1)) = ↑n + 1
Mathlib.RingTheory.RootsOfUnity.Lemmas · lines 33–40
How it differs: The lemma is stated over any commutative domain, so it also covers rings the passage never speaks of; over the complex numbers it gives the signed product of the vertex differences, whose modulus is the product of distances the passage reports.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, 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 3dfb8e2. Location key 15997150abe1 · pair key 9d85863187dd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Points in the plane ✕ Not formalized
For a regular simple n-gon with circumradius R and distances di from an arbitrary point in the plane to the vertices, we have[2] 1 n ∑n i = 1 d 4 i + 3R 4 = (1 n ∑n i = 1 d 2 i + R 2 )2 . 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 1 candidates examined (receipt 27ba6ff30618). 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 · Regular convex polygons › Points in the plane ✕ Not formalized
For higher powers of distances d i from an arbitrary point in the plane to the vertices of a regular n-gon, if S (2m ) n = 1 n ∑n i = 1 d 2m i , then[3] S (2m ) n = (S (2) n )m + ∑⌊m /2⌋ k = 1 (m 2k )(2k k )R 2k (S (2) n − R 2 )k (S (2) n )m − 2k , and S (2m ) n = (S (2) n )m + ∑⌊m /2⌋ k = 1 1 2k (m 2k )(2k k )(S (4) n − (S (2) n )2 )k (S (2) n )m − 2k , where m is a positive integer less than n. 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 1097e3eaf4b9). 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 · Regular convex polygons › Points in the plane ✕ Not formalized
If L is the distance from an arbitrary point in the plane to the centroid of a regular n-gon with circumradius R, then[3] ∑n i = 1 d 2m i = n ((R 2 + L 2 )m + ∑⌊m /2⌋ k = 1 (m 2k )(2k k )R 2k L 2k (R 2 + L 2 )m − 2k ) , where m = 1, 2, …, n − 1 . 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 1136fb7c06b3). 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 · Regular convex polygons › Points in the plane › Interior points ◔ Partial
Partial: ATLAS (atlas-lean) states a special case (proved).
For a regular n-gon, the sum of the perpendicular distances from any interior point to the n sides is n times the apothem[4]: p. 72 (the apothem being the distance from the center to any side). Show all
MetaMathlibExt. viviani_general special case
theorem MetaMathlibExt.viviani_general (A B C P : EuclideanSpace ℝ (Fin 2)) : Dist.dist A B = Dist.dist B C → Dist.dist B C = Dist.dist C A → P ∈ interior ((convexHull ℝ) {A, B, C}) → Metric.infDist P ↑line[ℝ, A, B] + Metric.infDist P ↑line[ℝ, B, C] + Metric.infDist P ↑line[ℝ, C, A] = Metric.infDist A ↑line[ℝ, B, C]
MathlibExt.Geometry.Euclidean.Viviani · line 192
Why a special case: The declaration fixes the Euclidean plane and an equilateral triangle, so it is the passage read at n equal to three, and it writes the right-hand side as the altitude rather than as three apothems.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key f51069f55459 · pair key 56657ef539a0.
MetaMathlibExt. viviani special case
theorem MetaMathlibExt.viviani (A B C P : EuclideanSpace ℝ (Fin 2)) : Dist.dist A B = Dist.dist B C → Dist.dist B C = Dist.dist C A → 0 < Dist.dist A B → P ∈ interior ((convexHull ℝ) {A, B, C}) → Metric.infDist P ↑line[ℝ, A, B] + Metric.infDist P ↑line[ℝ, B, C] + Metric.infDist P ↑line[ℝ, C, A] = Metric.infDist A ↑line[ℝ, B, C]
MathlibExt.Geometry.Euclidean.Viviani · line 258
Why a special case: A wrapper of the preceding theorem that keeps an unused positivity hypothesis on the side length, which rules out only the degenerate triangle of side zero.
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 64c2773. Location key 74abd607504b · pair key 734676ebb512.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Circumradius ✕ Not formalized
The circumradius R from the center of a regular polygon to one of the vertices is related to the side length s or to the apothem a by R = s 2sin(π n ) = a cos(π n ) , a = s 2tan(π n ) 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 23f2eac483af). 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 · Regular convex polygons › Circumradius ✕ Not formalized
The sum of the perpendiculars from a regular n-gon's vertices to any line tangent to the circumcircle equals n times the circumradius. 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 15b8d27a5bc1). 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 · Regular convex polygons › Circumradius ✕ Not formalized
The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR2 where R is the circumradius. 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 3 candidates examined (receipt 85432eb18b9a). 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)
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: A definition of the vertex set of a regular n-gon inscribed in the unit circle, with no distance identity attached.
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 e754a78. Location key 8702f23624e5 · pair key fe2019c79f78.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Circumradius ✕ Not formalized
The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR2 − 1/4ns2, where s is the side length and R is the circumradius. 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 392c0c2faccc). 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)
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: It fixes the vertices of a regular n-gon on the unit circle, and nothing about the midpoints of its sides.
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 e754a78. Location key 3dcf11d6c794 · pair key 16e32ab53bfb.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Circumradius ✕ Not formalized
If d i are the distances from the vertices of a regular n -gon to any point on its circumcircle, then[3] 3(∑n i = 1 d 2 i )2 = 2n ∑n i = 1 d 4 i . 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 fdb1fcdba3ad). 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)
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: The regular n-gon on the unit circle is defined here, but no relation between second and fourth power sums of distances appears.
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 e754a78. Location key a571ffd617d5 · pair key 026e116c1e41.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Dissections ✕ Not formalized
Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel and of equal length) can be dissected into (m 2 ) or 1/2m(m − 1) parallelograms. 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 3 candidates examined (receipt 7abfc81b8bd6). 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 · supporting · Regular convex polygons › Dissections ✕ Not formalized
These tilings are contained as subsets of vertices, edges and faces in orthogonal projections m-cubes. 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 88fd8e80b32f). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Dissections ✕ Not formalized
In particular, this is true for any regular polygon with an even number of sides, in which case the parallelograms are all rhombi. 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 38ad24bc8c85). 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 · supporting · Regular convex polygons › Dissections ✕ Not formalized
Regular polygons with 4m+2 sides can be dissected in a way with (2m+1)-fold radial symmetry. 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 192685baafb6). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Area ✕ Not formalized
The area A of a convex regular n-sided polygon having side s, circumradius R, apothem a, and perimeter p is given by[8][9] A = 1 2 nsa = 1 2 pa = 1 4 ns 2 cot(π n ) = na 2 tan(π n ) = 1 2 nR 2 sin(2π n ) 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 db0028060ee5). 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 (2)
OeisA64313. area related
def OeisA64313.area : ℕ → ℝ
FormalConjectures.OEIS.«64313» · lines 35–36
How it differs: A function of type natural to real documented as the area of a regular n-gon of unit side; being a definition it asserts no equality with the passage's trigonometric expressions.
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 e754a78. Location key c63bc7c56126 · pair key d6d3ae320467.
TauCeti.Green.Examples. curveIntegral_area_polygon related
theorem TauCeti.Green.Examples.curveIntegral_area_polygon {N : ℕ} (v : Fin (N + 1) → ℂ) : (Finsupp.linearCombination ℤ fun η ↦ curveIntegral (TauCeti.Green.oneForm TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ) η.snd.snd) (TauCeti.Green.BoundaryChain.polygon v) = (∑ i, ((v i.castSucc).re * (v i.succ).im - (v i.succ).re * (v i.castSucc).im)) / 2
TauCeti.Analysis.Green.Examples.Shoelace · lines 44–51
How it differs: The shoelace sum for the signed-area circulation around any polygonal chain, in terms of vertex coordinates rather than side, apothem or circumradius.
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 83245ab. Location key 01b2cb96ea60 · pair key bc34f8f2df1e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Area ✕ Not formalized
For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:[b] (Since cot x → 1/x as x → 0 , the area when s = 1 tends to n 2 /4π as n grows large.) 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 3 candidates examined (receipt 8ac53ece2a18). 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)
Real. tendsto_tan_div_nhdsNE_zero related
theorem Real.tendsto_tan_div_nhdsNE_zero : Filter.Tendsto (fun x ↦ Real.tan x / x) (𝓝[≠] 0) (𝓝 1)
Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv · lines 73–75
How it differs: It states the reciprocal comparison, tangent against the identity, at the punctured origin.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e49eb4daf987 · pair key 4127688aef9d.
Real. isEquivalent_sin related
theorem Real.isEquivalent_sin : Asymptotics.IsEquivalent (𝓝 0) Real.sin id
Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv · line 334
How it differs: It compares the sine with the identity map near the origin.
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 4f62156b518f · pair key af2d7ad4a7cd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular convex polygons › Area ✕ Not formalized
For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:[b] (Since cot x → 1/x as x → 0 , the area when s = 1 tends to n 2 /4π as n grows large.) 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 6b702f092638). 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 (2)
OeisA64313. area related
def OeisA64313.area : ℕ → ℝ
FormalConjectures.OEIS.«64313» · lines 35–36
How it differs: It is the exact area of the unit-sided regular polygon with the given number of sides.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key d1fb86a50cb5 · pair key cb5750464156.
OeisA64313. conjecture related
theorem OeisA64313.conjecture (n : ℕ) : 3 ≤ n → OeisA64313.a n = ⌊↑n ^ 2 / (4 * π) - π / 12⌋.toNat
FormalConjectures.OEIS.«64313» · lines 110–112
How it differs: It equates the rounded-down area with a floor expression involving the squared side count over four pi.
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 e754a78. Location key dbbc63ed0998 · pair key e39a19430edf.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular convex polygons › Area ✕ Not formalized
Of all n-gons with a given perimeter, the one with the largest area is regular. 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 9cb85d6f6f60). 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. isoperimetric_inequality related
theorem MetaMathlibExt.isoperimetric_inequality {g : ℝ → EuclideanSpace ℝ (Fin 2)} {U : Set (EuclideanSpace ℝ (Fin 2))} {L A : ℝ} : Continuous g → Function.Periodic g 1 → (∃ K, LipschitzWith K g) → (MeasureTheory.Measure.hausdorffMeasure 1) (Set.range g) ≠ ⊤ → Set.InjOn g (Set.Ico 0 1) → L = ((MeasureTheory.Measure.hausdorffMeasure 1) (Set.range g)).toReal → A = (MeasureTheory.MeasureSpace.volume U).toReal → IsOpen U → IsConnected U → Bornology.IsBounded U → … → 4 * π * A ≤ L ^ 2 ∧ (4 * π * A = L ^ 2 ↔ ∃ c r, 0 < r ∧ Set.range g = Metric.sphere c r)
Full type, as Lean prints it ∀ {g : ℝ → EuclideanSpace ℝ (Fin 2)} {U : Set (EuclideanSpace ℝ (Fin 2))} {L A : ℝ}, Continuous g → Function.Periodic g 1 → (∃ K, LipschitzWith K g) → (MeasureTheory.Measure.hausdorffMeasure 1) (Set.range g) ≠ ⊤ → Set.InjOn g (Set.Ico 0 1) → L = ((MeasureTheory.Measure.hausdorffMeasure 1) (Set.range g)).toReal → A = (MeasureTheory.MeasureSpace.volume U).toReal → IsOpen U → IsConnected U → Bornology.IsBounded U → frontier U = Set.range g → 4 * Real.pi * A ≤ L ^ 2 ∧ (4 * Real.pi * A = L ^ 2 ↔ ∃ c r, 0 < r ∧ Set.range g = Metric.sphere c r)
WantedExt.Analysis.Geometry.IsoperimetricInequalityWanted · line 23
How it differs: It bounds the enclosed area by the squared boundary length for rectifiable closed curves, with equality exactly for circles.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 122031cb2270 · pair key f2ea1d2fb463.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Constructible polygon ✕ Not formalized
Some regular polygons are easy to construct with compass and straightedge; other regular polygons are not constructible at all. 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 2fc6ba136c02). 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 (2)
MetaMathlibExt. angle_trisection_impossible related
theorem MetaMathlibExt.angle_trisection_impossible (IsConstructible IsConstructibleAngle : ℝ → Prop) : … → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (π / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (π / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)
Full type, as Lean prints it ∀ (IsConstructible IsConstructibleAngle : ℝ → Prop), (∀ (x : ℝ), IsConstructible x ↔ ∃ n K, K 0 = ⊥ ∧ x ∈ K (Fin.last n) ∧ ∀ (i : Fin n), K i.castSucc ≤ K i.succ ∧ ∃ b ∈ K i.succ, b ^ 2 ∈ K i.castSucc ∧ ∀ y ∈ K i.succ, ∃ u v, u ∈ K i.castSucc ∧ v ∈ K i.castSucc ∧ y = u + b * v) → (∀ (θ : ℝ), IsConstructibleAngle θ ↔ IsConstructible (Real.cos θ)) → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (Real.pi / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (Real.pi / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)
MathlibExt.Geometry.Euclidean.AngleTrisectionImpossible · line 425
How it differs: The declaration is aimed at trisecting an angle, and the cosine it rules out belongs to the eighteen-sided regular polygon; the number pi over nine equals two pi over eighteen by arithmetic alone.
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, 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 386bfbb23922 · pair key 00166a781b2f.
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. gauss_wantzel_constructible_polygon related
theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)
WantedExt.NumberTheory.GaussWantzelWanted · line 82
How it differs: It characterises which side counts give a constructible regular polygon by an arithmetic condition.
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. 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 8f47b23ac1b8 · pair key fcd8e0bdb404.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Constructible polygon ◐ Statement only
Statement only: ATLAS (atlas-lean) states a more general result (wanted: stated as a goal, with no proof).
Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796. Show all
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. gauss_wantzel_constructible_polygon more general
theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)
WantedExt.NumberTheory.GaussWantzelWanted · line 82
Why more general: The attribution to Gauss and the year are historical and no declaration carries them; the declaration phrases polygon constructibility through constructibility of the cosine of the central angle.
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 30da4cd948e7 · pair key 1f631fa76404.
Related, but states something else (1)
Nat. fermatNumber_two related
theorem Nat.fermatNumber_two : Nat.fermatNumber 2 = 17
Mathlib.NumberTheory.Fermat · line 39
How it differs: It records that the Fermat number of index two is seventeen.
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 042aad7c4cd5 · pair key c593ac853473.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Constructible polygon ◐ Statement only
Statement only: ATLAS (atlas-lean) states a more general result (wanted: stated as a goal, with no proof).
This theory allowed him to formulate a sufficient condition for the constructibility of regular polygons: A regular n-gon can be constructed with compass and straightedge if n is the product of a power of 2 and any number of distinct Fermat primes (including none). Show all
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. gauss_wantzel_constructible_polygon more general
theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)
WantedExt.NumberTheory.GaussWantzelWanted · line 82
Why more general: It gives both directions where the passage claims one, and phrases polygon constructibility through constructibility of the cosine of the central angle; the counts one and two it leaves aside are the degenerate monogon and digon, for which the claim is empty.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key b66d826a5f96 · pair key c8bd2edb434a.
Related, but states something else (1)
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. GaussWantzelNumber related
def MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber : ℕ → Prop
WantedExt.NumberTheory.GaussWantzelWanted · line 73
How it differs: It names the arithmetic condition on a side count that the theorem uses.
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 64c2773. Location key 5e2fe6c48493 · pair key 5cc409291db7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Constructible polygon ✓ Formalized
Formalized: ATLAS (atlas-lean) states this exactly (a Prop-valued definition: it states the claim without proving it).
A Fermat prime is a prime number of the form 2(2n ) + 1 . Show all
MetaMathlibExt. IsFermatPrime exact match
def MetaMathlibExt.IsFermatPrime : ℕ → Prop
MathlibExt.NumberTheory.FermatPrime · line 28
Note: It is written through Mathlib's Fermat-number function, itself defined by that very formula, and it names the same notion the passage introduces.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 52c71fe082b1 · pair key 3063977005f9.
Related, but states something else (1)
Nat. fermatNumber related
def Nat.fermatNumber : ℕ → ℕ
Mathlib.NumberTheory.Fermat · line 35
How it differs: It defines the numbers of the shape the passage names, without any primality requirement.
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 dc08e618b064 · pair key 67cbba365028.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Constructible polygon ✕ Not formalized
Equivalently, a regular n-gon is constructible if and only if the cosine of its common angle is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots. 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 3 candidates examined (receipt bb614c37c0ff). 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 (3)
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. IsConstructible related
inductive MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible : ℝ → Prop
WantedExt.NumberTheory.GaussWantzelWanted · line 61
How it differs: It defines the constructible reals as the smallest subfield of the reals closed under square roots.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 4f54e37399ac · pair key ccbb475f6509.
MetaMathlibExt. angle_trisection_impossible related
theorem MetaMathlibExt.angle_trisection_impossible (IsConstructible IsConstructibleAngle : ℝ → Prop) : … → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (π / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (π / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)
Full type, as Lean prints it ∀ (IsConstructible IsConstructibleAngle : ℝ → Prop), (∀ (x : ℝ), IsConstructible x ↔ ∃ n K, K 0 = ⊥ ∧ x ∈ K (Fin.last n) ∧ ∀ (i : Fin n), K i.castSucc ≤ K i.succ ∧ ∃ b ∈ K i.succ, b ^ 2 ∈ K i.castSucc ∧ ∀ y ∈ K i.succ, ∃ u v, u ∈ K i.castSucc ∧ v ∈ K i.castSucc ∧ y = u + b * v) → (∀ (θ : ℝ), IsConstructibleAngle θ ↔ IsConstructible (Real.cos θ)) → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (Real.pi / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (Real.pi / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)
MathlibExt.Geometry.Euclidean.AngleTrisectionImpossible · line 425
How it differs: It takes the criterion that an angle is constructible exactly when its cosine is, as a hypothesis of its own.
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 64c2773. Location key 0850d91b411a · pair key fa6681d65a53.
MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel. gauss_wantzel_constructible_polygon related
theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)
WantedExt.NumberTheory.GaussWantzelWanted · line 82
How it differs: It already speaks of the cosine of the central angle when it characterises constructible side counts.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 76f9b7f55623 · pair key 2f305649087f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Regular skew polygons ✕ Not formalized
The cube contains a skew regular hexagon, seen as 6 red edges zig-zagging between two planes perpendicular to the cube's diagonal axis. 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 ed1eeab0aab5). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Regular skew polygons ✕ Not formalized
The zig-zagging side edges of a n-antiprism represent a regular skew 2n-gon, as shown in this 17-gonal antiprism. 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 0d586a08277b). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Regular skew polygons ✕ Not formalized
A regular skew polygon in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform antiprism. 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 3856d77d4df8). 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)
Polygon related
structure Polygon : Type u_1 → ℕ → Type u_1
Mathlib.Geometry.Polygon.Basic · lines 29–31
How it differs: Mathlib's polygon is a closed circuit of n vertices in any affine space; it carries neither regularity nor the two parallel planes the passage's definition rests 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, 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 5c20d64c0df0 · pair key 3d7e44e1a01d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular skew polygons ✕ Not formalized
All edges and internal angles are equal. 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 f12f6c395b87). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Regular skew polygons ✕ Not formalized
More generally regular skew polygons can be defined in n-space. 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 dedd26f94fb9). 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 (1)
Polygon related
structure Polygon : Type u_1 → ℕ → Type u_1
Mathlib.Geometry.Polygon.Basic · lines 29–31
How it differs: The structure already lives in an affine space of any dimension, so the ambient generality the passage asks for is present, but no regular skew polygon is defined over it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. 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 a9a27171c27c · pair key 7417e89d4d04.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Regular skew polygons ✕ Not formalized
Examples include the Petrie polygons, polygonal paths of edges that divide a regular polytope into two halves, and seen as a regular polygon in orthogonal projection. 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 5f6aba1e57be). 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 (1)
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope. IsRegular related
def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular {n : ℕ} : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope n → Prop
WantedExt.Geometry.PlatonicClassificationWanted · line 118
How it differs: It defines regularity of a convex polytope by flag-transitivity of its symmetry group; the polytope is there, but no edge path through it and no projection are.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 78c23cba3eb0 · pair key 23c8a445350a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Regular skew polygons ✕ Not formalized
In the infinite limit regular skew polygons become skew apeirogons. 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 1d8370e38e96). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Regular star polygons ✕ Not formalized
A non-convex regular polygon is a regular star polygon. 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 e22511cd7d4b). 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)
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: It is the regular n-gon on the unit circle, a convex figure given as a finite vertex set, with no notion of failing convexity and no star polygon.
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 e754a78. Location key b8723928f994 · pair key 9b15fa17034f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Regular star polygons ✕ Not formalized
The most common example is the pentagram, which has the same vertices as a pentagon, but connects alternating vertices. 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 162db3b51eb4). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Regular star polygons ✕ Not formalized
For an n-sided star polygon, the Schläfli symbol is modified to indicate the density or "starriness" m of the polygon, as {n/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 3 queries and 1 candidates examined (receipt bb44c31f990c). 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 ↗
Example · supporting · Regular star polygons ✕ Not formalized
If m is 2, for example, then every second point is joined. 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 de33dc19e597). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Regular star polygons ✕ Not formalized
If m is 3, then every third point is joined. 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 73aa5f881c60). 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 · supporting · Regular star polygons ✕ Not formalized
The boundary of the polygon winds around the center m times. 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 82210ba46f84). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Regular star polygons ✕ Not formalized
Dodecagram – {12/5} m and n must be coprime, or the figure will degenerate. 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 fd40d82bf3b1). 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 ↗
Notation · supporting · Regular star polygons ✕ Not formalized
For example, {6/2} may be treated in either of two ways: For much of the 20th century (see for example Coxeter (1948)), we have commonly taken the /2 to indicate joining each vertex of a convex {6} to its near neighbors two steps away, to obtain the regular compound of two triangles, or hexagram. 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 3ab1503352ab). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Regular star polygons ✕ Not formalized
Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k} , so the hexagram is represented as {6}[2{3}]{6}. 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 b5ad27cfd0bf). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Regular star polygons ✕ Not formalized
Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}, so the hexagram is represented as {6}[2{3}]{6}.[14] 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 eb64e78c83d2). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Regular star polygons ✕ Not formalized
More compactly Coxeter also writes 2{n/2}, like 2{3} for a hexagram as compound as alternations of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation. 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 ee5a8bfcd6fc). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Regular star polygons ✕ Not formalized
They take the /2 to indicate moving two places around the {6} at each step, obtaining a "double-wound" triangle that has two vertices superimposed at each corner point and two edges along each line segment. 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 c24877323f1d). 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 · Duality of regular polygons ✕ Not formalized
All regular polygons are self-dual to congruency , and for odd n they are self-dual to identity. 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 153994c1abe5). 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 · supporting · Duality of regular polygons ✕ Not formalized
All regular polygons are self-dual to congruency, and for odd n they are self-dual to identity. 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 891fb8f21d2e). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Duality of regular polygons ✕ Not formalized
In addition, the regular star figures (compounds), being composed of regular polygons, are also self-dual. 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 12fb58350035). 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Regular polygons as faces of polyhedra ✕ Not formalized
A uniform polyhedron has regular polygons as faces, such that for every two vertices there is an isometry mapping one into the other (just as there is for a regular polygon). 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 147e67a7934a). 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 · Regular polygons as faces of polyhedra ✕ Not formalized
A quasiregular polyhedron is a uniform polyhedron which has just two kinds of face alternating around each vertex. 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 e477a1ea8b98). 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 · Regular polygons as faces of polyhedra ◔ Partial
Partial: ATLAS (atlas-lean) states a special case (a Prop-valued definition: it states the claim without proving it).
A regular polyhedron is a uniform polyhedron which has just one kind of face. Show all
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope. IsRegular special case
def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular {n : ℕ} : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope n → Prop
WantedExt.Geometry.PlatonicClassificationWanted · line 118
Why a special case: Convexity is assumed here, so the non-convex uniform polyhedra that the passage's wording admits are left out, and the criterion is flag-transitivity of the symmetry group rather than one kind of face.
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 08048f53074a · pair key 091ec9a49e3c.
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification. regularPolytopes special case
def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.regularPolytopes (d : ℕ) : Set (MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope d)
WantedExt.Geometry.PlatonicClassificationWanted · line 133
Why a special case: This packages the same predicate as a set, and like it assumes convexity, so star uniform solids are excluded from what it collects.
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 64c2773. Location key 066995e68b5e · pair key 6ba47757a660.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Regular polygons as faces of polyhedra ✕ Not formalized
The remaining (non-uniform) convex polyhedra with regular faces are known as the Johnson solids. 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 ba28b370f4c7). 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 · Regular polygons as faces of polyhedra ✕ Not formalized
A polyhedron having regular triangles as faces is called a deltahedron. 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 558ac37842db). 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 ↗