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 all
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.
Related, but states something else (1)
TauCeti.Green.BoundaryChain. polygon related
def TauCeti.Green.BoundaryChain.polygon {N : ℕ} : (Fin (N + 1) → ℂ) → TauCeti.Green.BoundaryChain
TauCeti.Analysis.Green.Polygonal.Basic · lines 133–134
How it differs: TauCeti forms the chain of successive segments through complex points, with no requirement that the last point return to the first.
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 809c0a832a71 · pair key 794d0774b407.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Polygon. apply_mem_edgeSet_self related
theorem Polygon.apply_mem_edgeSet_self (R : Type*) {V : Type*} {P : Type*} {n : ℕ} [Ring R] [PartialOrder R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] [ZeroLEOneClass R] (poly : Polygon P n) (i : Fin n) : poly.vertices i ∈ Polygon.edgeSet R poly i
TauCeti.Geometry.Polygon.Basic · lines 105–106
How it differs: It places a corner point on the side that starts there, saying nothing about a point met by two 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 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 f31678c04a3a · pair key e7a1624a68a3.
Polygon.IsSimple. subsingleton_edgeSet_inter related
theorem Polygon.IsSimple.subsingleton_edgeSet_inter {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} : Polygon.IsSimple R poly → ∀ {i j : Fin n}, i ≠ j → (Polygon.edgeSet R poly i ∩ Polygon.edgeSet R poly j).Subsingleton
TauCeti.Geometry.Polygon.Simple · lines 171–184
How it differs: For a non-self-crossing polygon it bounds the meeting of two different sides to at most one point, without saying that point is a 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 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 582f05071a91 · pair key 24616f43ba3a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: The library fixes the regular n-gon inscribed in the unit circle and records it by its finite set of corner points.
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, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key 52d6c468b950 · pair key 63423d9ebf07.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Polygon. toTriangle related
def Polygon.toTriangle (R : Type*) {V : Type*} {P : Type*} [Ring R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P] (p : Polygon P 3) : Polygon.HasNondegenerateVertices R p → Affine.Triangle R P
Mathlib.Geometry.Polygon.Basic · lines 125–130
How it differs: It goes the other way, turning a three-corner polygon whose corners are not collinear into 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 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1d14bb7eac67 · pair key 657e246c3537.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Polygon.IsSimple. subsingleton_edgeSet_inter related
theorem Polygon.IsSimple.subsingleton_edgeSet_inter {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} : Polygon.IsSimple R poly → ∀ {i j : Fin n}, i ≠ j → (Polygon.edgeSet R poly i ∩ Polygon.edgeSet R poly j).Subsingleton
TauCeti.Geometry.Polygon.Simple · lines 171–184
How it differs: It deduces that two different sides of such a polygon share at most one point, without naming which point that 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 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 2ea9ec8e4a41 · pair key 686a39bbf785.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (3)
MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem. inside related
def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside : Set (ℝ × ℝ) → Set (ℝ × ℝ)
WantedExt.Geometry.PicksTheoremWanted · line 67
How it differs: Atlas defines, for any planar set, the open region of points whose component in the complement is bounded; the passage's solid polygon is that region taken with the polygon itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 1f9046ec3476 · pair key 92fcb23c55e6.
Polygon.IsSimple. isJordanCurve_boundary related
theorem Polygon.IsSimple.isJordanCurve_boundary {V : Type*} {P : Type*} {n : ℕ} [AddCommGroup V] [_root_.Module ℝ V] [AddTorsor V P] [NeZero n] {poly : Polygon P n} [TopologicalSpace V] [ContinuousSMul ℝ V] [TopologicalSpace P] [IsTopologicalAddTorsor P] [T2Space P] : Polygon.IsSimple ℝ poly → TauCeti.IsJordanCurve (Polygon.boundary ℝ poly)
TauCeti.Geometry.Polygon.Simple · lines 412–420
How it differs: It proves the union of the sides of a simple polygon is a Jordan curve, and the enclosed region follows only through the plane separation theorem.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key b4e9585c1f0b · pair key 4dc5a7535436.
TauCeti.IsJordanCurve. frontier_connectedComponentIn related
theorem TauCeti.IsJordanCurve.frontier_connectedComponentIn {C : Set ℂ} : TauCeti.IsJordanCurve C → ∀ {x : ℂ}, x ∉ C → frontier (connectedComponentIn Cᶜ x) = C
TauCeti.Analysis.Complex.PlaneSeparation.JordanCurve · lines 175–183
How it differs: For a Jordan curve in the complex plane it identifies the curve as the boundary of each component of the complement, but reaching a polygon needs the named lemma that its sides form such a curve.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 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 bc481168f9df · pair key f7efed40b656.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
TauCeti. filledHull related
def TauCeti.filledHull {E : Type*} [TopologicalSpace E] [Bornology E] : Set E → Set E
TauCeti.Topology.FilledHull · line 82
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 55b9fd829214 · pair key c5d0e224ca3a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting ✕ Not formalized
A polygonal chain may cross over itself, creating star polygons and other self-intersecting polygons. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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).
Related, but states something else (1)
Polygon. IsSimple related
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
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 6c9d1638f763 · pair key 180fd5576f6e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
TauCeti.SimplePolygon. isLocallyFlat_realize_euclideanSpace related
theorem TauCeti.SimplePolygon.isLocallyFlat_realize_euclideanSpace {m : ℕ} (p : TauCeti.SimplePolygon ℝ (EuclideanSpace ℝ (Fin (m + 1)))) : TauCeti.IsLocallyFlat ℝ (EuclideanSpace ℝ (Fin m)) p.realize
TauCeti.Geometry.Manifold.LocallyFlat.Polygon · lines 139–144
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 83245ab. Location key 7828b889c33a · pair key 75b2e95596e1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✕ Not formalized
A polygon is a 2-dimensional example of the more general polytope in any number of dimensions. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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).
Related, but states something else (1)
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification. ConvexPolytope related
structure MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope : ℕ → Type
WantedExt.Geometry.PlatonicClassificationWanted · line 73
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 3a5dda44344b · pair key e14bec05f61e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
TauCeti.UpperHalfPlane. ConvexPolygon related
structure TauCeti.UpperHalfPlane.ConvexPolygon (n : ℕ) [NeZero n]
TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex · lines 87–96
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 e27d34192217 · pair key fb4e423c506b.
Convex related
def Convex (𝕜 : Type*) {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] : Set E → Prop
Mathlib.Analysis.Convex.Basic · lines 53–54
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 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 fd72b17ed04b · pair key 774329236a3d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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.
Related, but states something else (1)
convex_iff_segment_subset related
theorem convex_iff_segment_subset {𝕜 : Type*} {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] {s : Set E} : Convex 𝕜 s ↔ ∀ ⦃x : E⦄, x ∈ s → ∀ ⦃y : E⦄, y ∈ s → segment 𝕜 x y ⊆ s
Mathlib.Analysis.Convex.Basic · lines 61–62
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 c2c350b090a1 · pair key 07dba7b6df85.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Convexity and intersection ✕ Not formalized
This condition is true for polygons in any geometry, not just Euclidean. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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).
Related, but states something else (1)
TauCeti.UpperHalfPlane.ConvexPolygon. geodesicSegment_subset_carrier related
theorem TauCeti.UpperHalfPlane.ConvexPolygon.geodesicSegment_subset_carrier {n : ℕ} [NeZero n] (P : TauCeti.UpperHalfPlane.ConvexPolygon n) {z w : UpperHalfPlane} : z ∈ P.carrier → w ∈ P.carrier → z.geodesicSegment w ⊆ P.carrier
TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex · lines 177–182
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 8586cc444909 · pair key 674019fbcd97.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Convexity and intersection ✕ Not formalized
Non-convex: a line may be found which meets its boundary more than twice. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt b093ed1834c5). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (3)
EuclideanGeometry. IsConvexPolygon related
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
How it differs: Lean fixes the positive notion, of which this bullet is the complement, and writes convexity by the signs of the oriented angles at successive corners rather than by counting how often a line meets the boundary, which is one notion in two encodings (PD10); it is stated over any oriented real plane rather than one fixed plane, so it is more general than the article's 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, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key 9079fbbe3330 · pair key 3b0718a9f741.
EuclideanGeometry. IsConvexPolygon related
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
How it differs: A second copy of the same definition in another library of this universe, with the opposite sign convention for the oriented angles; like the atlas copy it fixes the positive notion over any oriented real 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 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key c39c1f90cda1 · pair key f393c37b12da.
Convex related
def Convex (𝕜 : Type*) {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] : Set E → Prop
Mathlib.Analysis.Convex.Basic · lines 53–54
How it differs: Convexity of an arbitrary set of points, with no polygon, no corners and no count of how often a line meets a 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 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d5945882c098 · pair key 8d74b8fa3504.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Convexity and intersection ✕ Not formalized
Equivalently, there exists a line segment between two boundary points that passes outside the polygon. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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).
Related, but states something else (2)
convex_iff_segment_subset related
theorem convex_iff_segment_subset {𝕜 : Type*} {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] {s : Set E} : Convex 𝕜 s ↔ ∀ ⦃x : E⦄, x ∈ s → ∀ ⦃y : E⦄, y ∈ s → segment 𝕜 x y ⊆ s
Mathlib.Analysis.Convex.Basic · lines 61–62
How it differs: It characterises convexity of a set by segments between arbitrary members of the set; the article restricts the two endpoints to the boundary, and getting from one to the other is a geometric argument, not an instantiation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 358939cac411 · pair key 7dc6c6d882e6.
EuclideanGeometry. IsConvexPolygon related
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
How it differs: The passage asserts that two criteria for non-convexity agree; a declaration whose definition already picks one standard criterion presupposes that assertion rather than stating it (PD10's exception).
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 64c2773. Location key 28829b723afd · pair key 1ce4e65c3d85.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Convexity and intersection ◔ Partial
Partial: TauCeti states a special case (proved).
All convex polygons are simple. Show all
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.
Related, but states something else (1)
EuclideanGeometry. isConvexPolygon_triangle related
theorem EuclideanGeometry.isConvexPolygon_triangle {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] [Module.Oriented ℝ V (Fin 2)] [Fact (Module.finrank ℝ V = 2)] (t : Affine.Triangle ℝ P) : EuclideanGeometry.IsConvexPolygon t.points
MathlibExt.Geometry.TwoD · line 183
How it differs: It says a triangle's corners form a convex polygon, which is the hypothesis side of the article's claim and not its conclusion about simplicity.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773. Location key b216372d7f23 · pair key 041b3a6703f4.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Convexity and intersection ✕ Not formalized
Concave: Non-convex and simple. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 6fa14271373e). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
Polygon. IsSimple related
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
How it differs: It names simplicity alone; the class this bullet defines also requires failure of convexity, and no declaration of the universe carries both conditions.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 0efc12df56b9 · pair key c184938ec652.
EuclideanGeometry. IsConvexPolygon related
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
How it differs: It names convexity of a list of corners; the class defined here is cut out by failing that together with simplicity, which this declaration does not express.
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 4f601ba3ab0e · pair key a096abfdb90b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Convexity and intersection ✕ Not formalized
There is at least one interior angle greater than 180°. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt a5651b07a21a). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · 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 all
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.
Related, but states something else (1)
IsVisible related
def IsVisible (𝕜 : Type*) {V : Type*} {P : Type*} [Field 𝕜] [LinearOrder 𝕜] [AddCommGroup V] [_root_.Module 𝕜 V] [AddTorsor V P] : Set P → P → P → Prop
Mathlib.Analysis.Convex.Visible · line 47
How it differs: It states when one point sees another past an obstacle, a relation between two points; the article's class asks for a single viewpoint that sees the whole region, which this declaration does not express.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 876e1dca68fa · pair key 702a774d7229.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
EuclideanGeometry. isConvexPolygon_triangle related
theorem EuclideanGeometry.isConvexPolygon_triangle {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] [Module.Oriented ℝ V (Fin 2)] [Fact (Module.finrank ℝ V = 2)] (t : Affine.Triangle ℝ P) : EuclideanGeometry.IsConvexPolygon t.points
MathlibExt.Geometry.TwoD · line 183
How it differs: It gives one convex example but says nothing about the whole class the second conjunct describes, nor about simplicity.
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 00d3162033bb · pair key a0203cc6c974.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Convexity and intersection ✓ Formalized
Formalized: Mathlib states a more general result (proved).
All convex polygons are star-shaped. Show all
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.
Related, but states something else (1)
IsVisible related
def IsVisible (𝕜 : Type*) {V : Type*} {P : Type*} [Field 𝕜] [LinearOrder 𝕜] [AddCommGroup V] [_root_.Module 𝕜 V] [AddTorsor V P] : Set P → P → P → Prop
Mathlib.Analysis.Convex.Visible · line 47
How it differs: Mathlib defines when two points see each other through a set, with nothing said about convex figures being seen from a single point.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9f750fa0dc45 · pair key 773207844615.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Convexity and intersection ✕ Not formalized
Self-intersecting: the boundary of the polygon crosses itself. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt bd0ac37890b9). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
Polygon. IsSimple related
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
How it differs: TauCeti defines the opposite property, a polygon whose distinct edges meet only when they are consecutive and then only at the vertex they share.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key f5520aac9d2a · pair key 4df932b0829d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Convexity and intersection ✕ Not formalized
Star polygon: a polygon which self-intersects in a regular way. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 4fc6ea51574f). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Convexity and intersection ✕ Not formalized
A polygon cannot be both a star and star-shaped. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 256cdd4c0c9f). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Equality and symmetry ✕ Not formalized
Equiangular: all corner angles are equal. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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.
Related, but states something else (1)
TauCeti.UpperHalfPlane.ConvexPolygon. interiorAngle related
def TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle {n : ℕ} [NeZero n] : TauCeti.UpperHalfPlane.ConvexPolygon n → Fin n → ℝ
TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex · lines 290–291
How it differs: TauCeti measures the angle at each corner of a hyperbolic convex polygon, without any condition that those angles agree.
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 55e7557bbd3b · pair key 4b15ee52568f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Affine.Simplex. Equilateral related
def Affine.Simplex.Equilateral {R : Type*} {V : Type*} {P : Type*} [Ring R] [SeminormedAddCommGroup V] [PseudoMetricSpace P] [_root_.Module R V] [NormedAddTorsor V P] {n : ℕ} : Affine.Simplex R P n → Prop
Mathlib.Analysis.Normed.Affine.Simplex · lines 83–84
How it differs: Mathlib asks that all distances between distinct vertices of a simplex agree, which for a figure of four or more corners counts the diagonals as well as 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 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 8815aba2498a · pair key 667e8a95e89b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Equality and symmetry ✕ Not formalized
Regular: both equilateral and equiangular. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 08ac64393a3c). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (2)
Erdos958. IsEquidistantOnCircle related
def Erdos958.IsEquidistantOnCircle : Finset (EuclideanSpace ℝ (Fin 2)) → Prop
FormalConjectures.ErdosProblems.«958» · lines 44–47
How it differs: It asks that a finite plane set be the points of some circle taken at a fixed starting angle and a constant nonzero angular step.
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 2219db9d62ed · pair key bb85e1c5bf1b.
Erdos94. regularNGon related
def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))
FormalConjectures.ErdosProblems.«94» · lines 40–42
How it differs: It constructs the corner set of one figure, the regular one inscribed in the unit circle, for each number of 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, 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 cafd4263e7c5 · pair key e68720882380.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Equality and symmetry ✕ Not formalized
Tangential: all sides are tangent to an inscribed circle. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Equality and symmetry ✕ Not formalized
Isogonal or vertex-transitive: all corners lie within the same symmetry orbit. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Equality and symmetry ◔ Partial
Partial: Mathlib states part of this (proved).
The polygon is also cyclic and equiangular. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Equality and symmetry ✕ Not formalized
Isotoxal or edge-transitive: all sides lie within the same symmetry orbit. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Classification › Equality and symmetry ◔ Partial
Partial: Mathlib states part of this (proved).
The polygon is also equilateral and tangential. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 6ace8c5c63af). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Classification › Equality and symmetry ✕ Not formalized
A non-convex regular polygon is called a regular star polygon. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 620686630fd4). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt a27d8f91a109). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Properties and formulas › Angles ✕ Not formalized
Any polygon has as many corners as it has sides. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 − 2 n )π radians or 180 − 360 n degrees. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 p q -gon (a p-gon with central density q), each interior angle is π (p − 2q )p radians or 180(p − 2q ) p degrees. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Properties and formulas › Angles ✕ Not formalized
Exterior angle – The exterior angle is the supplementary angle to the interior angle. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 13e6504d8876). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt f7c91219a94a). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt fd4f3d0462c5). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz. hopf_umlaufsatz related
theorem MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.hopf_umlaufsatz {r : ℝ → MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} : MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r → MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α → MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.totalCurvature α = 2 * π
WantedExt.Geometry.HopfUmlaufsatzWanted · line 96
How it differs: The theorem of turning tangents in the universe is stated for a positively oriented simple closed unit-speed plane curve with a tangent angle lift; a polygon's boundary has corners and admits no such unit-speed tangent lift, so neither setting contains the other.
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 64c2773. Location key af30018fca55 · pair key 3149e551b9a3.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz. hopf_umlaufsatz related
theorem MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.hopf_umlaufsatz {r : ℝ → MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.Plane} {α : ℝ → ℝ} : MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.IsPositiveSimpleClosedUnitSpeedCurve r → MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.IsTangentAngleLift r α → MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.totalCurvature α = 2 * π
WantedExt.Geometry.HopfUmlaufsatzWanted · line 96
How it differs: The total curvature of a positively oriented simple closed unit-speed curve is two pi; this is the smooth analogue, and a polygonal boundary is not one of its curves.
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 27e948c57fa4 · pair key 381fe2c3da50.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 3691d60f29d2). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
AbsolutelyContinuousOnInterval. exists_int_windingNumber related
theorem AbsolutelyContinuousOnInterval.exists_int_windingNumber {γ : ℝ → ℂ} {a b : ℝ} {z : ℂ} : AbsolutelyContinuousOnInterval γ a b → γ a = γ b → z ∉ γ '' Set.uIcc a b → ∃ n, TauCeti.Contour.windingNumber γ a b z = ↑n
TauCeti.Analysis.Contour.Winding.AbsolutelyContinuous.Basic · lines 74–82
How it differs: This gives integrality of the winding number of a closed curve about a point off the curve; the passage's d counts how far the direction of travel rotates at the vertices, a different 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, 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 2dba4f75dd5f · pair key c5fb4474b475.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 (x 0 , y 0 ), (x 1 , y 1 ), …, (x n − 1 , y n − 1 ) in order. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 = 1 2 ∑n − 1i = 0 (x i y i + 1 − x i + 1y i ) where x n = x 0 and y n = y 0 , or, using determinants 16A 2 = ∑n − 1i = 0 ∑n − 1j = 0 | Q i , j Q i , j + 1Q i + 1, j Q i + 1, j + 1| , where Q i , j is the squared distance between (x i , y i ) … Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 = 1 2 ∑n − 1i = 0 (x i y i + 1 − x i + 1y i ) where x n = x 0 and y n = y 0 , or, using determinants 16A 2 = ∑n − 1i = 0 ∑n − 1j = 0 | Q i , j Q i , j + 1Q i + 1, j Q i + 1, j + 1| , where Q i , j is the squared distance between (x i , y i ) and (x j , y j ). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Orientation. areaForm_neg_orientation related
theorem Orientation.areaForm_neg_orientation {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [Fact (Module.finrank ℝ E = 2)] (o : Orientation ℝ E (Fin 2)) : (-o).areaForm = -o.areaForm
Mathlib.Analysis.InnerProductSpace.TwoDim · lines 116–118
How it differs: It flips the sign of the plane's area form when the orientation is reversed, but reaching the polygon's signed area from the area form needs a further step the declaration does not carry.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 56441c88bcc5 · pair key 82f787987b92.
TauCeti.Green. triangleDet_swap related
theorem TauCeti.Green.triangleDet_swap (c p q : ℂ) : TauCeti.Green.triangleDet c q p = -TauCeti.Green.triangleDet c p q
TauCeti.Analysis.Green.Polygonal.Geometry · lines 48–50
How it differs: Interchanging two of the three vertices negates the oriented determinant of a triangle, which is the ordering dependence in the three vertex case only and for the determinant rather than for a polygon's signed 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 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 23ba93acd0f5 · pair key 5e4cd20021ff.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt b77ac1284f0f). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · 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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 = 1 2 (a 1 [a 2 sin(θ 1 ) + a 3 sin(θ 1 + θ 2 ) + ⋯ + a n − 1 sin(θ 1 + θ 2 + ⋯ + θ n − 2 )]+ a 2 [a 3 sin(θ 2 ) + a 4 sin(θ 2 + θ 3 ) + ⋯ + a n − 1 sin(θ 2 + ⋯ + θ n − 2 )] + ⋯ + a n − 2 [a n − 1 sin(θ n − 2 )]). The formula was described by Lopshits in 1963. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 5b481d9bd6b7). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · 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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 p 2 > 4πA holds. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 46f5575faf00). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
MathlibExt.MeasureTheory.Geometry.BanachTarskiWanted. FinitelyEquidecomposableByIsometries related
def MathlibExt.MeasureTheory.Geometry.BanachTarskiWanted.FinitelyEquidecomposableByIsometries {X : Type*} [MetricSpace X] : Set X → Set X → Prop
MathlibExt.MeasureTheory.Geometry.BanachTarski · line 2201
How it differs: It defines the relation of being cut into finitely many pieces moved by isometries, but asserts nothing about two polygons of equal area, and its pieces are arbitrary sets rather than polygonal 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 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 28c2a60805d8 · pair key b61439aeb9b2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 3d226bae4000). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 5d5e9b87359e). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · 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 = 1 2 ⋅ p ⋅ r . This radius is also termed its apothem and is often represented as a. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 87bcbfac1d45). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · 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 = 1 2 ⋅ p ⋅ r . This radius is also termed its apothem and is often represented as a. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt bd6ddea7d976). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · 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 = R 2 ⋅ n 2 ⋅ sin 2π n = R 2 ⋅ n ⋅ sin π n ⋅ cos π n Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
TauCeti. signedArea_eq_integral_windingWeight related
theorem TauCeti.signedArea_eq_integral_windingWeight {γ : ℝ → ℂ} {a b : ℝ} : a < b → AbsolutelyContinuousOnInterval γ a b → γ a = γ b → TauCeti.signedArea γ a b = ∫ (z : ℂ), TauCeti.Green.windingWeight γ a b z
TauCeti.Analysis.Green.Examples.CurveArea.Winding · lines 44–50
How it differs: It states the same density-weighted identity for every closed absolutely continuous curve, but its left side is the signed-area integral, so reaching the passage's vertex formula needs the separate shoelace lemma as a bridge.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 9e356beeeb83 · pair key d74ab4f9a28a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 3319f1174d36). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · 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 all
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.
Related, but states something else (1)
TauCeti.Green.Examples. bowTieCurve_crossing related
theorem TauCeti.Green.Examples.bowTieCurve_crossing : TauCeti.Green.Examples.bowTieCurve (1 / 2) = TauCeti.Green.Examples.bowTieCurve (5 / 2) ∧ 1 / 2 ≠ 5 / 2 ∧ 1 / 2 ∈ Set.Ioo 0 4 ∧ 5 / 2 ∈ Set.Ioo 0 4
TauCeti.Analysis.Green.Examples.BowTie · lines 33–36
How it differs: It records the single self-crossing of the library's figure, which is what splits it into the two lobes, but it says nothing about densities.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. 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 e089f5a00791 · pair key 8be0dbc35753.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
TauCeti.Green.Examples. integral_circulationFun_area_bowTieCurve related
theorem TauCeti.Green.Examples.integral_circulationFun_area_bowTieCurve : ∫ (t : ℝ) in 0..4, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ TauCeti.Green.Examples.bowTieCurve t = 0
TauCeti.Analysis.Green.Examples.BowTie · lines 203–219
How it differs: It computes the boundary line integral for the area form along the same figure; turning that into the density-weighted area of the lobes needs Green's theorem as a further step.
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 a0321a4aeae1 · pair key 15f2c674178d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 1cdc618f2d1d). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
TauCeti. filledHull related
def TauCeti.filledHull {E : Type*} [TopologicalSpace E] [Bornology E] : Set E → Set E
TauCeti.Topology.FilledHull · line 82
How it differs: It names the enclosed point set of a closed set, which is the first half of the passage's recipe, but it assigns no area to that set and is not the quantity the passage defines.
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 810df2611f39 · pair key c1a2ad5ed249.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
Related, but states something else (1)
TauCeti. signedArea_eq_intCast_mul_volume_real_of_windingNumber_eq related
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
How it differs: It ties the signed area of a closed curve to the Lebesgue measure of the region it encloses, under the hypothesis that the index is one fixed integer everywhere there; it never says that this measure equals the area of simple polygons sharing the outline.
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 e8fd33366af1 · pair key 702640b83eab.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt d34ecca5e959). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · 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 C x = 1 6A ∑n − 1i = 0 (x i + x i + 1 )(x i y i + 1 − x i + 1y i ) C y = 1 6A ∑n − 1i = 0 (y i + y i + 1 )(x i y i + 1 − x i + 1y i ). In these formulas, the signed value of area A must be used. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt c8c0e2e87468). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Properties and formulas › Centroid ✕ Not formalized
…C x = 1 6A ∑n − 1i = 0 (x i + x i + 1 )(x i y i + 1 − x i + 1y i ) C y = 1 6A ∑n − 1i = 0 (y i + y i + 1 )(x i y i + 1 − x i + 1y i ). In these formulas, the signed value of area A must be used. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 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).
Related, but states something else (1)
TauCeti. signedArea related
def TauCeti.signedArea : (ℝ → ℂ) → ℝ → ℝ → ℝ
TauCeti.Analysis.Green.Examples.CurveArea.SignedArea · lines 38–39
How it differs: It defines the signed area of a closed curve as a line integral, so it is the quantity the passage asks for, but the passage's content is which value the centroid formulas use and those formulas are absent from 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, 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 314fef1f1ffb · pair key 0b6000445f00.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 1bccdcb4b7f3). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · 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 c x = 1 n ∑n − 1i = 0 x i c y = 1 n ∑n − 1i = 0 y i Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 8b0798185016). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · 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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Generalizations ✕ Not formalized
A skew polygon does not lie in a flat plane, but zigzags in three (or more) dimensions. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 9db9f816f2e6). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Generalizations ✕ Not formalized
The Petrie polygons of the regular polytopes are well known examples. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 14fe4c5db22f). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 3357a1868df6). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Generalizations ✕ Not formalized
A skew apeirogon is an infinite sequence of sides and angles that do not lie in a flat plane. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt c28ce4b406ad). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 0cb509599913). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · 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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 502dc5a2ce36). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Generalizations ✕ Not formalized
An abstract polygon is an algebraic partially ordered set representing the various elements (sides, vertices, etc.) and their connectivity. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt cb6e6aab374e). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Generalizations ✕ Not formalized
A real geometric polygon is said to be a realization of the associated abstract polygon. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Erdos660. IsPolyhedronVertices related
def Erdos660.IsPolyhedronVertices : Finset (EuclideanSpace ℝ (Fin 3)) → Prop
FormalConjectures.ErdosProblems.«660» · lines 43–44
How it differs: It is written for three-dimensional space, but it describes which finite point sets are vertex sets, not what the bounded solid itself 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 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78. Location key cfff5b8e6bc3 · pair key 8fae1e2f6781.
TauCeti. IsConvexPolyhedron related
def TauCeti.IsConvexPolyhedron {E : Type*} [AddCommGroup E] [_root_.Module ℝ E] [TopologicalSpace E] : Set E → Prop
TauCeti.Analysis.Convex.Polyhedron.Basic · lines 56–57
How it differs: It admits unbounded solution sets of affine inequalities, such as a half space or the whole module, which are not bounded solids with polygonal faces.
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 69a6222d2b98 · pair key 2e22d6042010.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Computer graphics ✕ Not formalized
There are (n + 1)2 / 2(n2) vertices per triangle. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Computer graphics ✕ Not formalized
Where n is large, this approaches one half. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt f3952e92cb05). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
Polynomial. div_tendsto_atTop_leadingCoeff_div_of_degree_eq related
theorem Polynomial.div_tendsto_atTop_leadingCoeff_div_of_degree_eq {𝕜 : Type*} [NormedField 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (P Q : 𝕜[X]) [OrderTopology 𝕜] : P.degree = Q.degree → Filter.Tendsto (fun x ↦ Polynomial.eval x P / Polynomial.eval x Q) Filter.atTop (𝓝 (P.leadingCoeff / Q.leadingCoeff))
Mathlib.Analysis.Polynomial.Basic · lines 184–188
How it differs: It gives the limit of a quotient of two equal-degree polynomial evaluations along the real variable going up, so reaching the passage needs both the mesh counting formula and a named lemma carrying the real limit back along the natural numbers.
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 491dd79c634d · pair key 8f0e2cf18250.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Computer graphics ✕ Not formalized
Or, each vertex inside the square mesh connects four edges (lines). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 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).
Related, but states something else (1)
SimpleGraph. degree_boxProd related
theorem SimpleGraph.degree_boxProd {α : Type*} {β : Type*} {G : SimpleGraph α} {H : SimpleGraph β} (x : α × β) [Fintype ↑(G.neighborSet x.1)] [Fintype ↑(H.neighborSet x.2)] [Fintype ↑((G □ H).neighborSet x)] : (G □ H).degree x = G.degree x.1 + H.degree x.2
Mathlib.Combinatorics.SimpleGraph.Prod · lines 249–253
How it differs: It adds the two factor degrees of a box product; the square mesh is nowhere built as such a product in the universe, and the value four would still need the separate fact that an interior path vertex has two neighbours.
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 ec571ee6ed53 · pair key edcc664a3092.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 = (x 0 , y 0 ) lies inside a simple polygon given by a sequence of line segments. This is called the point in polygon test. Show all
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.
Related, but states something else (2)
MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem. IsSimple related
def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple {n : ℕ} : Polygon (ℝ × ℝ) n → Prop
WantedExt.Geometry.PicksTheoremWanted · line 78
How it differs: It is the predicate picking out the plane simple polygons the passage's test is run on, so it supplies one of the passage's objects without asserting anything about a point being inside one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 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 64c2773. Location key 76cec7feab2e · pair key d95c8d40d5c8.
Polygon. IsSimple related
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
How it differs: It is a non-self-intersection condition on a cycle of vertices in an affine space, so it describes the passage's polygon without saying when a point lies inside one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 52b2137e74de · pair key 0a69b4f9f76d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗