WikiLean · Articles Articles Brain Contribute About

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

Regular polygon

75 passages1 formalized3 statement only7 partial64 not formalized

More ways to filter
Library
TauCeti related only
About this page

This page

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

Central statements: 35 of the 75 passages state the article's subject or a named result or definition; the other 40 are supporting (examples, setup). Of these 35: 1 formalized, 3 statement only, 5 partial, 26 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (12 locations and 26 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 1 of 2 locations and 9 of 38 absences. In all, 13 of 14 Lean locations (93%) and 35 of 64 absences (55%) were re-checked.
  • Passage text: 75 of 75 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1379891336 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

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

Passages

What “exact match”, “more general” and the other labels mean
  1. 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 in article · Read it in context on Wikipedia

    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.
  2. Theorem · supporting

    Not formalized
    Regular polygons may be either convex or star.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  3. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  4. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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).
  5. 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 in article · Read it in context on Wikipedia

    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.
  6. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0719458f93a6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  7. 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 in article · Read it in context on Wikipedia

    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.
  8. 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 = 2a3bp1⋯pr for some r ∈ ℕ, where each distinct pi is a Pierpont prime.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt c3c0cabdac46).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  9. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
  10. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  11. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  12. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  13. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
  14. Theorem · supporting · Regular convex polygons

    Partial

    Partial: Mathlib states a special case (proved).

    Those having the same number of sides are also similar.

    Show in article · Read it in context on Wikipedia

    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.
  15. 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 in article · Read it in context on Wikipedia

    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.
  16. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  17. 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)180n degrees; (n − 2)πn radians; or (n − 2)2n = 12 − 1n full turns, and each exterior angle (i.e., supplementary to the interior angle) has a measure of 360n degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn.

    Show in article · Read it in context on Wikipedia

    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.
  18. Theorem · supporting · Regular convex polygons › Angles

    Not formalized
    As n approaches infinity, the internal angle approaches 180 degrees.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 918ddbf5444a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  19. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 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).
  20. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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).
  21. Theorem · supporting · Regular convex polygons › Angles

    Not formalized
    However the polygon can never become a circle.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  22. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  23. Theorem · supporting · Regular convex polygons › Angles

    Not formalized
    For this reason, a circle is not a polygon with an infinite number of sides.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt a4a9bc4fd9ec).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  24. Theorem · main statement · Regular convex polygons › Diagonals

    Not formalized
    For n > 2, the number of diagonals is 12n(n − 3); i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... .

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt eaa41084f344).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  25. Theorem · supporting · Regular convex polygons › Diagonals

    Not formalized
    The diagonals divide the polygon into 1, 4, 11, 24, ... pieces.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 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.
  26. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 8d1411dd9d3d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  27. 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] 1n∑ni = 1 d4i + 3R4 = (1n∑ni = 1 d2i + R2)2.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
  28. Theorem · main statement · Regular convex polygons › Points in the plane

    Not formalized
    For higher powers of distances di from an arbitrary point in the plane to the vertices of a regular n-gon, if S(2m)n = 1n∑ni = 1 d2mi, then[3] S(2m)n = (S(2)n)m + ∑⌊m/2⌋k = 1 (m2k)(2kk)R2k(S(2)n − R2)k(S(2)n)m − 2k, and S(2m)n = (S(2)n)m + ∑⌊m/2⌋k = 1 12k(m2k)(2kk)(S(4)n − (S(2)n)2)k(S(2)n)m − 2k, where m is a positive integer less than n.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 1097e3eaf4b9).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  29. 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] ∑ni = 1 d2mi = n((R2 + L2)m + ∑⌊m/2⌋k = 1 (m2k)(2kk)R2kL2k(R2 + L2)m − 2k), where m = 1, 2, …, n − 1.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 1136fb7c06b3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  30. 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 in article · Read it in context on Wikipedia

    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.
  31. 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 = s2sin(πn) = acos(πn) ,  a = s2tan(πn)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 23f2eac483af).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  32. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 15b8d27a5bc1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  33. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
  34. 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/4⁠ns2, where s is the side length and R is the circumradius.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 392c0c2faccc).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  35. Theorem · main statement · Regular convex polygons › Circumradius

    Not formalized
    If di are the distances from the vertices of a regular n -gon to any point on its circumcircle, then[3] 3(∑ni = 1 d2i)2 = 2n∑ni = 1 d4i.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt fdb1fcdba3ad).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  36. 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 (m2) or ⁠1/2⁠m(m − 1) parallelograms.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
  37. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  38. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 38ad24bc8c85).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  39. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  40. 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= 12nsa= 12pa= 14ns2cot(πn)= na2tan(πn)= 12nR2sin(2πn)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt db0028060ee5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  41. 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 n2/4π as n grows large.)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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).
  42. 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 n2/4π as n grows large.)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 6b702f092638).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  43. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 9cb85d6f6f60).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  44. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 2fc6ba136c02).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  45. 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 in article · Read it in context on Wikipedia

    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.
  46. 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 in article · Read it in context on Wikipedia

    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.
  47. 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 in article · Read it in context on Wikipedia

    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.
  48. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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.
  49. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 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).
  50. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  51. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 3856d77d4df8).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  52. Theorem · supporting · Regular skew polygons

    Not formalized
    All edges and internal angles are equal.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  53. Definition · supporting · Regular skew polygons

    Not formalized
    More generally regular skew polygons can be defined in n-space.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  54. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  55. Theorem · supporting · Regular skew polygons

    Not formalized
    In the infinite limit regular skew polygons become skew apeirogons.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  56. Definition · main statement · Regular star polygons

    Not formalized
    A non-convex regular polygon is a regular star polygon.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt e22511cd7d4b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  57. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  58. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt bb44c31f990c).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  59. Example · supporting · Regular star polygons

    Not formalized
    If m is 2, for example, then every second point is joined.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  60. Example · supporting · Regular star polygons

    Not formalized
    If m is 3, then every third point is joined.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 73aa5f881c60).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  61. Theorem · supporting · Regular star polygons

    Not formalized
    The boundary of the polygon winds around the center m times.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
  62. Theorem · main statement · Regular star polygons

    Not formalized
    Dodecagram – {12/5}
    m and n must be coprime, or the figure will degenerate.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt fd40d82bf3b1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  63. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  64. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  65. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  66. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  67. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt c24877323f1d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  68. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 153994c1abe5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  69. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  70. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
  71. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 147e67a7934a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  72. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt e477a1ea8b98).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  73. 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 in article · Read it in context on Wikipedia

    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.
  74. 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 in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt ba28b370f4c7).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  75. Definition · main statement · Regular polygons as faces of polyhedra

    Not formalized
    A polyhedron having regular triangles as faces is called a deltahedron.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 558ac37842db).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.

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