WikiLean Β· Articles Articles Brain Contribute About

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

Polygon

100 passages19 formalized2 statement only23 partial56 not formalized

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1377769198, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, Top importance
  • Annotated article on WikiLean.
  • 100 passages checked, 65 Lean locations (and 52 related declarations).

Central statements: 53 of the 100 passages state the article's subject or a named result or definition; the other 47 are supporting (examples, setup). Of these 53: 12 formalized, 2 statement only, 10 partial, 29 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 (39 locations and 30 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): 12 of 26 locations and 13 of 27 absences. In all, 51 of 65 Lean locations (78%) and 43 of 57 absences (75%) were re-checked.
  • Passage text: 100 of 100 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 1377769198 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

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    In geometry, a polygon (/ˈpΙ’lΙͺΙ‘Ι’n/) is a plane figure made up of line segments connected to form a closed polygonal chain.

    Show in article Β· Read it in context on Wikipedia

    Polygon more general

    structure Polygon : Type u_1 β†’ β„• β†’ Type u_1

    Mathlib.Geometry.Polygon.Basic Β· lines 29–31

    Why more general: Mathlib records the n corner points and lets the edge index wrap round, so the chain closes; the point type is left arbitrary instead of being the plane.

    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 558d1f18eeb7 Β· pair key c97f0fd12927.

    MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly special case

    def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly {n : β„•} : (Fin n β†’ β„€ Γ— β„€) β†’ Polygon (ℝ Γ— ℝ) n

    WantedExt.Geometry.PicksTheoremWanted Β· line 62

    Why a special case: Atlas builds the plane polygon only from corner points with integer coordinates.

    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 00a155272d63 Β· pair key e9b8b7489c17.
  2. Definition Β· main statement

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    The segments of a closed polygonal chain are called its edges or sides.

    Show in article Β· Read it in context on Wikipedia

    Polygon.edgeSet more general

    def Polygon.edgeSet (R : Type*) {V : Type*} {P : Type*} {n : β„•} [Ring R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] [PartialOrder R] : Polygon P n β†’ Fin n β†’ Set P

    Mathlib.Geometry.Polygon.Basic Β· lines 62–63

    Why more general: Mathlib gives each side as the affine segment between consecutive corner points, over any ring and affine space rather than only the plane.

    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 d56120843b47 Β· pair key acc8c34348b1.

    Polygon.edgePath more general

    def Polygon.edgePath (R : Type*) {V : Type*} {P : Type*} {n : β„•} [Ring R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] : Polygon P n β†’ Fin n β†’ R →ᡃ[R] P

    Mathlib.Geometry.Polygon.Basic Β· lines 57–58

    Why more general: Mathlib presents the same side as a parametrised affine map, again over any ring and affine space.

    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 b9957387f892 Β· pair key b50939304c18.
  3. Definition Β· main statement

    Partial

    Partial: TauCeti states a special case (proved).

    The points where two edges meet are the polygon's vertices or corners.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.schwarzChristoffelPolygon_bounded_edges_adjacent_and_eq_vertex_of_injOn special case

    theorem TauCeti.schwarzChristoffelPolygon_bounded_edges_adjacent_and_eq_vertex_of_injOn {n : β„•} (a e : Fin (n + 2) β†’ ℝ) (zβ‚€ : UpperHalfPlane) : StrictMono a β†’ (βˆ€ (k : Fin (n + 2)), -1 < βˆ‘ l with a l = a k, e l) β†’ … β†’ βˆ€ (i j : Fin (n + 1)), i < j β†’ βˆ€ z ∈ Polygon.edgeSet ℝ (TauCeti.schwarzChristoffelPolygon a e zβ‚€) i.castSucc.castSucc, z ∈ Polygon.edgeSet ℝ (TauCeti.schwarzChristoffelPolygon a e zβ‚€) j.castSucc.castSucc β†’ ↑j = ↑i + 1 ∧ z = TauCeti.schwarzChristoffelVertex a e zβ‚€ i.succ
    Full type, as Lean prints it
    βˆ€ {n : β„•} (a e : Fin (n + 2) β†’ ℝ) (zβ‚€ : UpperHalfPlane), StrictMono a β†’ (βˆ€ (k : Fin (n + 2)), -1 < βˆ‘ l with a l = a k, e l) β†’ Set.InjOn (TauCeti.schwarzChristoffelBoundary a e zβ‚€) (Set.Icc (a 0) (a (Fin.last (n + 1)))) β†’ βˆ€ (i j : Fin (n + 1)), i < j β†’ βˆ€ z ∈ Polygon.edgeSet ℝ (TauCeti.schwarzChristoffelPolygon a e zβ‚€) i.castSucc.castSucc, z ∈ Polygon.edgeSet ℝ (TauCeti.schwarzChristoffelPolygon a e zβ‚€) j.castSucc.castSucc β†’ ↑j = ↑i + 1 ∧ z = TauCeti.schwarzChristoffelVertex a e zβ‚€ i.succ

    TauCeti.Analysis.Complex.Conformal.SchwarzChristoffel.Polygon.EdgeIntersection.Converse Β· lines 38–76

    Why a special case: TauCeti proves it for the polygons produced by the Schwarz-Christoffel map whose boundary is injective, and also concludes that the two sides are consecutive.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 35c45c459c08 Β· pair key c320da4e5016.
  4. Definition Β· main statement

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    An n-gon is a polygon with n sides; for example, a triangle is a 3-gon.

    Show in article Β· Read it in context on Wikipedia

    Polygon more general

    structure Polygon : Type u_1 β†’ β„• β†’ Type u_1

    Mathlib.Geometry.Polygon.Basic Β· lines 29–31

    Why more general: Mathlib indexes the type by the number of corner points, which for a closed chain equals the number of sides, and allows any point type.

    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 78f05802a4e9 Β· pair key 1f2f5b5b3d7a.
  5. Example Β· supporting

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    An n-gon is a polygon with n sides; for example, a triangle is a 3-gon.

    Show in article Β· Read it in context on Wikipedia

    Affine.Triangle.toPolygon more general

    def Affine.Triangle.toPolygon {R : Type*} {V : Type*} {P : Type*} [Ring R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] : Affine.Triangle R P β†ͺ Polygon P 3

    Mathlib.Geometry.Polygon.Basic Β· lines 106–111

    Why more general: Mathlib gives the passage's identification as an injective map from triangles into the three-corner polygons, over any ring and affine space.

    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 6abfeb99f5a8 Β· pair key d0602fcbaf98.

    Affine.Triangle.toSimplePolygon_numVertices more general

    theorem Affine.Triangle.toSimplePolygon_numVertices {R : Type*} {V : Type*} {P : Type*} [Ring R] [PartialOrder R] [ZeroLEOneClass R] [Nontrivial R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] (t : Affine.Triangle R P) : t.toSimplePolygon.numVertices = 3

    TauCeti.Geometry.Polygon.Simple Β· lines 651–653

    Why more general: TauCeti counts the corners of the non-self-crossing polygon built from a triangle, over any ordered ring and affine space.

    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 83245ab.
    • Location key 2d27d971869e Β· pair key 3e01d3d9f22e.
  6. Definition Β· main statement

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (a Prop-valued definition: it states the claim without proving it).

    A simple polygon is one which does not intersect itself.

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple exact match

    def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple {n : β„•} : Polygon (ℝ Γ— ℝ) n β†’ Prop

    WantedExt.Geometry.PicksTheoremWanted Β· line 78

    Note: Atlas states the property for polygons in the coordinate plane, and its docstring names the simple, Jordan 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, 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 ed5f887a05cf Β· pair key 3866ca208d96.

    Polygon.IsSimple more general

    structure Polygon.IsSimple (R : Type*) {V : Type*} {P : Type*} {n : β„•} [Ring R] [PartialOrder R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] : Polygon P n β†’ Prop

    TauCeti.Geometry.Polygon.Simple Β· lines 102–108

    Why more general: TauCeti defines simplicity for polygons in any affine space over an ordered ring, and also rules out repeated consecutive corners.

    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 911adf697515 Β· pair key 8c6aa4e4a744.

    TauCeti.SimplePolygon more general

    structure TauCeti.SimplePolygon (R : Type*) {V : Type*} (P : Type*) [Ring R] [PartialOrder R] [ZeroLEOneClass R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P]

    TauCeti.Geometry.Polygon.Simple Β· lines 550–558

    Why more general: TauCeti bundles the polygon with its corner count and its simplicity, over any affine space above an ordered ring.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key d76b928edbcd Β· pair key df64e57fc0b0.
  7. Definition Β· supporting

    Formalized

    Formalized: TauCeti states a more general result (a definition).

    More precisely, the only allowed intersections among the line segments that make up the polygon are the shared endpoints of consecutive segments in the polygonal chain.

    Show in article Β· Read it in context on Wikipedia

    Polygon.IsSimple more general

    structure Polygon.IsSimple (R : Type*) {V : Type*} {P : Type*} {n : β„•} [Ring R] [PartialOrder R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] : Polygon P n β†’ Prop

    TauCeti.Geometry.Polygon.Simple Β· lines 102–108

    Why more general: TauCeti spells simplicity out as the condition on side meetings for polygons in any affine space over an ordered ring.

    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 ae2e96bf431f Β· pair key 344319fcf578.
  8. Definition Β· main statement

    Formalized

    Formalized: TauCeti states a more general result (a definition).

    A simple polygon is the boundary of a region of the plane that is called a solid polygon.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.filledHull more general

    def TauCeti.filledHull {E : Type*} [TopologicalSpace E] [Bornology E] : Set E β†’ Set E

    TauCeti.Topology.FilledHull Β· line 82

    Why more general: The library's operator is a set together with the bounded components of its complement, taken in any space carrying a topology and a boundedness notion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 0aa9e80e0d89 Β· pair key ab14f05cf64b.
  9. Definition Β· main statement

    Formalized

    Formalized: ATLAS (atlas-lean) states a more general result (a definition).

    The interior of a solid polygon is its body, also known as a polygonal region or polygonal area.

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside more general

    def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside : Set (ℝ Γ— ℝ) β†’ Set (ℝ Γ— ℝ)

    WantedExt.Geometry.PicksTheoremWanted Β· line 67

    Why more general: The library object is the bounded complementary region of an arbitrary planar curve, so its inputs reach far past the boundaries of simple polygons.

    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 8a7002f400a6 Β· pair key 002e0aeaa47f.
  10. Definition Β· supporting

    Not formalized
    A polygonal chain may cross over itself, creating star polygons and other self-intersecting polygons.

    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 0 candidates examined (receipt 8158e37cd5d2).
    • 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. Definition Β· supporting

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Some sources also consider closed polygonal chains in Euclidean space to be a type of polygon (a skew polygon), even when the chain does not lie in a single plane.

    Show in article Β· Read it in context on Wikipedia

    Polygon more general

    structure Polygon : Type u_1 β†’ β„• β†’ Type u_1

    Mathlib.Geometry.Polygon.Basic Β· lines 29–31

    Why more general: mathlib leaves the vertex type arbitrary, so the same structure covers chains in Euclidean space of every dimension and in other affine spaces too.

    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 8da2c34ba64e Β· pair key b133a45aba9d.
  12. Theorem Β· supporting

    Not formalized
    A polygon is a 2-dimensional example of the more general polytope in any number of dimensions.

    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 0 candidates examined (receipt c00ca5982a4c).
    • 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. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Formalized

    Formalized, by a community edit: ATLAS (atlas-lean) states this up to a convention difference (a Prop-valued definition: it states the claim without proving it).

    Polygons may be characterized by their convexity or type of non-convexity:
    Convex: any line drawn through the polygon (and not tangent to an edge or corner) meets its boundary exactly twice.

    Show in article Β· Read it in context on Wikipedia

    EuclideanGeometry.IsConvexPolygon close match

    def EuclideanGeometry.IsConvexPolygon {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] [Module.Oriented ℝ V (Fin 2)] [Fact (Module.finrank ℝ V = 2)] {n : β„•} : (Fin n β†’ P) β†’ Prop

    MathlibExt.Geometry.TwoD Β· line 148

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) β€” owned by Jack McCarthy on 10 Nov 2026.

    Why close, not exact: Defines the same notion, convex polygons, with a different criterion. Instead of every line through the polygon meeting its boundary exactly twice, it asks every ordered triple of vertices to turn the same way (a clockwise or counterclockwise listing), which also rules out straight 180-degree vertices. Any oriented real plane is just the usual encoding of the Euclidean plane, so this is no more general than the 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, 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 aeb675bf752c Β· pair key fbd1fa81c6ff.

    EuclideanGeometry.IsConvexPolygon close match

    def EuclideanGeometry.IsConvexPolygon {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] [Module.Oriented ℝ V (Fin 2)] [Fact (Module.finrank ℝ V = 2)] {n : β„•} : (Fin n β†’ P) β†’ Prop

    FormalConjecturesForMathlib.Geometry.Β«2dΒ» Β· lines 153–154

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) β€” owned by Jack McCarthy on 10 Nov 2026.

    Why close, not exact: Defines the same notion, convex polygons, with a different criterion. Instead of every line through the polygon meeting its boundary exactly twice, it asks every ordered triple of vertices to turn the same way (either listing direction), which also rules out straight 180-degree vertices. Any oriented real plane is just the usual encoding of the Euclidean plane, so this is no more general than the 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 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 02897f4bfae2 Β· pair key 87fb3b3e646b.
  14. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Partial

    Partial: TauCeti states a special case (proved).

    As a consequence, all its interior angles are less than 180Β°.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.UpperHalfPlane.CompactConvexPolygon.interiorAngle_lt_pi special case

    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

    Why a special case: The declaration's figures are the convex ones of the hyperbolic plane, one of the geometries in which this article says the convexity condition applies.

    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 2b7ad44aa4c8 Β· pair key c1db144899bf.

    TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle_lt_pi special case

    theorem TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle_lt_pi {n : β„•} [NeZero n] (P : TauCeti.UpperHalfPlane.ConvexPolygon n) (i : Fin n) : P.interiorAngle i < Ο€

    TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex Β· lines 336–348

    Why a special case: Its figures may have corners at infinity, which the article's plane figures do not, so it answers for a wider class of hyperbolic figures than the compact ones.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 1fb17b24ac91 Β· pair key 8b1cc23c9aab.
  15. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Not formalized
    Equivalently, any line segment with endpoints on the boundary passes through only interior points between its endpoints.

    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 0 candidates examined (receipt 84fb53332029).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  16. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Not formalized
    This condition is true for polygons in any geometry, not just Euclidean.

    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 0 candidates examined (receipt f4ef59ae13d9).
    • 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. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Not formalized
    Non-convex: a line may be found which meets its boundary more than twice.

    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 b093ed1834c5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  18. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Not formalized
    Equivalently, there exists a line segment between two boundary points that passes outside the 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 0 candidates examined (receipt a1f8831a8bf3).
    • 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).
  19. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (a Prop-valued definition: it states the claim without proving it).

    Simple: the boundary of the polygon does not cross itself.

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple exact match

    def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple {n : β„•} : Polygon (ℝ Γ— ℝ) n β†’ Prop

    WantedExt.Geometry.PicksTheoremWanted Β· line 78

    Note: Declared for polygons in the coordinate plane, the article's own setting, and glossed by the library as the polygons whose boundary is a Jordan curve, which is what this bullet asks of the boundary.

    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 29b90518c14f Β· pair key a60df01a0c6f.

    Polygon.IsSimple more general

    structure Polygon.IsSimple (R : Type*) {V : Type*} {P : Type*} {n : β„•} [Ring R] [PartialOrder R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] : Polygon P n β†’ Prop

    TauCeti.Geometry.Polygon.Simple Β· lines 102–108

    Why more general: Stated for a polygon in any torsor over an ordered ring, so it covers the article's plane and much besides (PD1); it spells out the boundary not crossing itself as: the sides are nondegenerate and two distinct sides meet only when consecutive, at their common corner.

    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 91feb8e690be Β· pair key b1234a837630.

    TauCeti.SimplePolygon more general

    structure TauCeti.SimplePolygon (R : Type*) {V : Type*} (P : Type*) [Ring R] [PartialOrder R] [ZeroLEOneClass R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P]

    TauCeti.Geometry.Polygon.Simple Β· lines 550–558

    Why more general: The type of polygons that are simple, bundling the polygon with the proof that it is simple (R7 packaging), and stated over any ordered ring and torsor rather than the article's single plane (PD1).

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 090ba98b7599 Β· pair key 35df4917b123.
  20. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Partial

    Partial: TauCeti states a special case (proved).

    All convex polygons are simple.

    Show in article Β· Read it in context on Wikipedia

    Affine.Triangle.toPolygon_isSimple special case

    theorem Affine.Triangle.toPolygon_isSimple {R : Type*} {V : Type*} {P : Type*} [Ring R] [PartialOrder R] [ZeroLEOneClass R] [Nontrivial R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] (t : Affine.Triangle R P) : Polygon.IsSimple R (Affine.Triangle.toPolygon t)

    TauCeti.Geometry.Polygon.Simple Β· lines 524–540

    Why a special case: The library proves simplicity only for the three-corner case; those triangles are convex polygons, so this is the article's claim restricted to them (R3, PD3), and the library states elsewhere that a triangle's corners form a convex 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, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key bb9276f0e843 Β· pair key 5301e4bf1840.
  21. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Not formalized
    Concave: Non-convex and simple.

    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 6fa14271373e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  22. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Not formalized
    There is at least one interior angle greater than 180Β°.

    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 a5651b07a21a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  23. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    Star-shaped: the whole interior is visible from at least one point, without crossing any edge.

    Show in article Β· Read it in context on Wikipedia

    StarConvex more general

    def StarConvex (π•œ : Type*) {E : Type*} [Semiring π•œ] [PartialOrder π•œ] [AddCommMonoid E] [SMul π•œ E] : E β†’ Set E β†’ Prop

    Mathlib.Analysis.Convex.Star Β· lines 69–71

    Why more general: Lean carries the viewpoint as an argument of the predicate where the article asks only that one such point exist, and it is stated for any module over an ordered semiring rather than the plane, so it is the more general object (PD1).

    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 2bd7f5ac9780 Β· pair key 1677c9359d5f.

    Convexity.IsStarConvexSet more general

    def Convexity.IsStarConvexSet (R : Type*) {X : Type*} [Semiring R] [PartialOrder R] [IsStrictOrderedRing R] [Convexity.ConvexSpace R X] : X β†’ Set X β†’ Prop

    Mathlib.Geometry.Convex.Star Β· lines 49–50

    Why more general: The same notion in the library's newer convex-space setting, again with the viewpoint as an argument where the article only asks for its existence, and over any convex space rather than the plane (PD1).

    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 6a5237ac296d Β· pair key f068381b1705.
  24. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Partial

    Partial: TauCeti states part of this (proved).

    The polygon must be simple, and may be convex or concave.

    Show in article Β· Read it in context on Wikipedia

    Affine.Triangle.toPolygon_isSimple states part

    theorem Affine.Triangle.toPolygon_isSimple {R : Type*} {V : Type*} {P : Type*} [Ring R] [PartialOrder R] [ZeroLEOneClass R] [Nontrivial R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] (t : Affine.Triangle R P) : Polygon.IsSimple R (Affine.Triangle.toPolygon t)

    TauCeti.Geometry.Polygon.Simple Β· lines 524–540

    Why only part: Triangles are seen in full from any interior point, so they are among the polygons the first conjunct speaks of, and the lemma gives that conjunct only for them (R3, PD3); the second conjunct, that both convex and concave examples occur, is nowhere stated in the universe.

    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 22bdb8be9958 Β· pair key 1f44a80f6a59.
  25. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Formalized

    Formalized: Mathlib states a more general result (proved).

    All convex polygons are star-shaped.

    Show in article Β· Read it in context on Wikipedia

    Convex.starConvex more general

    theorem Convex.starConvex {π•œ : Type*} {E : Type*} [Semiring π•œ] [PartialOrder π•œ] [AddCommMonoid E] [SMul π•œ E] {s : Set E} {x : E} : Convex π•œ s β†’ x ∈ s β†’ StarConvex π•œ x s

    Mathlib.Analysis.Convex.Basic Β· lines 58–59

    Why more general: Mathlib states this for an arbitrary convex subset of a module over an ordered semiring, so its reach goes well past the plane region of a 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, 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 d34b086ff829 Β· pair key a2fd6df8021c.

    Convexity.IsConvexSet.isStarConvexSet more general

    theorem Convexity.IsConvexSet.isStarConvexSet {R : Type*} {X : Type*} [Semiring R] [PartialOrder R] [IsStrictOrderedRing R] [Convexity.ConvexSpace R X] {x : X} {s : Set X} : Convexity.IsConvexSet R s β†’ x ∈ s β†’ Convexity.IsStarConvexSet R x s

    Mathlib.Geometry.Convex.Star Β· lines 92–93

    Why more general: Mathlib repeats the same fact inside its abstract convex-space framework, for any convex subset of such a space rather than for a plane 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 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 0336f603c275 Β· pair key 1a47e9350c22.
  26. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Not formalized
    Self-intersecting: the boundary of the polygon crosses itself.

    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 bd0ac37890b9).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  27. Definition Β· main statement Β· Classification β€Ί Convexity and intersection

    Not formalized
    Star polygon: a polygon which self-intersects in a regular way.

    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 4fc6ea51574f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  28. Theorem Β· supporting Β· Classification β€Ί Convexity and intersection

    Not formalized
    A polygon cannot be both a star and star-shaped.

    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 256cdd4c0c9f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  29. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    Equiangular: all corner 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 3 candidates examined (receipt b558b3e68db1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  30. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Partial

    Partial: Formal Conjectures states a special case (a Prop-valued definition: it states the claim without proving it).

    Equilateral: all edges are of the same length.

    Show in article Β· Read it in context on Wikipedia

    Erdos755.IsEquilateralTriangle special case

    def Erdos755.IsEquilateralTriangle {d : β„•} : ℝ β†’ Finset (EuclideanSpace ℝ (Fin d)) β†’ Prop

    FormalConjectures.ErdosProblems.Β«755Β» Β· lines 41–43

    Why a special case: The declaration fixes the property for three-point sets, where every pair of corners is a side of the figure, and carries the common length as a parameter.

    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 3d4fba024286 Β· pair key 37f3a448fe96.
  31. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    Regular: both equilateral and equiangular.

    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 08ac64393a3c).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  32. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Cyclic: all corners lie on a single circle, called the circumcircle.

    Show in article Β· Read it in context on Wikipedia

    EuclideanGeometry.Concyclic more general

    structure EuclideanGeometry.Concyclic {V : Type*} {P : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] : Set P β†’ Prop

    Mathlib.Geometry.Euclidean.Sphere.Basic Β· lines 237–239

    Why more general: Mathlib fixes the property for an arbitrary set of points of any Euclidean affine space, asking for a common sphere together with a common plane, where the passage speaks only of the corners of a plane 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, 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 bdc4ae106389 Β· pair key 9c000509fedf.

    EuclideanGeometry.Cospherical more general

    def EuclideanGeometry.Cospherical {P : Type*} [MetricSpace P] : Set P β†’ Prop

    Mathlib.Geometry.Euclidean.Sphere.Basic Β· lines 150–151

    Why more general: Mathlib asks only that the points be equidistant from some centre, in any metric space, so away from the plane it allows a sphere of higher dimension instead of a circle.

    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 fe3f3f4535df Β· pair key 7e5792de9234.
  33. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    Tangential: all sides are tangent to an inscribed 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 0 candidates examined (receipt ac49a4a4cca3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  34. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    Isogonal or vertex-transitive: all corners lie within the same symmetry orbit.

    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 0 candidates examined (receipt 0b4a71531c12).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  35. Theorem Β· supporting Β· Classification β€Ί Equality and symmetry

    Partial

    Partial: Mathlib states part of this (proved).

    The polygon is also cyclic and equiangular.

    Show in article Β· Read it in context on Wikipedia

    Affine.Simplex.mem_circumsphere states part

    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 only part: The declaration covers only three-cornered polygons with independent corners, and it needs no symmetry assumption at all, so it reaches the cyclic conjunct just for that family of the passage's polygons; it says nothing about the angles.

    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 2789c26eba4b Β· pair key 06f90853f2e7.
  36. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    Isotoxal or edge-transitive: all sides lie within the same symmetry orbit.

    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 0 candidates examined (receipt 03f327677a0e).
    • 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 Β· Classification β€Ί Equality and symmetry

    Partial

    Partial: Mathlib states part of this (proved).

    The polygon is also equilateral and tangential.

    Show in article Β· Read it in context on Wikipedia

    Affine.Simplex.isTangentAt_insphere_touchpoint states part

    theorem Affine.Simplex.isTangentAt_insphere_touchpoint {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : β„•} [NeZero n] (s : Affine.Simplex ℝ P n) (i : Fin (n + 1)) : s.insphere.IsTangentAt (s.touchpoint βˆ… i) (affineSpan ℝ (Set.range (s.faceOpposite i).points))

    Mathlib.Geometry.Euclidean.Incenter.Basic Β· lines 889–892

    Why only part: The declaration covers only three-cornered polygons, needs no symmetry assumption, and records tangency to the line spanned by the two other corners rather than to the side as a segment; it says nothing about the lengths of the 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, 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 c80c5a06e7ac Β· pair key 6b19cd9efb57.
  38. Theorem Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    The property of regularity may be defined in other ways: a polygon is regular if and only if it is both isogonal and isotoxal, or equivalently it is both cyclic and equilateral.

    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 6ace8c5c63af).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  39. Definition Β· main statement Β· Classification β€Ί Equality and symmetry

    Not formalized
    A non-convex regular polygon is called 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 0 candidates examined (receipt a3ff3d115028).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  40. Definition Β· main statement Β· Classification β€Ί Miscellaneous

    Not formalized
    Rectilinear: the polygon's sides meet at right angles, i.e. all its interior angles are 90 or 270 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 4 queries and 0 candidates examined (receipt 620686630fd4).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  41. Definition Β· main statement Β· Classification β€Ί Miscellaneous

    Not formalized
    Monotone with respect to a given line L: every line orthogonal to L intersects the polygon not more than twice.

    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 a27d8f91a109).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  42. Theorem Β· supporting Β· Properties and formulas β€Ί Angles

    Not formalized
    Any polygon has as many corners as it has 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 3 candidates examined (receipt 83a5da7de888).
    • 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).
  43. Theorem Β· main statement Β· Properties and formulas β€Ί Angles

    Partial

    Partial: Mathlib states a special case (proved).

    The two most important ones are:
    Interior angle – The sum of the interior angles of a simple n-gon is (n βˆ’ 2) Γ— Ο€ radians or (n βˆ’ 2) Γ— 180 degrees.

    Show in article Β· Read it in context on Wikipedia

    EuclideanGeometry.angle_add_angle_add_angle_eq_pi special case

    theorem EuclideanGeometry.angle_add_angle_add_angle_eq_pi {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {p₁ pβ‚‚ : P} (p₃ : P) : pβ‚‚ β‰  p₁ β†’ EuclideanGeometry.angle p₁ pβ‚‚ p₃ + EuclideanGeometry.angle pβ‚‚ p₃ p₁ + EuclideanGeometry.angle p₃ p₁ pβ‚‚ = Ο€

    Mathlib.Geometry.Euclidean.Triangle Β· lines 314–321

    Why a special case: mathlib also allows the three points to be collinear, a configuration the passage's simple 3-gon never produces, and it gives no formula for larger n.

    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 ca97836f5d47 Β· pair key 00e01d2b5beb.
  44. Theorem Β· supporting Β· Properties and formulas β€Ί Angles

    Partial

    Partial: Mathlib states part of this (proved).

    This is because any simple n-gon ( having n sides ) can be considered to be made up of (n βˆ’ 2) triangles, each of which has an angle sum of Ο€ radians or 180 degrees.

    Show in article Β· Read it in context on Wikipedia

    EuclideanGeometry.angle_add_angle_add_angle_eq_pi states part

    theorem EuclideanGeometry.angle_add_angle_add_angle_eq_pi {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {p₁ pβ‚‚ : P} (p₃ : P) : pβ‚‚ β‰  p₁ β†’ EuclideanGeometry.angle p₁ pβ‚‚ p₃ + EuclideanGeometry.angle pβ‚‚ p₃ p₁ + EuclideanGeometry.angle p₃ p₁ pβ‚‚ = Ο€

    Mathlib.Geometry.Euclidean.Triangle Β· lines 314–321

    Why only part: No declaration in the universe cuts a simple n-gon into n minus two triangles, so the decomposition the passage also asserts is nowhere stated.

    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 189b0f24f4fc Β· pair key 998987943991.
  45. Theorem Β· main statement Β· Properties and formulas β€Ί Angles

    Partial

    Partial: Mathlib states a special case (proved).

    The measure of any interior angle of a convex regular n-gon is (1 βˆ’ 2n)Ο€ radians or 180 βˆ’ 360n degrees.

    Show in article Β· Read it in context on Wikipedia

    Affine.Simplex.Equilateral.angle_eq_pi_div_three special case

    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 a special case: The declaration also covers equilateral simplices of higher dimension, which are not polygons, and it reaches the passage only where n is three, where the passage's value is pi over three.

    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 fe921a358ced Β· pair key a53ce5e77bc7.
  46. Theorem Β· main statement Β· Properties and formulas β€Ί Angles

    Partial

    Partial: Mathlib states a special case (proved).

    The interior angles of regular star polygons were first studied by Poinsot, in the same paper in which he describes the four regular star polyhedra: for a regular pq -gon (a p-gon with central density q), each interior angle is Ο€(p βˆ’ 2q)p radians or 180(p βˆ’ 2q)p degrees.

    Show in article Β· Read it in context on Wikipedia

    Affine.Simplex.Equilateral.angle_eq_pi_div_three special case

    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 a special case: Nothing in the universe builds a polygon of density q above one, so only the density-one instance with three sides is reached, where the passage's value pi times one over three agrees.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence.
    • 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 73c5b864967c Β· pair key 7a2a2e5f784b.
  47. Definition Β· main statement Β· Properties and formulas β€Ί Angles

    Not formalized
    Exterior angle – The exterior angle is the supplementary angle to the interior angle.

    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 13e6504d8876).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  48. Definition Β· supporting Β· Properties and formulas β€Ί Angles

    Not formalized
    Tracing around a convex n-gon, the angle "turned" at a corner is the exterior or external angle.

    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 f7c91219a94a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  49. Theorem Β· supporting Β· Properties and formulas β€Ί Angles

    Not formalized
    Tracing all the way around the polygon makes one full turn, so the sum of the exterior angles must be 360Β°.

    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 fd4f3d0462c5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  50. Theorem Β· main statement Β· Properties and formulas β€Ί Angles

    Partial

    Partial: Mathlib states a special case (proved).

    Tracing all the way around the polygon makes one full turn, so the sum of the exterior angles must be 360Β°.

    Show in article Β· Read it in context on Wikipedia

    EuclideanGeometry.angle_add_angle_add_angle_eq_pi special case

    theorem EuclideanGeometry.angle_add_angle_add_angle_eq_pi {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {p₁ pβ‚‚ : P} (p₃ : P) : pβ‚‚ β‰  p₁ β†’ EuclideanGeometry.angle p₁ pβ‚‚ p₃ + EuclideanGeometry.angle pβ‚‚ p₃ p₁ + EuclideanGeometry.angle p₃ p₁ pβ‚‚ = Ο€

    Mathlib.Geometry.Euclidean.Triangle Β· lines 314–321

    Why a special case: The declaration fixes the three-vertex case of the passage's convex n-gon; since each exterior angle is the supplement of an interior one, their sum there is three pi minus pi, which is a full turn, and that last step is plain arithmetic.

    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 1d21be6fd080 Β· pair key 19007aa9b6f1.
  51. Theorem Β· main statement Β· Properties and formulas β€Ί Angles

    Not formalized
    Tracing around an n-gon in general, the sum of the exterior angles (the total amount one rotates at the vertices) can be any integer multiple d of 360Β°, e.g. 720Β° for a pentagram and 0Β° for an angular "eight" or antiparallelogram, where d is the density or turning number of the 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 3 candidates examined (receipt 3691d60f29d2).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  52. Notation Β· supporting Β· Properties and formulas β€Ί Area

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    In this section, the vertices of the polygon under consideration are taken to be (x0, y0), (x1, y1), …, (xn βˆ’ 1, yn βˆ’ 1) in order.

    Show in article Β· Read it in context on Wikipedia

    Polygon more general

    structure Polygon : Type u_1 β†’ β„• β†’ Type u_1

    Mathlib.Geometry.Polygon.Basic Β· lines 29–31

    Why more general: Mathlib introduces the same notation over an arbitrary point type where the passage writes coordinate pairs in the plane, and the vertex family is indexed by the finite type of indices below n, so the order the passage fixes is the index order.

    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 838c3e484bff Β· pair key 43b479a997b6.
  53. Notation Β· supporting Β· Properties and formulas β€Ί Area

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a notation passage is formalized only by a Lean definition.

    For convenience in some formulas, the notation (xn, yn) = (x0, y0) will also be used.

    Show in article Β· Read it in context on Wikipedia

    Fin.natCast_self close match

    theorem Fin.natCast_self (n : β„•) [NeZero n] : ↑n = 0

    Mathlib.Data.Fin.Basic Β· line 391

    Why close, not exact: Lean carries the wrap in the index type rather than in the coordinate pairs: indices live in the cyclic type of size n, in which the numeral n is the index zero, so writing index n for index zero is automatic.

    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 46081c4b6383 Β· pair key 88f4f91cb9bd.
  54. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Formalized

    Formalized: TauCeti states a more general result (proved).

    If the polygon is non-self-intersecting (that is, simple), the signed area is A = 12βˆ‘n βˆ’ 1i = 0(xiyi + 1 βˆ’ xi + 1yi) where xn = x0 and yn = y0, or, using determinants 16A2 = βˆ‘n βˆ’ 1i = 0β€‰βˆ‘n βˆ’ 1j = 0 |Qi, jQi, j + 1Qi + 1, jQi + 1, j + 1|, where Qi, j is the squared distance between (xi, yi)…

    Show in article Β· Read it in context on Wikipedia

    TauCeti.Green.Examples.curveIntegral_area_polygon more general

    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

    Why more general: The library states the same sum for an arbitrary vertex sequence, with no requirement that the chain avoid crossing itself, and it writes the signed area as the circulation of the area one-form along the edges, which is how the library defines that quantity.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key ec050729f160 Β· pair key 2ba3068d5b26.

    TauCeti.Green.Examples.integral_circulationFun_area_shoelace more general

    theorem TauCeti.Green.Examples.integral_circulationFun_area_shoelace {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} {N : β„•} {s : Fin (N + 1) β†’ ℝ} : StrictMono s β†’ s 0 = a β†’ s (Fin.last N) = b β†’ (βˆ€ (i : Fin N), βˆ€ t ∈ Set.Icc (s i.castSucc) (s i.succ), Ξ³ t = Ξ³ (s i.castSucc) + ((t - s i.castSucc) / (s i.succ - s i.castSucc)) β€’ (Ξ³ (s i.succ) - Ξ³ (s i.castSucc))) β†’ ∫ (t : ℝ) in a..b, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ Ξ³ t = (βˆ‘ i, ((Ξ³ (s i.castSucc)).re * (Ξ³ (s i.succ)).im - (Ξ³ (s i.succ)).re * (Ξ³ (s i.castSucc)).im)) / 2

    TauCeti.Analysis.Green.Examples.Shoelace Β· lines 54–65

    Why more general: The library states it for any curve that is affine between consecutive subdivision points, so self-crossing chains and unclosed chains are covered too, and the signed area appears in its unfolded integral form.

    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 83245ab.
    • Location key a3e9e3d55ce0 Β· pair key 0fd2f112433c.

    TauCeti.Green.Examples.integral_windingWeight_shoelace more general

    theorem TauCeti.Green.Examples.integral_windingWeight_shoelace {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} {N : β„•} {s : Fin (N + 1) β†’ ℝ} : StrictMono s β†’ s 0 = a β†’ s (Fin.last N) = b β†’ … β†’ MeasureTheory.Integrable (TauCeti.Green.windingWeight Ξ³ a b) MeasureTheory.MeasureSpace.volume ∧ ∫ (z : β„‚), TauCeti.Green.windingWeight Ξ³ a b z = (βˆ‘ i, ((Ξ³ (s i.castSucc)).re * (Ξ³ (s i.succ)).im - (Ξ³ (s i.succ)).re * (Ξ³ (s i.castSucc)).im)) / 2
    Full type, as Lean prints it
    βˆ€ {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} {N : β„•} {s : Fin (N + 1) β†’ ℝ}, StrictMono s β†’ s 0 = a β†’ s (Fin.last N) = b β†’ (βˆ€ (i : Fin N), βˆ€ t ∈ Set.Icc (s i.castSucc) (s i.succ), Ξ³ t = Ξ³ (s i.castSucc) + ((t - s i.castSucc) / (s i.succ - s i.castSucc)) β€’ (Ξ³ (s i.succ) - Ξ³ (s i.castSucc))) β†’ Ξ³ a = Ξ³ b β†’ MeasureTheory.Integrable (TauCeti.Green.windingWeight Ξ³ a b) MeasureTheory.MeasureSpace.volume ∧ ∫ (z : β„‚), TauCeti.Green.windingWeight Ξ³ a b z = (βˆ‘ i, ((Ξ³ (s i.castSucc)).re * (Ξ³ (s i.succ)).im - (Ξ³ (s i.succ)).re * (Ξ³ (s i.castSucc)).im)) / 2

    TauCeti.Analysis.Green.Examples.Shoelace Β· lines 69–84

    Why more general: This version assumes the chain closes up but still allows crossings, and it also records integrability of the winding weight alongside the value of the integral.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key f0de47e40820 Β· pair key 7823f6cb4082.
  55. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    If the polygon is non-self-intersecting (that is, simple), the signed area is A = 12βˆ‘n βˆ’ 1i = 0(xiyi + 1 βˆ’ xi + 1yi) where xn = x0 and yn = y0, or, using determinants 16A2 = βˆ‘n βˆ’ 1i = 0β€‰βˆ‘n βˆ’ 1j = 0 |Qi, jQi, j + 1Qi + 1, jQi + 1, j + 1|, where Qi, j is the squared distance between (xi, yi) and (xj, yj).

    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 e317f2dc36aa).
    • 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. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Partial

    Partial: TauCeti states part of this (proved).

    The signed area depends on the ordering of the vertices and of the orientation of the plane.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.signedArea_symm states part

    theorem TauCeti.signedArea_symm (Ξ³ : ℝ β†’ β„‚) (a b : ℝ) : TauCeti.signedArea Ξ³ b a = -TauCeti.signedArea Ξ³ a b

    TauCeti.Analysis.Green.Examples.CurveArea.SignedArea Β· lines 58–59

    Why only part: The declaration covers the ordering half of the passage by giving the exact sign change under reversal, and it says nothing about what happens when the plane's orientation is reversed instead.

    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 9651c0cb351e Β· pair key 290625a25c72.
  57. Definition Β· supporting Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Formalized

    Formalized: Mathlib states this up to a convention difference (a definition).

    Commonly, the positive orientation is defined by the (counterclockwise) rotation that maps the positive x-axis to the positive y-axis.

    Show in article Β· Read it in context on Wikipedia

    Complex.orientation close match

    def Complex.orientation : Orientation ℝ β„‚ (Fin 2)

    Mathlib.LinearAlgebra.Complex.Orientation Β· lines 24–25

    Why close, not exact: Mathlib fixes the plane's standard orientation as the orientation class of the ordered basis (1, I) instead of naming the quarter turn that sends the first axis to the second; both pick out the same element of a two element set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, 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 4275f0c7ed9d Β· pair key 94118fc12d8b.
  58. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    If the vertices are ordered counterclockwise (that is, according to positive orientation), the signed area is positive; otherwise, it is negative.

    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 b77ac1284f0f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  59. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    In either case, the area formula is correct in absolute value.

    Show in article Β· Read it in context on Wikipedia

    MeasureTheory.toReal_volume_convexHull_triangle special case

    theorem MeasureTheory.toReal_volume_convexHull_triangle (a b c : EuclideanSpace ℝ (Fin 2)) : (MeasureTheory.MeasureSpace.volume ((convexHull ℝ) {a, b, c})).toReal = |(b - a).ofLp 0 * (c - a).ofLp 1 - (b - a).ofLp 1 * (c - a).ofLp 0| / 2

    MathlibExt.MeasureTheory.Measure.Lebesgue.TriangleArea Β· line 326

    Why a special case: The declaration quantifies over three arbitrary planar points, so it covers both vertex orders and also collinear triples, where both sides vanish.

    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 88e0ab7b25e9 Β· pair key 63c159758ce1.
  60. Notation Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Partial

    Partial: TauCeti states a more general result, but as a proved theorem, not a definition; a notation passage is formalized only by a Lean definition.

    This is commonly called the shoelace formula or surveyor's formula.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.Green.Examples.curveIntegral_area_polygon more general

    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

    Why more general: The declaration proves the identity for any finite vertex family, so it also covers chains that cross themselves, where the circulation is no longer the enclosed area.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 33b6f770ead8 Β· pair key 1e61229317bc.

    TauCeti.Green.Examples.integral_circulationFun_area_shoelace more general

    theorem TauCeti.Green.Examples.integral_circulationFun_area_shoelace {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} {N : β„•} {s : Fin (N + 1) β†’ ℝ} : StrictMono s β†’ s 0 = a β†’ s (Fin.last N) = b β†’ (βˆ€ (i : Fin N), βˆ€ t ∈ Set.Icc (s i.castSucc) (s i.succ), Ξ³ t = Ξ³ (s i.castSucc) + ((t - s i.castSucc) / (s i.succ - s i.castSucc)) β€’ (Ξ³ (s i.succ) - Ξ³ (s i.castSucc))) β†’ ∫ (t : ℝ) in a..b, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ Ξ³ t = (βˆ‘ i, ((Ξ³ (s i.castSucc)).re * (Ξ³ (s i.succ)).im - (Ξ³ (s i.succ)).re * (Ξ³ (s i.castSucc)).im)) / 2

    TauCeti.Analysis.Green.Examples.Shoelace Β· lines 54–65

    Why more general: It is stated for an arbitrary piecewise linear closed path, which includes paths whose edges meet outside their endpoints.

    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 83245ab.
    • Location key d8e78da8843a Β· pair key 58beba398144.
  61. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    The area A of a simple polygon can also be computed if the lengths of the sides, a1, a2, ..., an and the exterior angles, ΞΈ1, ΞΈ2, ..., ΞΈn are known, from: A = 12(a1[a2sin(ΞΈ1) + a3sin(ΞΈ1 + ΞΈ2) + β‹― + an βˆ’ 1sin(ΞΈ1 + ΞΈ2 + β‹― + ΞΈn βˆ’ 2)]+ a2[a3sin(ΞΈ2) + a4sin(ΞΈ2 + ΞΈ3) + β‹― + an βˆ’ 1sin(ΞΈ2 + β‹― + ΞΈn βˆ’ 2)]+ β‹― + an βˆ’ 2[an βˆ’ 1sin(ΞΈn βˆ’ 2)]). The formula was described by Lopshits in 1963.

    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 5b481d9bd6b7).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  62. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Statement only

    Statement only: ATLAS (atlas-lean) states this up to a convention difference (wanted: stated as a goal, with no proof).

    If the polygon can be drawn on an equally spaced grid such that all its vertices are grid points, Pick's theorem gives a simple formula for the polygon's area based on the numbers of interior and boundary grid points: the former number plus one-half the latter number, minus 1.

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.pick close match

    theorem MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.pick {n : β„•} : … β†’ βˆ€ (v : Fin n β†’ β„€ Γ— β„€), MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple (MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly v) β†’ MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.area (Polygon.boundary ℝ (MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly v)) = ↑(MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.interiorPts v) + …
    Full type, as Lean prints it
    βˆ€ {n : β„•}, 3 ≀ n β†’ βˆ€ (v : Fin n β†’ β„€ Γ— β„€), MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple (MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly v) β†’ MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.area (Polygon.boundary ℝ (MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly v)) = ↑(MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.interiorPts v) + ↑(MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.boundaryPts v) / 2 - 1

    WantedExt.Geometry.PicksTheoremWanted Β· line 96

    Why close, not exact: The declaration places the grid as the integer lattice, so that cells have unit area and the two counts are of lattice points inside the region and on its boundary.

    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 2263a2b6550a Β· pair key 83e681a40a7d.

    MetaMathlibExt.pick_convex_lattice_polygon special case

    theorem MetaMathlibExt.pick_convex_lattice_polygon (vertices : Finset (Fin 2 β†’ β„€)) : (interior ((convexHull ℝ) ((fun z i ↦ ↑(z i)) '' ↑vertices))).Nonempty β†’ (MeasureTheory.MeasureSpace.volume ((convexHull ℝ) ((fun z i ↦ ↑(z i)) '' ↑vertices))).toReal = ↑{z | (fun i ↦ ↑(z i)) ∈ interior ((convexHull ℝ) ((fun z i ↦ ↑(z i)) '' ↑vertices))}.ncard + ↑{z | (fun i ↦ ↑(z i)) ∈ frontier ((convexHull ℝ) ((fun z i ↦ ↑(z i)) '' ↑vertices))}.ncard / 2 - 1

    MathlibExt.Geometry.Convex.PickTheorem Β· line 2017

    Why a special case: Convexity is assumed, and polygons drawn on a grid need not be convex; the hypothesis of nonempty interior rules out the flat cases.

    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 b53a0f957f04 Β· pair key ab57db62e6fa.

    MeasureTheory.toReal_volume_convexHull_lattice_triangle special case

    theorem MeasureTheory.toReal_volume_convexHull_lattice_triangle (u v : Fin 2 β†’ β„€) : u 0 * v 1 - u 1 * v 0 β‰  0 β†’ (MeasureTheory.MeasureSpace.volume ((convexHull ℝ) {0, fun i ↦ ↑(u i), fun i ↦ ↑(v i)})).toReal = ↑{z | (fun i ↦ ↑(z i)) ∈ interior ((convexHull ℝ) {0, fun i ↦ ↑(u i), fun i ↦ ↑(v i)})}.ncard + ↑{z | (fun i ↦ ↑(z i)) ∈ frontier ((convexHull ℝ) {0, fun i ↦ ↑(u i), fun i ↦ ↑(v i)})}.ncard / 2 - 1

    MathlibExt.Geometry.Convex.PickTheorem Β· line 841

    Why a special case: It is stated for three lattice points, one of them the origin, whereas the passage allows any number of grid vertices.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 758b6c8df6a7 Β· pair key ab9182e61dd6.
  63. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Statement only

    With community edits: Statement only. As published it is Not formalized.

    Statement only, by a community edit: ATLAS (atlas-lean) states a more general result (wanted: stated as a goal, with no proof).

    In every polygon with perimeter p and area A , the isoperimetric inequality p2 > 4Ο€A holds.

    Show in article Β· Read it in context on Wikipedia

    MetaMathlibExt.isoperimetric_inequality more general

    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

    Community Agent The pipeline said related; changed by Meta FAIR 2 (agent) β€” owned by Jack McCarthy on 9 Nov 2026.

    Why more general: MetaMathlibExt.isoperimetric_inequality is a Wanted statement with no proof: for a simple closed Lipschitz plane curve that bounds a bounded connected open region, with length L (1-dimensional Hausdorff measure) and area A, 4Ο€A ≀ LΒ², with equality only for a circle. A simple polygon's boundary is such a curve and is not a circle, so the polygon's strict inequality pΒ² > 4Ο€A is an instance.

    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 11a3ac28aa9d Β· pair key 02e8c9669648.

    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 56e025175189).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  64. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    For any two simple polygons of equal area, the Bolyai–Gerwien theorem asserts that the first can be cut into polygonal pieces which can be reassembled to form the second 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 46f5575faf00).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  65. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    The lengths of the sides of a polygon do not in general determine its area.[9]

    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 7a1188a96285).
    • 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. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    However, if the polygon is simple and cyclic then the sides do determine the area.[10]

    Show in article Β· Read it in context on Wikipedia

    MetaMathlibExt.brahmagupta_area special case

    theorem MetaMathlibExt.brahmagupta_area (a b c d s A e : ℝ) (P Q R S : EuclideanSpace ℝ (Fin 2)) : Dist.dist P Q = a ∧ Dist.dist Q R = b ∧ Dist.dist R S = c ∧ Dist.dist S P = d β†’ Dist.dist P R = e β†’ s = (a + b + c + d) / 2 β†’ (βˆƒ O, Dist.dist O P = Dist.dist O Q ∧ Dist.dist O Q = Dist.dist O R ∧ Dist.dist O R = Dist.dist O S) β†’ (βˆƒ T, Dist.dist P T + Dist.dist T R = Dist.dist P R ∧ Dist.dist Q T + Dist.dist T S = Dist.dist Q S ∧ 0 < Dist.dist P T ∧ 0 < Dist.dist T R ∧ 0 < Dist.dist Q T ∧ 0 < Dist.dist T S) β†’ … β†’ A = √((s - a) * (s - b) * (s - c) * (s - d))
    Full type, as Lean prints it
    βˆ€ (a b c d s A e : ℝ) (P Q R S : EuclideanSpace ℝ (Fin 2)), Dist.dist P Q = a ∧ Dist.dist Q R = b ∧ Dist.dist R S = c ∧ Dist.dist S P = d β†’ Dist.dist P R = e β†’ s = (a + b + c + d) / 2 β†’ (βˆƒ O, Dist.dist O P = Dist.dist O Q ∧ Dist.dist O Q = Dist.dist O R ∧ Dist.dist O R = Dist.dist O S) β†’ (βˆƒ T, Dist.dist P T + Dist.dist T R = Dist.dist P R ∧ Dist.dist Q T + Dist.dist T S = Dist.dist Q S ∧ 0 < Dist.dist P T ∧ 0 < Dist.dist T R ∧ 0 < Dist.dist Q T ∧ 0 < Dist.dist T S) β†’ A = √((a + b + e) / 2 * ((a + b + e) / 2 - a) * ((a + b + e) / 2 - b) * ((a + b + e) / 2 - e)) + √((c + d + e) / 2 * ((c + d + e) / 2 - c) * ((c + d + e) / 2 - d) * ((c + d + e) / 2 - e)) β†’ A = √((s - a) * (s - b) * (s - c) * (s - d))

    MathlibExt.Geometry.Euclidean.BrahmaguptaArea Β· line 138

    Why a special case: The Lean statement is written for four plane points on a common circle whose two diagonals cross, which is what a simple cyclic quadrilateral is.

    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 66625d04e9a2 Β· pair key 15e56a568ff5.
  67. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    Of all n-gons with given side lengths, the one with the largest area is cyclic.

    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 3d226bae4000).
    • 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 Β· Properties and formulas β€Ί Area β€Ί Simple polygons

    Not formalized
    Of all n-gons with a given perimeter, the one with the largest area is regular (and therefore cyclic).

    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 5d5e9b87359e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  69. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Regular polygons

    Not formalized
    The area of a regular polygon is given in terms of the radius r of its inscribed circle and its perimeter p by A = 12 β‹… p β‹… r. This radius is also termed its apothem and is often represented as a.

    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 87bcbfac1d45).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  70. Notation Β· supporting Β· Properties and formulas β€Ί Area β€Ί Regular polygons

    Not formalized
    The area of a regular polygon is given in terms of the radius r of its inscribed circle and its perimeter p by A = 12 β‹… p β‹… r. This radius is also termed its apothem and is often represented as a.

    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 bd6ddea7d976).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  71. Theorem Β· main statement Β· Properties and formulas β€Ί Area β€Ί Regular polygons

    Not formalized
    The area of a regular n-gon can be expressed in terms of the radius R of its circumscribed circle (the unique circle passing through all vertices of the regular n-gon) as follows:[12][13] A = R2 β‹… n2 β‹… sin 2Ο€n = R2 β‹… n β‹… sin πn β‹… cos π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 3 queries and 3 candidates examined (receipt 3b080ecb509b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  72. Definition Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Partial

    Partial: TauCeti states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    The area of a self-intersecting polygon can be defined in two different ways, giving different answers:
    Using the formulas for simple polygons, we allow that particular regions within the polygon may have their area multiplied by a factor which we call the density of the region.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.Green.Examples.integral_windingWeight_shoelace more general

    theorem TauCeti.Green.Examples.integral_windingWeight_shoelace {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} {N : β„•} {s : Fin (N + 1) β†’ ℝ} : StrictMono s β†’ s 0 = a β†’ s (Fin.last N) = b β†’ … β†’ MeasureTheory.Integrable (TauCeti.Green.windingWeight Ξ³ a b) MeasureTheory.MeasureSpace.volume ∧ ∫ (z : β„‚), TauCeti.Green.windingWeight Ξ³ a b z = (βˆ‘ i, ((Ξ³ (s i.castSucc)).re * (Ξ³ (s i.succ)).im - (Ξ³ (s i.succ)).re * (Ξ³ (s i.castSucc)).im)) / 2
    Full type, as Lean prints it
    βˆ€ {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} {N : β„•} {s : Fin (N + 1) β†’ ℝ}, StrictMono s β†’ s 0 = a β†’ s (Fin.last N) = b β†’ (βˆ€ (i : Fin N), βˆ€ t ∈ Set.Icc (s i.castSucc) (s i.succ), Ξ³ t = Ξ³ (s i.castSucc) + ((t - s i.castSucc) / (s i.succ - s i.castSucc)) β€’ (Ξ³ (s i.succ) - Ξ³ (s i.castSucc))) β†’ Ξ³ a = Ξ³ b β†’ MeasureTheory.Integrable (TauCeti.Green.windingWeight Ξ³ a b) MeasureTheory.MeasureSpace.volume ∧ ∫ (z : β„‚), TauCeti.Green.windingWeight Ξ³ a b z = (βˆ‘ i, ((Ξ³ (s i.castSucc)).re * (Ξ³ (s i.succ)).im - (Ξ³ (s i.succ)).re * (Ξ³ (s i.castSucc)).im)) / 2

    TauCeti.Analysis.Green.Examples.Shoelace Β· lines 69–84

    Why more general: The Lean statement also covers closed polygons that never cross themselves, where the weight is one on the inside and the identity reduces to the ordinary vertex area formula; its docstring says no simplicity is assumed.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 155e69123639 Β· pair key 7f60a4421ca7.

    TauCeti.signedArea_eq_intCast_mul_volume_real_of_windingNumber_eq special case

    theorem TauCeti.signedArea_eq_intCast_mul_volume_real_of_windingNumber_eq {Ξ³ : ℝ β†’ β„‚} {a b : ℝ} : a < b β†’ AbsolutelyContinuousOnInterval Ξ³ a b β†’ Ξ³ a = Ξ³ b β†’ βˆ€ (n : β„€), (βˆ€ z ∈ TauCeti.filledHull (Ξ³ '' Set.uIcc a b) \ Ξ³ '' Set.uIcc a b, TauCeti.Contour.windingNumber Ξ³ a b z = ↑n) β†’ TauCeti.signedArea Ξ³ a b = ↑n * MeasureTheory.MeasureSpace.volume.real (TauCeti.filledHull (Ξ³ '' Set.uIcc a b) \ Ξ³ '' Set.uIcc a b)

    TauCeti.Analysis.Green.Examples.CurveArea.Winding Β· lines 56–71

    Why a special case: The declaration asks that the winding number be one constant across the filled hull off the curve, so it covers the polygons whose interior carries a single density.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key c59153bdf505 Β· pair key dbf05136c104.
  73. Example Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Not formalized
    For example, the central convex pentagon in the center of a pentagram has density 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 3 queries and 2 candidates examined (receipt 3319f1174d36).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  74. Example Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Partial

    Partial: TauCeti states part of this (proved).

    The two triangular regions of a cross-quadrilateral (like a figure 8) have opposite-signed densities, and adding their areas together can give a total area of zero for the whole figure.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.Green.Examples.windingNumber_bowTieCurve_upper states part

    theorem TauCeti.Green.Examples.windingNumber_bowTieCurve_upper : TauCeti.Contour.windingNumber TauCeti.Green.Examples.bowTieCurve 0 4 { re := 1 / 2, im := 3 / 4 } = 1

    TauCeti.Analysis.Green.Examples.BowTie Β· lines 168–180

    Why only part: The library figure is one explicit cross-quadrilateral: its two edges that meet at the crossing are the first and the third, so each lobe is bounded by two half-edges and one whole edge, that is, a triangle.

    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 b3afb226217f Β· pair key da316dbd867b.

    TauCeti.Green.Examples.windingNumber_bowTieCurve_lower states part

    theorem TauCeti.Green.Examples.windingNumber_bowTieCurve_lower : TauCeti.Contour.windingNumber TauCeti.Green.Examples.bowTieCurve 0 4 { re := 1 / 2, im := 1 / 4 } = -1

    TauCeti.Analysis.Green.Examples.BowTie Β· lines 183–195

    Why only part: Taken with the companion result for the upper lobe this exhibits the opposition of sign, but neither declaration asserts the opposition on 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, 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 50fc29df823f Β· pair key 4499dc06feaa.
  75. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Partial

    Partial: TauCeti states a special case (proved).

    The two triangular regions of a cross-quadrilateral (like a figure 8) have opposite-signed densities, and adding their areas together can give a total area of zero for the whole figure.

    Show in article Β· Read it in context on Wikipedia

    TauCeti.Green.Examples.integral_windingWeight_bowTieCurve special case

    theorem TauCeti.Green.Examples.integral_windingWeight_bowTieCurve : ∫ (z : β„‚), TauCeti.Green.windingWeight TauCeti.Green.Examples.bowTieCurve 0 4 z = 0

    TauCeti.Analysis.Green.Examples.BowTie Β· lines 222–227

    Why a special case: The weight function is the index of the curve, set to zero on the trace, so its integral over the plane is exactly the density-weighted total area of the 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.
    • 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 c1f05471c975 Β· pair key a3d5b333b9e4.
  76. Definition Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Not formalized
    Considering the enclosed regions as point sets, we can find the area of the enclosed point set.

    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 1cdc618f2d1d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  77. Theorem Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Not formalized
    This corresponds to the area of the plane covered by the polygon or to the area of one or more simple polygons having the same outline as the self-intersecting one.

    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 adf3fc16fc1b).
    • 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).
  78. Example Β· supporting Β· Properties and formulas β€Ί Area β€Ί Self-intersecting

    Not formalized
    In the case of the cross-quadrilateral, it is treated as two simple triangles.[citation needed]

    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 d34ecca5e959).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  79. Theorem Β· main statement Β· Properties and formulas β€Ί Centroid

    Not formalized
    Using the same convention for vertex coordinates as in the previous section, the coordinates of the centroid of a solid simple polygon are Cx= 16Aβˆ‘n βˆ’ 1i = 0(xi + xi + 1)(xiyi + 1 βˆ’ xi + 1yi)Cy= 16Aβˆ‘n βˆ’ 1i = 0(yi + yi + 1)(xiyi + 1 βˆ’ xi + 1yi). In these formulas, the signed value of area A must be used.

    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 c8c0e2e87468).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  80. Notation Β· supporting Β· Properties and formulas β€Ί Centroid

    Not formalized
    …Cx= 16Aβˆ‘n βˆ’ 1i = 0(xi + xi + 1)(xiyi + 1 βˆ’ xi + 1yi)Cy= 16Aβˆ‘n βˆ’ 1i = 0(yi + yi + 1)(xiyi + 1 βˆ’ xi + 1yi). In these formulas, the signed value of area A must be used.

    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 46e2e11f51d2).
    • 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).
  81. Theorem Β· supporting Β· Properties and formulas β€Ί Centroid

    Not formalized
    For triangles (n = 3), the centroids of the vertices and of the solid shape are the same, but, in general, this is not true for n > 3.

    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 1bccdcb4b7f3).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  82. Theorem Β· main statement Β· Properties and formulas β€Ί Centroid

    Formalized

    Formalized: TauCeti states a more general result (proved).

    The centroid of the vertex set of a polygon with n vertices has the coordinates cx= 1nβˆ‘n βˆ’ 1i = 0 xicy= 1nβˆ‘n βˆ’ 1i = 0 yi

    Show in article Β· Read it in context on Wikipedia

    TauCeti.finiteMean_eq_inv_smul_sum more general

    theorem TauCeti.finiteMean_eq_inv_smul_sum {R : Type*} {E : Type*} {ΞΉ : Type*} [Field R] [AddCommGroup E] [_root_.Module R E] [Fintype ΞΉ] (z : ΞΉ β†’ E) : TauCeti.finiteMean R z = (↑(Fintype.card ΞΉ))⁻¹ β€’ βˆ‘ i, z i

    TauCeti.Analysis.Convex.FiniteMean Β· lines 56–58

    Why more general: Stated for an arbitrary finite family of vectors in a module over any field, which is more general than the planar vertex family of the 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.
    • 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 01aed9144d7f Β· pair key 7709cc5b35d2.

    Finset.centroid more general

    def Finset.centroid (k : Type*) {V : Type*} {P : Type*} [DivisionRing k] [AddCommGroup V] [_root_.Module k V] [AddTorsor V P] {ΞΉ : Type*} : Finset ΞΉ β†’ (ΞΉ β†’ P) β†’ P

    Mathlib.LinearAlgebra.AffineSpace.Centroid Β· lines 79–80

    Why more general: Mathlib defines this centroid over any affine space above a division ring, so the planar vertex set of the passage is one instance of it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, 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 d93c639b49c6 Β· pair key e9899ce4d8ed.
  83. Definition Β· main statement Β· Generalizations

    Not formalized
    Some of the more important include:
    A spherical polygon is a circuit of arcs of great circles (sides) and vertices on the surface of a sphere.

    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 8b0798185016).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  84. Theorem Β· supporting Β· Generalizations

    Partial

    Partial: Mathlib states part of this (proved).

    It allows the digon, a polygon having only two sides and two corners, which is impossible in a flat plane.

    Show in article Β· Read it in context on Wikipedia

    Polygon.HasNondegenerateVertices.three_le states part

    theorem Polygon.HasNondegenerateVertices.three_le {R : Type*} {V : Type*} {P : Type*} {n : β„•} [Ring R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] [NeZero n] [Nontrivial R] {poly : Polygon P n} : Polygon.HasNondegenerateVertices R poly β†’ 3 ≀ n

    Mathlib.Geometry.Polygon.Basic Β· lines 89–94

    Why only part: It carries only the half of the passage about the flat plane; nothing in the universe produces the two-sided polygon on a sphere.

    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 4de61770a1a7 Β· pair key 7b3a2f03a950.

    Polygon.IsSimple.three_le states part

    theorem Polygon.IsSimple.three_le {R : Type*} {V : Type*} {P : Type*} {n : β„•} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] [DenselyOrdered R] [AddCommGroup V] [_root_.Module R V] [Module.IsTorsionFree R V] [AddTorsor V P] {poly : Polygon P n} [NeZero n] : Polygon.IsSimple R poly β†’ 3 ≀ n

    TauCeti.Geometry.Polygon.Simple Β· lines 146–166

    Why only part: Like the mathlib lemma it speaks only of flat spaces, so the spherical half of the passage stays unstated.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 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 83245ab.
    • Location key 5580560ae3f5 Β· pair key 1fd30a5b22e7.
  85. Definition Β· main statement Β· Generalizations

    Not formalized
    A skew polygon does not lie in a flat plane, but zigzags in three (or more) dimensions.

    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 9db9f816f2e6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  86. Example Β· supporting Β· Generalizations

    Not formalized
    The Petrie polygons of the regular polytopes are well known examples.

    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 14fe4c5db22f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  87. Definition Β· main statement Β· Generalizations

    Not formalized
    An apeirogon is an infinite sequence of sides and angles, which is not closed but has no ends because it extends indefinitely in both directions.

    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 3357a1868df6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  88. Definition Β· main statement Β· Generalizations

    Not formalized
    A skew apeirogon is an infinite sequence of sides and angles that do not lie in a flat plane.

    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 c28ce4b406ad).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  89. Definition Β· main statement Β· Generalizations

    Not formalized
    A polygon with holes is an area-connected or multiply-connected planar polygon with one external boundary and one or more interior boundaries (holes).

    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 0cb509599913).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  90. Definition Β· main statement Β· Generalizations

    Not formalized
    A complex polygon is a configuration analogous to an ordinary polygon, which exists in the complex plane of two real and two imaginary dimensions.

    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 502dc5a2ce36).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  91. Definition Β· main statement Β· Generalizations

    Not formalized
    An abstract polygon is an algebraic partially ordered set representing the various elements (sides, vertices, etc.) and their connectivity.

    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 cb6e6aab374e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  92. Definition Β· supporting Β· Generalizations

    Not formalized
    A real geometric polygon is said to be a realization of the associated abstract 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 1 candidates examined (receipt ac9cb71a503e).
    • 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).
  93. Definition Β· main statement Β· Generalizations

    Partial

    Partial: ATLAS (atlas-lean) states a special case (a Prop-valued definition: it states the claim without proving it).

    A polyhedron is a three-dimensional solid bounded by flat polygonal faces, analogous to a polygon in two dimensions.

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron special case

    def MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron {k : β„•} : Set (Fin k β†’ ℝ) β†’ Prop

    WantedExt.Topology.FamiliesOfMapsB01Wanted Β· line 111

    Why a special case: The declaration admits only convex bodies, the hulls of finitely many points, and it is written for an arbitrary ambient dimension; degenerate hulls of dimension below three are covered too.

    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 7c7dde4ff21b Β· pair key 0b3febcd0659.
  94. Definition Β· main statement Β· Generalizations

    Partial

    Partial: ATLAS (atlas-lean) states a special case (a definition).

    The corresponding shapes in four or higher dimensions are called polytopes.[15]

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope special case

    structure MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope : β„• β†’ Type

    WantedExt.Geometry.PlatonicClassificationWanted Β· line 73

    Why a special case: The declaration names only the convex such shapes, built as hulls of finitely many points, and it is also written for the lower dimensions the passage sets aside.

    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 4790be831d70 Β· pair key 3d1e708a5a3c.

    MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron special case

    def MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron {k : β„•} : Set (Fin k β†’ ℝ) β†’ Prop

    WantedExt.Topology.FamiliesOfMapsB01Wanted Β· line 111

    Why a special case: It uses the word polyhedron for every dimension and admits only convex hulls of finite point sets, so it reaches the passage's shapes only in their convex part.

    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 64c2773.
    • Location key 58c20f6ccb3b Β· pair key 903dc22245cd.
  95. Theorem Β· supporting Β· Computer graphics

    Not formalized
    If a square mesh has n + 1 points (vertices) per side, there are n squared squares in the mesh, or 2n squared triangles since there are two triangles in a square.

    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 fd5a87f277eb).
    • 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).
  96. Theorem Β· supporting Β· Computer graphics

    Not formalized
    If a square mesh has n + 1 points (vertices) per side, there are n squared squares in the mesh, or 2n squared triangles since there are two triangles in a square.

    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 2f193d95dbf2).
    • 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).
  97. Theorem Β· supporting Β· Computer graphics

    Not formalized
    There are (n + 1)2 / 2(n2) vertices per triangle.

    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 0988a4adafa7).
    • 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).
  98. Theorem Β· supporting Β· Computer graphics

    Not formalized
    Where n is large, this approaches one half.

    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 f3952e92cb05).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  99. Theorem Β· supporting Β· Computer graphics

    Not formalized
    Or, each vertex inside the square mesh connects four edges (lines).

    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 844becfd6fe8).
    • 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).
  100. Notation Β· supporting Β· Computer graphics

    Formalized

    Formalized: ATLAS (atlas-lean) states a more general result (a definition).

    In computer graphics and computational geometry, it is often necessary to determine whether a given point P = (x0, y0) lies inside a simple polygon given by a sequence of line segments. This is called the point in polygon test.

    Show in article Β· Read it in context on Wikipedia

    MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside more general

    def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside : Set (ℝ Γ— ℝ) β†’ Set (ℝ Γ— ℝ)

    WantedExt.Geometry.PicksTheoremWanted Β· line 67

    Why more general: It is given for any set of plane points rather than only for a closed chain of segments, and it returns the points off that set whose complement component is bounded.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 02e9c53a8e7a Β· pair key 0f2d83cf3a0c.

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