{"assessment":{"class":"C","importance":"top"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":23621,"passages":[{"absence":null,"basis":"558d1f18eeb7f9232141a681013accd097ed927e639ed7546dd037967ab3c086","coverage":null,"id":"enwiki-23621-1377769198::In-text #504052cb","item":"In-text #504052cb","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polygon","end_line":31,"library":"mathlib","line":29,"location_key":"558d1f18eeb7f9232141a681013accd097ed927e639ed7546dd037967ab3c086","module":"Mathlib.Geometry.Polygon.Basic","note":"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.","pair_key":"c97f0fd12927ee44f44583876e9b3e52bfd31de323653455c9241c31dbc38d88","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Polygon : Type u_1 → ℕ → Type u_1"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly","library":"atlas","line":62,"location_key":"00a155272d633d2e6ac007d5a04589f84c83f3c2c378fc2767db77f8ec0bb4ea","module":"WantedExt.Geometry.PicksTheoremWanted","note":"Atlas builds the plane polygon only from corner points with integer coordinates.","pair_key":"e9b8b7489c17418c93fd2f6d88f9c2f7960981f25fc8e9966f65b01205dc2fbf","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.latPoly {n : ℕ} : (Fin n → ℤ × ℤ) → Polygon (ℝ × ℝ) n"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.BoundaryChain.polygon","end_line":134,"library":"tauceti","line":133,"location_key":"809c0a832a7183965f8d318c4e76fa3355fdeae42b14ee60725373aabc086d07","module":"TauCeti.Analysis.Green.Polygonal.Basic","note":"TauCeti forms the chain of successive segments through complex points, with no requirement that the last point return to the first.","pair_key":"794d0774b40748e6f87375b1dbe5113e9c58826302e2c56fdc908d46ce04e612","path":"TauCeti/Analysis/Green/Polygonal/Basic.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Green.BoundaryChain.polygon {N : ℕ} : (Fin (N + 1) → ℂ) → TauCeti.Green.BoundaryChain"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6b9058544e5d95044ead6b4f9783619440e62993df11ae9730780caa5aff2047","prominence":"subject","quote":{"exact":"In geometry, a polygon (/ˈpɒlɪɡɒn/) is a plane figure made up of"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"In geometry, a polygon (/ˈpɒlɪɡɒn/) is a plane figure made up of line segments connected to form a closed polygonal chain.","segments":[{"text":"In geometry, a polygon (/ˈpɒlɪɡɒn/) is a plane figure made up of line segments connected to form a closed polygonal chain."}]},"unresolved":null},{"absence":null,"basis":"d56120843b4729c111649550d36590c73913068059d7bc59ee86d175472de102","coverage":null,"id":"enwiki-23621-1377769198::In-text #12777465","item":"In-text #12777465","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polygon.edgeSet","end_line":63,"library":"mathlib","line":62,"location_key":"d56120843b4729c111649550d36590c73913068059d7bc59ee86d175472de102","module":"Mathlib.Geometry.Polygon.Basic","note":"Mathlib gives each side as the affine segment between consecutive corner points, over any ring and affine space rather than only the plane.","pair_key":"acc8c34348b146d0234e597c75fc606f510d0f2098d49e7b5bc628ea66ffbe3d","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polygon.edgePath","end_line":58,"library":"mathlib","line":57,"location_key":"b9957387f892e0e6a3e9046d10a18c0ff5ef2df4497b55db7f50c0fd38f067b1","module":"Mathlib.Geometry.Polygon.Basic","note":"Mathlib presents the same side as a parametrised affine map, again over any ring and affine space.","pair_key":"b50939304c1803db063fb5fdcc2aa344ba19542d3bc4d8983a27b505c8ab7d99","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4a9c8fe75a38f2848ec4d557e5b9718ad2507b07c6ba4afeddd10ddbb9dff615","prominence":"central","quote":{"exact":"The segments of a closed polygonal chain are called its edges or"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The segments of a closed polygonal chain are called its edges or sides.","segments":[{"text":"The segments of a closed polygonal chain are called its edges or sides."}]},"unresolved":null},{"absence":null,"basis":"35c45c459c08cc718732e2b0bad241dd64410d1f3fd0e33508c7ad3544f9d1a0","coverage":null,"id":"enwiki-23621-1377769198::In-text #ceb02b1c","item":"In-text #ceb02b1c","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.schwarzChristoffelPolygon_bounded_edges_adjacent_and_eq_vertex_of_injOn","end_line":76,"library":"tauceti","line":38,"location_key":"35c45c459c08cc718732e2b0bad241dd64410d1f3fd0e33508c7ad3544f9d1a0","module":"TauCeti.Analysis.Complex.Conformal.SchwarzChristoffel.Polygon.EdgeIntersection.Converse","note":"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.","pair_key":"c320da4e5016c4be8c83c5d9a8f7207966b58d16ebe3c39b1722300dc4d4e08c","path":"TauCeti/Analysis/Complex/Conformal/SchwarzChristoffel/Polygon/EdgeIntersection/Converse.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":true,"text":"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","type":"∀ {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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.apply_mem_edgeSet_self","end_line":106,"library":"tauceti","line":105,"location_key":"f31678c04a3a5a83533a990994a91cf0212b54ee0303d9e8ac4c75e79225fb51","module":"TauCeti.Geometry.Polygon.Basic","note":"It places a corner point on the side that starts there, saying nothing about a point met by two sides.","pair_key":"e7a1624a68a30acf023a62c266190c6c934c218731e8af56b41a18a757ba38ba","path":"TauCeti/Geometry/Polygon/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple.subsingleton_edgeSet_inter","end_line":184,"library":"tauceti","line":171,"location_key":"582f05071a912818a65625471672dd70d81720a31f2ddb9475cf327df3a579c0","module":"TauCeti.Geometry.Polygon.Simple","note":"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.","pair_key":"24616f43ba3a0cd3b60bb7a7571637d3302e3293012c78730daf9ffa4c2308de","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3f7c573f152d954d26015ddd3ffbd0f4df11226d804037fcf85f1b644d94c4e1","prominence":"central","quote":{"exact":"The points where two edges meet are the polygon's vertices or corners."},"quote_capped":false,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The points where two edges meet are the polygon's vertices or corners.","segments":[{"text":"The points where two edges meet are the polygon's vertices or corners."}]},"unresolved":null},{"absence":null,"basis":"78f05802a4e99c3389e11e005366157474e072f45ca65c276eed7c09870ee960","coverage":null,"id":"enwiki-23621-1377769198::In-text #0f208c9c","item":"In-text #0f208c9c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polygon","end_line":31,"library":"mathlib","line":29,"location_key":"78f05802a4e99c3389e11e005366157474e072f45ca65c276eed7c09870ee960","module":"Mathlib.Geometry.Polygon.Basic","note":"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.","pair_key":"1f2f5b5b3d7a8c16a0f15a8f42ccefc4755273c7295d9751e29ea628a2716d52","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Polygon : Type u_1 → ℕ → Type u_1"},"statement":false},{"challenge":"downgraded","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"low","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"52d6c468b950b8dbb679cb2d63c4bb497c52271d7bc9a2b2c5d8d7811888b4d6","module":"FormalConjectures.ErdosProblems.«94»","note":"The library fixes the regular n-gon inscribed in the unit circle and records it by its finite set of corner points.","pair_key":"63423d9ebf07900e5fe25e23a0c11a91368ff80de4f1227f2f1066e22ee64094","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e67b44e0ccccc41534e9680427b05f57212212f42a560018e117da6c1c862988","prominence":"central","quote":{"exact":"An n-gon is a polygon with n sides"},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":"; for example, a triangle is a 3-gon.","segments":[{"text":"; for example, a triangle is a 3-gon."}]},"layer":"An n-gon is a polygon with n sides","segments":[{"text":"An n-gon is a polygon with n sides"}]},"unresolved":null},{"absence":null,"basis":"6abfeb99f5a8b6f9157ce68ee2ca4524889e9563fb8f92be7eff91f7c4a5ba9a","coverage":null,"id":"enwiki-23621-1377769198::In-text #de1779fb","item":"In-text #de1779fb","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Affine.Triangle.toPolygon","end_line":111,"library":"mathlib","line":106,"location_key":"6abfeb99f5a8b6f9157ce68ee2ca4524889e9563fb8f92be7eff91f7c4a5ba9a","module":"Mathlib.Geometry.Polygon.Basic","note":"Mathlib gives the passage's identification as an injective map from triangles into the three-corner polygons, over any ring and affine space.","pair_key":"d0602fcbaf98502cd551dc91847fb0e0917e02be57fbb8ba06340c653ef09522","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Affine.Triangle.toSimplePolygon_numVertices","end_line":653,"library":"tauceti","line":651,"location_key":"2d27d971869e70b527f8f16d4c9f3c44bc2262d91bde7387cfb3e85cf27764e5","module":"TauCeti.Geometry.Polygon.Simple","note":"TauCeti counts the corners of the non-self-crossing polygon built from a triangle, over any ordered ring and affine space.","pair_key":"3e01d3d9f22e224267de524261cbb8612d0b17f4c48d420b8ca40735f3f92b87","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polygon.toTriangle","end_line":130,"library":"mathlib","line":125,"location_key":"1d14bb7eac6767f07fb7ce77635337e34ffc03fd78907f951e54284896a464e1","module":"Mathlib.Geometry.Polygon.Basic","note":"It goes the other way, turning a three-corner polygon whose corners are not collinear into a triangle.","pair_key":"657e246c35372be373137c42e1e520c0206967442fa5b5d442116bff485c5b3a","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d77c92d102a752f50bfc24017b213afb392354d063aaf3408c0abd51a2e2e63f","prominence":"supporting","quote":{"exact":"for example, a triangle is a 3-gon."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"An n-gon is a polygon with n sides; ","segments":[{"text":"An n-gon is a polygon with n sides; "}]},"layer":"for example, a triangle is a 3-gon.","segments":[{"text":"for example, a triangle is a 3-gon."}]},"unresolved":null},{"absence":null,"basis":"ed5f887a05cf8cf30dbc8385d295db2682a14b776f8dc53c66874ff47b20a15d","coverage":null,"id":"enwiki-23621-1377769198::In-text #1a1b8507","item":"In-text #1a1b8507","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple","library":"atlas","line":78,"location_key":"ed5f887a05cf8cf30dbc8385d295db2682a14b776f8dc53c66874ff47b20a15d","module":"WantedExt.Geometry.PicksTheoremWanted","note":"Atlas states the property for polygons in the coordinate plane, and its docstring names the simple, Jordan polygon.","pair_key":"3866ca208d96e73ab58e7e580f2240bcf5803b516e65e0a2976ba7055187c953","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple {n : ℕ} : Polygon (ℝ × ℝ) n → Prop"},"statement":true},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"911adf69751532b7436daec52e610ab966059e877b083bdd186374652ea8bea6","module":"TauCeti.Geometry.Polygon.Simple","note":"TauCeti defines simplicity for polygons in any affine space over an ordered ring, and also rules out repeated consecutive corners.","pair_key":"8c6aa4e4a7443e727ac45c41347f7f36ada80f9bb16df8a828bf88f9b05a8e96","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.SimplePolygon","end_line":558,"library":"tauceti","line":550,"location_key":"d76b928edbcd64ed9018a2a178fd4ca27def569fb4868ddd89a41b98c486086a","module":"TauCeti.Geometry.Polygon.Simple","note":"TauCeti bundles the polygon with its corner count and its simplicity, over any affine space above an ordered ring.","pair_key":"df64e57fc0b07616d0f8a1d1004b08b6bb20dec03455771f1cc4935fc2ab9df8","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":3,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"structure TauCeti.SimplePolygon (R : Type*) {V : Type*} (P : Type*) [Ring R] [PartialOrder R] [ZeroLEOneClass R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"864fb0b22eb4182f5c6d967e11346044b93fbc1dcdea6191eebcecee6d50761e","prominence":"central","quote":{"exact":"A simple polygon is one which does not intersect itself."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A simple polygon is one which does not intersect itself.","segments":[{"text":"A simple polygon is one which does not intersect itself."}]},"unresolved":null},{"absence":null,"basis":"ae2e96bf431ffa8fbbba15e3e86ad62df22f7e489f57b3401772531dfd0efe83","coverage":null,"id":"enwiki-23621-1377769198::In-text #0a2678e5","item":"In-text #0a2678e5","kind":"definition","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"ae2e96bf431ffa8fbbba15e3e86ad62df22f7e489f57b3401772531dfd0efe83","module":"TauCeti.Geometry.Polygon.Simple","note":"TauCeti spells simplicity out as the condition on side meetings for polygons in any affine space over an ordered ring.","pair_key":"344319fcf578f37a82719ca9206a49793369838fb3de8c25c145235eb939d961","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple.subsingleton_edgeSet_inter","end_line":184,"library":"tauceti","line":171,"location_key":"2ea9ec8e4a4160b498331c266760e62aa0e7f2d4b35263e12f4ff39d33b44e12","module":"TauCeti.Geometry.Polygon.Simple","note":"It deduces that two different sides of such a polygon share at most one point, without naming which point that is.","pair_key":"686a39bbf78595316634e218d37f6b2c32f3826f7424a8744515acdf8a59053d","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"40c17aedce87f4610be0de5d57273e9cb72cc7d58654f14a9e8780d3fc8dd990","prominence":"supporting","quote":{"exact":"More precisely, the only allowed intersections among the line segments that make"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"0aa9e80e0d896b40417b7ead38b59874161cc737db421bbb8d4c3c8c4d68f164","coverage":null,"id":"enwiki-23621-1377769198::In-text #152f10d3","item":"In-text #152f10d3","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.filledHull","end_line":82,"library":"tauceti","line":82,"location_key":"0aa9e80e0d896b40417b7ead38b59874161cc737db421bbb8d4c3c8c4d68f164","module":"TauCeti.Topology.FilledHull","note":"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.","pair_key":"ab14f05cf64b694bbf59bd994512e53b20eb0d198e46de427bed8ef8c5f7b2c5","path":"TauCeti/Topology/FilledHull.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.filledHull {E : Type*} [TopologicalSpace E] [Bornology E] : Set E → Set E"},"statement":false},{"challenge":"downgraded","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside","library":"atlas","line":67,"location_key":"1f9046ec3476fc0d96e1eb37a6550e9b5e80e4daab3eff695514df71863cee1c","module":"WantedExt.Geometry.PicksTheoremWanted","note":"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.","pair_key":"92fcb23c55e6019433108fed84f806e75e04c85c6c4fbc5b697a3a7bf41b7c80","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside : Set (ℝ × ℝ) → Set (ℝ × ℝ)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple.isJordanCurve_boundary","end_line":420,"library":"tauceti","line":412,"location_key":"b4e9585c1f0b56129ba5ff2350bcacbb246d572f5b78b7c5661a94977606421c","module":"TauCeti.Geometry.Polygon.Simple","note":"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.","pair_key":"4dc5a7535436cf688bd29f52ba7852391a48bcd3fb44cf1ce75a99509c8b5077","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.IsJordanCurve.frontier_connectedComponentIn","end_line":183,"library":"tauceti","line":175,"location_key":"bc481168f9df67ec343a1fb2b4291a7b14db9533bb26a83e1109ce5a282dde0a","module":"TauCeti.Analysis.Complex.PlaneSeparation.JordanCurve","note":"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.","pair_key":"f7efed40b656076e852990d149522728667b314f53ea6603f66efe1e44cd9500","path":"TauCeti/Analysis/Complex/PlaneSeparation/JordanCurve.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.IsJordanCurve.frontier_connectedComponentIn {C : Set ℂ} : TauCeti.IsJordanCurve C → ∀ {x : ℂ}, x ∉ C → frontier (connectedComponentIn Cᶜ x) = C"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9c568d6b270955586acb4d2f2d535af8cad92396fce1fb6268527ba9f05da710","prominence":"central","quote":{"exact":"A simple polygon is the boundary of a region of the plane"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A simple polygon is the boundary of a region of the plane that is called a solid polygon.","segments":[{"text":"A simple polygon is the boundary of a region of the plane that is called a solid polygon."}]},"unresolved":null},{"absence":null,"basis":"8a7002f400a6989c4e87e5c389c0b5dce66fa3411b37c503db23f492a18df85e","coverage":null,"id":"enwiki-23621-1377769198::In-text #068db6c7","item":"In-text #068db6c7","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside","library":"atlas","line":67,"location_key":"8a7002f400a6989c4e87e5c389c0b5dce66fa3411b37c503db23f492a18df85e","module":"WantedExt.Geometry.PicksTheoremWanted","note":"The library object is the bounded complementary region of an arbitrary planar curve, so its inputs reach far past the boundaries of simple polygons.","pair_key":"002e0aeaa47f8f1da40ee9e2f60e07d47e56a7de3e58eb4a6fe410f1c72a07d0","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside : Set (ℝ × ℝ) → Set (ℝ × ℝ)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.filledHull","end_line":82,"library":"tauceti","line":82,"location_key":"55b9fd829214616513c691f484e18e1804c5963cdc1cdb218d972b9143030148","module":"TauCeti.Topology.FilledHull","note":null,"pair_key":"c5d0e224ca3a95e6bb2f1f2f10fead4b96a8410bf47506a79919cd32a5972767","path":"TauCeti/Topology/FilledHull.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.filledHull {E : Type*} [TopologicalSpace E] [Bornology E] : Set E → Set E"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f67328fbc7929102b4527e56df4fea7f948a52b09490baa96d7b8070c304f209","prominence":"central","quote":{"exact":"The interior of a solid polygon is its body, also known as"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The interior of a solid polygon is its body, also known as a polygonal region or polygonal area.","segments":[{"text":"The interior of a solid polygon is its body, also known as a polygonal region or polygonal area."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"8158e37cd5d2af4a8a33ca73627481f8d15affd58af73e0ec396343f7aab8fb8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #39bd61ec","item":"In-text #39bd61ec","kind":"definition","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"6c9d1638f763c082710b9e45a7bcaebbc4aa6a2f8c6a5cf5bc070ef32660c617","module":"TauCeti.Geometry.Polygon.Simple","note":null,"pair_key":"180fd5576f6e694815ed45471f48b5d257276f1ca7bcab03fa0951d99bd66f72","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"df9ba2e33ec3afbc74afe997b198648285ef37102f1dddbd1cbc5334f29ff193","prominence":"supporting","quote":{"exact":"A polygonal chain may cross over itself, creating star polygons and other"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A polygonal chain may cross over itself, creating star polygons and other self-intersecting polygons.","segments":[{"text":"A polygonal chain may cross over itself, creating star polygons and other self-intersecting polygons."}]},"unresolved":null},{"absence":null,"basis":"8da2c34ba64ed17494072f2a9daf698757bf7efe2941994073fc7cfc2b8a85f4","coverage":null,"id":"enwiki-23621-1377769198::In-text #6bcec9fa","item":"In-text #6bcec9fa","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polygon","end_line":31,"library":"mathlib","line":29,"location_key":"8da2c34ba64ed17494072f2a9daf698757bf7efe2941994073fc7cfc2b8a85f4","module":"Mathlib.Geometry.Polygon.Basic","note":"mathlib leaves the vertex type arbitrary, so the same structure covers chains in Euclidean space of every dimension and in other affine spaces too.","pair_key":"b133a45aba9dc943f741e693c6a7b3fc2219e91c338a44c4199b1df0273fd765","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Polygon : Type u_1 → ℕ → Type u_1"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.SimplePolygon.isLocallyFlat_realize_euclideanSpace","end_line":144,"library":"tauceti","line":139,"location_key":"7828b889c33a8013c1c821b78dcca111c687242615d53d4f78611357700006f8","module":"TauCeti.Geometry.Manifold.LocallyFlat.Polygon","note":null,"pair_key":"75b2e95596e1be73ac2f8b2054bf9caa8c82377a1bb84f024114cb7feab07327","path":"TauCeti/Geometry/Manifold/LocallyFlat/Polygon.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.SimplePolygon.isLocallyFlat_realize_euclideanSpace {m : ℕ} (p : TauCeti.SimplePolygon ℝ (EuclideanSpace ℝ (Fin (m + 1)))) : TauCeti.IsLocallyFlat ℝ (EuclideanSpace ℝ (Fin m)) p.realize"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4e639dc888a0c33418c15c78818ba4a9f6b2210e77892560fa5e788c8490e870","prominence":"supporting","quote":{"exact":"Some sources also consider closed polygonal chains in Euclidean space to be"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"c00ca5982a4c458c3148fe359af6e33ae40bebb7f767803dc29cff978a138e1e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #db437314","item":"In-text #db437314","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope","library":"atlas","line":73,"location_key":"3a5dda44344b8d21ebf4f725d70c8b87423c576d5d14779476866bc9df1859e2","module":"WantedExt.Geometry.PlatonicClassificationWanted","note":null,"pair_key":"e14bec05f61e7f5c04cb0b66d7d3bdd746393e6a14c77c1260efc4511757c55e","path":"WantedExt/Geometry/PlatonicClassificationWanted.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"structure MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope : ℕ → Type"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"31fe27c6262fa297a6fcdada305f14878742d228e32018cf5b3d6e38cc431a78","prominence":"supporting","quote":{"exact":"A polygon is a 2-dimensional example of the more general polytope in"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A polygon is a 2-dimensional example of the more general polytope in any number of dimensions.","segments":[{"text":"A polygon is a 2-dimensional example of the more general polytope in any number of dimensions."}]},"unresolved":null},{"absence":null,"basis":"aeb675bf752c190352a8f9e0ba5bcb04fb9340442fda82c0fc72b8dee9032951","coverage":null,"id":"enwiki-23621-1377769198::In-text #fd6f88dd","item":"In-text #fd6f88dd","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"EuclideanGeometry.IsConvexPolygon","library":"atlas","line":148,"location_key":"aeb675bf752c190352a8f9e0ba5bcb04fb9340442fda82c0fc72b8dee9032951","module":"MathlibExt.Geometry.TwoD","note":"Lean cuts out the convex polygons through the turning of a cyclically ordered family of corners in any oriented real plane, where the bullet reads convexity off how often a line meets the boundary.","pair_key":"fbd1fa81c6ffbe8ec4d3e854458c27757c069ddce48b12dc8aa6588340e02418","path":"MathlibExt/Geometry/TwoD.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"EuclideanGeometry.IsConvexPolygon","end_line":154,"library":"formal-conjectures","line":153,"location_key":"02897f4bfae25082c9546bbbd7a31548f251c3b64c2788bc8a8c6e14cdb52b40","module":"FormalConjecturesForMathlib.Geometry.«2d»","note":"A second copy of the same definition in another library of this universe, with the opposite sign convention on the oriented angles, again over any oriented real plane.","pair_key":"87fb3b3e646bcf101af0ce2725d9e60c55ee50a006c153947ea1f90e4f03cfef","path":"FormalConjecturesForMathlib/Geometry/2d.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"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"},"statement":true},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.UpperHalfPlane.ConvexPolygon","end_line":96,"library":"tauceti","line":87,"location_key":"e27d34192217f926116527bcf1ca12c0434e76844e36b6598352a561bbfc5656","module":"TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex","note":null,"pair_key":"fb4e423c506b0579a5f4ce69b9986d0e8c1ea83f50365b67ca9a122dade57a1e","path":"TauCeti/Analysis/Complex/UpperHalfPlane/Polygon/Convex.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"structure TauCeti.UpperHalfPlane.ConvexPolygon (n : ℕ) [NeZero n]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Convex","end_line":54,"library":"mathlib","line":53,"location_key":"fd72b17ed04b66fd1bfc6647a91baccc795eb14b8865e12328ab356fe3ecf34c","module":"Mathlib.Analysis.Convex.Basic","note":null,"pair_key":"774329236a3dcfde31fa51f0d3d16a1e6041bc5ae8f18f7dca8aabe1a65a9cb0","path":"Mathlib/Analysis/Convex/Basic.lean","proof_status":"definition","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Convex (𝕜 : Type*) {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] : Set E → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"24100f6edd543a727c4b080f1467672ba2030180670e3a28e41536d8347891f4","prominence":"central","quote":{"exact":"Convex: any line drawn through the polygon (and not tangent to an"},"quote_capped":true,"section":["Classification","Convexity and intersection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"Polygons may be characterized by their convexity or type of non-convexity: ","lead_in":true,"segments":[{"text":"Polygons may be characterized by their convexity or type of non-convexity: "}]},"layer":"Convex: any line drawn through the polygon (and not tangent to an edge or corner) meets its boundary exactly twice.","segments":[{"text":"Convex: any line drawn through the polygon (and not tangent to an edge or corner) meets its boundary exactly twice."}]},"unresolved":null},{"absence":null,"basis":"2b7ad44aa4c8dfe79c416eab52538ebdc6317df7980facc3bfc28c09e8ea945e","coverage":null,"id":"enwiki-23621-1377769198::In-text #8882bfae","item":"In-text #8882bfae","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.UpperHalfPlane.CompactConvexPolygon.interiorAngle_lt_pi","end_line":201,"library":"tauceti","line":200,"location_key":"2b7ad44aa4c8dfe79c416eab52538ebdc6317df7980facc3bfc28c09e8ea945e","module":"TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Basic","note":"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.","pair_key":"c1db144899bf02caca5550ecf2977db9eacfc16a5d6e393cc6901386891098a7","path":"TauCeti/Analysis/Complex/UpperHalfPlane/Polygon/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.UpperHalfPlane.CompactConvexPolygon.interiorAngle_lt_pi {n : ℕ} [NeZero n] (P : TauCeti.UpperHalfPlane.CompactConvexPolygon n) (i : Fin n) : P.interiorAngle i < π"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle_lt_pi","end_line":348,"library":"tauceti","line":336,"location_key":"1fb17b24ac91b174f6d5262e62608dbe7f405fb1fcb987c680b6529aedce469a","module":"TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex","note":"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.","pair_key":"8b1cc23c9aab35ac09363ad4e9316a1cc620a41bd47c62f108ef71189ffabf63","path":"TauCeti/Analysis/Complex/UpperHalfPlane/Polygon/Convex.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle_lt_pi {n : ℕ} [NeZero n] (P : TauCeti.UpperHalfPlane.ConvexPolygon n) (i : Fin n) : P.interiorAngle i < π"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"da141ebd2d083f1bf3dbc631b1cc78c05709efd8d5e616acaceadd7d25bdd987","prominence":"supporting","quote":{"exact":"As a consequence, all its interior angles are less than 180°."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"As a consequence, all its interior angles are less than 180°.","segments":[{"text":"As a consequence, all its interior angles are less than 180°."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"84fb5333202917d71d37554f7f5319adc45ebd488d9bcd99017b8b0785651827"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #634e7fb9","item":"In-text #634e7fb9","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"convex_iff_segment_subset","end_line":62,"library":"mathlib","line":61,"location_key":"c2c350b090a1a83227be1254337c5fc3fab1999ed152cf75ea137e5cb9cec4fe","module":"Mathlib.Analysis.Convex.Basic","note":null,"pair_key":"07dba7b6df855b2956b571e5f7378b2eed264f5771ed29dd33d88981eaa9bbe6","path":"Mathlib/Analysis/Convex/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"76b58a148ef426efeaa60d4e2dc657aa8a131eb2067b7ab36c7778f019f122ce","prominence":"supporting","quote":{"exact":"Equivalently, any line segment with endpoints on the boundary passes through only"},"quote_capped":true,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Equivalently, any line segment with endpoints on the boundary passes through only interior points between its endpoints.","segments":[{"text":"Equivalently, any line segment with endpoints on the boundary passes through only interior points between its endpoints."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"f4ef59ae13d9708784bb0de573b194a802c66c6a3045b58343cd2f6f112f90b0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #76864e21","item":"In-text #76864e21","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.UpperHalfPlane.ConvexPolygon.geodesicSegment_subset_carrier","end_line":182,"library":"tauceti","line":177,"location_key":"8586cc444909f6a9824c96ef51256e855c76cc0e4cf233695234809d74cb9ae9","module":"TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex","note":null,"pair_key":"674019fbcd97ec2798872847fb7c3fea975f47ffc380645c7410835e8ce4ec79","path":"TauCeti/Analysis/Complex/UpperHalfPlane/Polygon/Convex.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fca3927e85e650f4503dbf299aae733e7cbbcd2b76cc074637ef4e67d811f76a","prominence":"supporting","quote":{"exact":"This condition is true for polygons in any geometry, not just Euclidean."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"This condition is true for polygons in any geometry, not just Euclidean.","segments":[{"text":"This condition is true for polygons in any geometry, not just Euclidean."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"b093ed1834c5c48937d029653e8801ecb0ff194aaaaf445ec7297b42a3b6124e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #1181ea80","item":"In-text #1181ea80","kind":"definition","locations":[{"challenge":"downgraded","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"EuclideanGeometry.IsConvexPolygon","library":"atlas","line":148,"location_key":"9079fbbe33302242d1e3c33e623fec4dfc30956fedb4d1b673e1de3ba57486a9","module":"MathlibExt.Geometry.TwoD","note":"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).","pair_key":"3b0718a9f741e6c2eb5cfd44e8d4a90852be0fab644771eb673fab30db443abd","path":"MathlibExt/Geometry/TwoD.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":true},{"challenge":"downgraded","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"EuclideanGeometry.IsConvexPolygon","end_line":154,"library":"formal-conjectures","line":153,"location_key":"c39c1f90cda1b29690ba87291f1595cdc39a66dbe1114fd834acdd91ca400c86","module":"FormalConjecturesForMathlib.Geometry.«2d»","note":"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.","pair_key":"f393c37b12da3cb8d3f252b5e939a3916be524e3e3e90b95de207b43771893c3","path":"FormalConjecturesForMathlib/Geometry/2d.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"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"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Convex","end_line":54,"library":"mathlib","line":53,"location_key":"d5945882c098e1f6ef23d727e22b15468b598dfc34b3a43f90f98fac3431aaf9","module":"Mathlib.Analysis.Convex.Basic","note":"Convexity of an arbitrary set of points, with no polygon, no corners and no count of how often a line meets a boundary.","pair_key":"8d74b8fa35044f17cec21d0318044e357d9db91f2d3c6921f045597b9eb3d8cd","path":"Mathlib/Analysis/Convex/Basic.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Convex (𝕜 : Type*) {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] : Set E → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a94502e02927f047abd3b6db89b2fc972aa43b887b7067acff4981022696f275","prominence":"central","quote":{"exact":"Non-convex: a line may be found which meets its boundary more than"},"quote_capped":true,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Non-convex: a line may be found which meets its boundary more than twice.","segments":[{"text":"Non-convex: a line may be found which meets its boundary more than twice."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"a1f8831a8bf364fe122409a9399bbd00dd9bd51979c41245e65f76ff76208802"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #6643a7c7","item":"In-text #6643a7c7","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"convex_iff_segment_subset","end_line":62,"library":"mathlib","line":61,"location_key":"358939cac41170812e7e761c32758a045f27faae023d6a683b3e687a3eed4ece","module":"Mathlib.Analysis.Convex.Basic","note":"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.","pair_key":"7dc6c6d882e6e7fbe75ef7a03b125e5b758c87ccee423422ea412460335055d5","path":"Mathlib/Analysis/Convex/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"EuclideanGeometry.IsConvexPolygon","library":"atlas","line":148,"location_key":"28829b723afdf7bf195c37530509208dcb7b55086bb885b1a93bbfbe12ba99c5","module":"MathlibExt.Geometry.TwoD","note":"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).","pair_key":"1ce4e65c3d85f53983731cc7769fd886485476ec0c031ba2790700a7a570bc2e","path":"MathlibExt/Geometry/TwoD.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e9606f01de243847493f77eb4f7470495a8e0f739d1953c875bed9c9bd6d261b","prominence":"supporting","quote":{"exact":"Equivalently, there exists a line segment between two boundary points that passes"},"quote_capped":true,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Equivalently, there exists a line segment between two boundary points that passes outside the polygon.","segments":[{"text":"Equivalently, there exists a line segment between two boundary points that passes outside the polygon."}]},"unresolved":null},{"absence":null,"basis":"29b90518c14fa47163fbf1f4d16867d9d9cfac77534cb1094914c6fa38de33a3","coverage":null,"id":"enwiki-23621-1377769198::In-text #9a83a72f","item":"In-text #9a83a72f","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple","library":"atlas","line":78,"location_key":"29b90518c14fa47163fbf1f4d16867d9d9cfac77534cb1094914c6fa38de33a3","module":"WantedExt.Geometry.PicksTheoremWanted","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.","pair_key":"a60df01a0c6f9cd6f15d19ab51fb52c0c76af735d8fd32ea59646757f3d9a6d6","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple {n : ℕ} : Polygon (ℝ × ℝ) n → Prop"},"statement":true},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"91feb8e690bed2c249f58542090fc569ed7cae5941d61fb217b8700ac5e3d8f4","module":"TauCeti.Geometry.Polygon.Simple","note":"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.","pair_key":"b1234a837630333748df12e53bf1d669e016728e731e1653f812ab8e9ca7c992","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.SimplePolygon","end_line":558,"library":"tauceti","line":550,"location_key":"090ba98b7599c6da2a462fbaf9f5a2409b77de108f8d8c2bbd008837b780fa91","module":"TauCeti.Geometry.Polygon.Simple","note":"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).","pair_key":"35df4917b12378247ed7d9b3953c8f6f0237c30d51ddb770d3654bcac696f05a","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":3,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"structure TauCeti.SimplePolygon (R : Type*) {V : Type*} (P : Type*) [Ring R] [PartialOrder R] [ZeroLEOneClass R] [AddCommGroup V] [_root_.Module R V] [AddTorsor V P]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d69fbf1d7fd992b8990fcfeb64bd768b673a591d318176631b9becf80e72b339","prominence":"central","quote":{"exact":"Simple: the boundary of the polygon does not cross itself."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Simple: the boundary of the polygon does not cross itself.","segments":[{"text":"Simple: the boundary of the polygon does not cross itself."}]},"unresolved":null},{"absence":null,"basis":"bb9276f0e84308c58721d0743a1e0d966455edba57695f279282ed36802ceedf","coverage":null,"id":"enwiki-23621-1377769198::In-text #12f57672","item":"In-text #12f57672","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Affine.Triangle.toPolygon_isSimple","end_line":540,"library":"tauceti","line":524,"location_key":"bb9276f0e84308c58721d0743a1e0d966455edba57695f279282ed36802ceedf","module":"TauCeti.Geometry.Polygon.Simple","note":"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.","pair_key":"5301e4bf184033d4db6b770840294c1fb4a2b9df80d848b09906988bc959ce3f","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"EuclideanGeometry.isConvexPolygon_triangle","library":"atlas","line":183,"location_key":"b216372d7f23b19311535f508defe2977879a644fda623d0dad6dfe7cc1eca76","module":"MathlibExt.Geometry.TwoD","note":"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.","pair_key":"041b3a6703f4e4ab22f77255f2bdcc56c49b5e4f819d7efa4d319b313948a1cf","path":"MathlibExt/Geometry/TwoD.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"53947f04a199a9a20d551b2b85dba67d3a077191e817fc141bca3fa9ab970ad4","prominence":"supporting","quote":{"exact":"All convex polygons are simple."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"All convex polygons are simple.","segments":[{"text":"All convex polygons are simple."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"6fa14271373e41c6d8b96c54fe5827adcef5ba556bb99e2b7166800dae75513c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #2c7c732d","item":"In-text #2c7c732d","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"0efc12df56b9601e96140b97f7d1003f162b2e664378a789984aaee0fabfc563","module":"TauCeti.Geometry.Polygon.Simple","note":"It names simplicity alone; the class this bullet defines also requires failure of convexity, and no declaration of the universe carries both conditions.","pair_key":"c184938ec6525dc380d87bcf63756fce12b74402e15ff8ec82cb5ae18e5af659","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"EuclideanGeometry.IsConvexPolygon","library":"atlas","line":148,"location_key":"4f601ba3ab0e119c7f0faf173e65414edd3062a0695ed5a0a3e7cdb233551430","module":"MathlibExt.Geometry.TwoD","note":"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.","pair_key":"a096abfdb90bef7e46a30b513db1e25b952874ee52fe86fabb78b02ae1ec3177","path":"MathlibExt/Geometry/TwoD.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"919af0a34790d0fc3a783500b64d7c79ca35a12422919f7b6003e991fd5a4126","prominence":"central","quote":{"exact":"Concave: Non-convex and simple."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Concave: Non-convex and simple.","segments":[{"text":"Concave: Non-convex and simple."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"a5651b07a21a8e9c8539bc08e3cc8bd4248dd04b1c3a4ff3c48ccd773880c077"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #e486a7d2","item":"In-text #e486a7d2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e7eac0f3b3d01295f1c970c718b73bc1fd6450da018f0b2f75e336a82d423000","prominence":"supporting","quote":{"exact":"There is at least one interior angle greater than 180°."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"There is at least one interior angle greater than 180°.","segments":[{"text":"There is at least one interior angle greater than 180°."}]},"unresolved":null},{"absence":null,"basis":"2bd7f5ac9780656e20362ecab3e3f1f5d106e985854d029b7bfd04c9dd095532","coverage":null,"id":"enwiki-23621-1377769198::In-text #c583230e","item":"In-text #c583230e","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"StarConvex","end_line":71,"library":"mathlib","line":69,"location_key":"2bd7f5ac9780656e20362ecab3e3f1f5d106e985854d029b7bfd04c9dd095532","module":"Mathlib.Analysis.Convex.Star","note":"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).","pair_key":"1677c9359d5f525ca29d290ebd0f7389f50bbf9c3c3d991b4ab89e18728f8268","path":"Mathlib/Analysis/Convex/Star.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def StarConvex (𝕜 : Type*) {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] : E → Set E → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Convexity.IsStarConvexSet","end_line":50,"library":"mathlib","line":49,"location_key":"6a5237ac296d3dd0cd1fe6713128f8126e8d1ec1f2cb9678004696c8bcd50e4e","module":"Mathlib.Geometry.Convex.Star","note":"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).","pair_key":"f068381b17057616b9816b8d592a0653f3f29bcd594bd1a9b9f73ae4582762e0","path":"Mathlib/Geometry/Convex/Star.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Convexity.IsStarConvexSet (R : Type*) {X : Type*} [Semiring R] [PartialOrder R] [IsStrictOrderedRing R] [Convexity.ConvexSpace R X] : X → Set X → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"IsVisible","end_line":47,"library":"mathlib","line":47,"location_key":"876e1dca68fa142395cb1ea813bbe9b28bfa41b5b34645b0fa5230183abe4998","module":"Mathlib.Analysis.Convex.Visible","note":"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.","pair_key":"702a774d7229fe48bebb1be65b0ba866909684b9dd032a317ace1eae8a4d50e6","path":"Mathlib/Analysis/Convex/Visible.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def IsVisible (𝕜 : Type*) {V : Type*} {P : Type*} [Field 𝕜] [LinearOrder 𝕜] [AddCommGroup V] [_root_.Module 𝕜 V] [AddTorsor V P] : Set P → P → P → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6c2c968411f0afdd8d9ee2160a79b77e4f29ed77767e192963e6d0226043c1ae","prominence":"central","quote":{"exact":"Star-shaped: the whole interior is visible from at least one point, without"},"quote_capped":true,"section":["Classification","Convexity and intersection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Star-shaped: the whole interior is visible from at least one point, without crossing any edge.","segments":[{"text":"Star-shaped: the whole interior is visible from at least one point, without crossing any edge."}]},"unresolved":null},{"absence":null,"basis":"22bdb8be9958c7e6bdbdfa20baff7d760d7fd652bd63f5032a90532f2ccfe835","coverage":null,"id":"enwiki-23621-1377769198::In-text #87381e00","item":"In-text #87381e00","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Affine.Triangle.toPolygon_isSimple","end_line":540,"library":"tauceti","line":524,"location_key":"22bdb8be9958c7e6bdbdfa20baff7d760d7fd652bd63f5032a90532f2ccfe835","module":"TauCeti.Geometry.Polygon.Simple","note":"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.","pair_key":"1f44a80f6a5954f8b44877d90de0fa5105c4b97123890d8bd9d925110b74840b","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"EuclideanGeometry.isConvexPolygon_triangle","library":"atlas","line":183,"location_key":"00d3162033bbef459e6f10af2b7e902a9ca9e5d11a0a07c2efd56fc9e33bb1e2","module":"MathlibExt.Geometry.TwoD","note":"It gives one convex example but says nothing about the whole class the second conjunct describes, nor about simplicity.","pair_key":"a0203cc6c974f97bf7133d60e7313cf221a5b8a2ab9739c42d0aa3d978309dea","path":"MathlibExt/Geometry/TwoD.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f07ed9de710c1bfb73b5f706e5d5f8f558e9ccc8486336cda547bf62c7648c4e","prominence":"supporting","quote":{"exact":"The polygon must be simple, and may be convex or concave."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The polygon must be simple, and may be convex or concave.","segments":[{"text":"The polygon must be simple, and may be convex or concave."}]},"unresolved":null},{"absence":null,"basis":"d34b086ff8294730add4ce8f5832a97b0499bb6f76ecacc012526f906b22ba02","coverage":null,"id":"enwiki-23621-1377769198::In-text #1ed97fc6","item":"In-text #1ed97fc6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Convex.starConvex","end_line":59,"library":"mathlib","line":58,"location_key":"d34b086ff8294730add4ce8f5832a97b0499bb6f76ecacc012526f906b22ba02","module":"Mathlib.Analysis.Convex.Basic","note":"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.","pair_key":"a2fd6df8021c2e4cf4eeb8f2520b7eef80904aa20e5d245612e89d4fb586b4f5","path":"Mathlib/Analysis/Convex/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Convex.starConvex {𝕜 : Type*} {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] {s : Set E} {x : E} : Convex 𝕜 s → x ∈ s → StarConvex 𝕜 x s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Convexity.IsConvexSet.isStarConvexSet","end_line":93,"library":"mathlib","line":92,"location_key":"0336f603c275343a01b58054fe0b999aee2dd7dd25025d40f1af7bbf2f934c02","module":"Mathlib.Geometry.Convex.Star","note":"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.","pair_key":"1a47e9350c221add3df8f23404bca3eed963729df0a3c307e0d63c85a7620479","path":"Mathlib/Geometry/Convex/Star.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsVisible","end_line":47,"library":"mathlib","line":47,"location_key":"9f750fa0dc450f463c6ba0bef51611ebd13d8c3da4275375e89f1ebe472bf103","module":"Mathlib.Analysis.Convex.Visible","note":"Mathlib defines when two points see each other through a set, with nothing said about convex figures being seen from a single point.","pair_key":"7732078446154426beea22ed2dcb06a49a9daba7afd4ad08887e90b079efbd56","path":"Mathlib/Analysis/Convex/Visible.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def IsVisible (𝕜 : Type*) {V : Type*} {P : Type*} [Field 𝕜] [LinearOrder 𝕜] [AddCommGroup V] [_root_.Module 𝕜 V] [AddTorsor V P] : Set P → P → P → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"28c4e472c70a0e3732dd3998026ccf2cd00b3caabca15b0b828b917ae5b32850","prominence":"supporting","quote":{"exact":"All convex polygons are star-shaped."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"All convex polygons are star-shaped.","segments":[{"text":"All convex polygons are star-shaped."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"bd0ac37890b9668d1a7de59574ad64e9471d297b434d4bd9b99d4d143ae1f662"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #c84a2459","item":"In-text #c84a2459","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"f5520aac9d2ab83cb3d82c754b15037b10077809b0a9b89720b56e32642dd966","module":"TauCeti.Geometry.Polygon.Simple","note":"TauCeti defines the opposite property, a polygon whose distinct edges meet only when they are consecutive and then only at the vertex they share.","pair_key":"4df932b0829df9e55923067bdf5c119d2ad1e7e09f7e84b84f650712fbb0b82b","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"529d4ec447394f6ff03eb8357ef3c777585b56b2b6867790b58747d983603570","prominence":"central","quote":{"exact":"Self-intersecting: the boundary of the polygon crosses itself."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Self-intersecting: the boundary of the polygon crosses itself.","segments":[{"text":"Self-intersecting: the boundary of the polygon crosses itself."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"4fc6ea51574fe254897c503c78b629e9f060ef18c981ac5a76dbc1fc9d2a9b4f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #1f1513f0","item":"In-text #1f1513f0","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"78f866fa644ab047a549bacb08010653fb131462f359cf00ab4f28c85b2b7537","prominence":"central","quote":{"exact":"Star polygon: a polygon which self-intersects in a regular way."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Star polygon: a polygon which self-intersects in a regular way.","segments":[{"text":"Star polygon: a polygon which self-intersects in a regular way."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"256cdd4c0c9fc297f18f92a46bf8f4cc72092302a135da09430ab5a200fbe654"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #889ae53a","item":"In-text #889ae53a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a90d937312e6ec2cd56e7351728f163ef4c2ccea29162e1ff9ba0e5748d66a20","prominence":"supporting","quote":{"exact":"A polygon cannot be both a star and star-shaped."},"quote_capped":false,"section":["Classification","Convexity and intersection"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A polygon cannot be both a star and star-shaped.","segments":[{"text":"A polygon cannot be both a star and star-shaped."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"b558b3e68db1274b11c2891b0dabf52613b1410105fcd6999ef757a8c2f08897"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #4cccde83","item":"In-text #4cccde83","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle","end_line":291,"library":"tauceti","line":290,"location_key":"55e7557bbd3b9d5593f55984fdf428f4016fb65b86e692f4b611236cb90fcf1d","module":"TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Convex","note":"TauCeti measures the angle at each corner of a hyperbolic convex polygon, without any condition that those angles agree.","pair_key":"4b15ee52568fb9820a0d0131ca8da8158ea23408c6ea43c5648857781feaa087","path":"TauCeti/Analysis/Complex/UpperHalfPlane/Polygon/Convex.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.UpperHalfPlane.ConvexPolygon.interiorAngle {n : ℕ} [NeZero n] : TauCeti.UpperHalfPlane.ConvexPolygon n → Fin n → ℝ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"534803f367ba328b9d00de7292e36a2616a0928bb2b2fa162944fdf4dd0e13a2","prominence":"central","quote":{"exact":"Equiangular: all corner angles are equal."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Equiangular: all corner angles are equal.","segments":[{"text":"Equiangular: all corner angles are equal."}]},"unresolved":null},{"absence":null,"basis":"3d4fba02428672d7d25372156d78df96dab0445b1b43eb11d356a126dddc637b","coverage":null,"id":"enwiki-23621-1377769198::In-text #920a13bf","item":"In-text #920a13bf","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos755.IsEquilateralTriangle","end_line":43,"library":"formal-conjectures","line":41,"location_key":"3d4fba02428672d7d25372156d78df96dab0445b1b43eb11d356a126dddc637b","module":"FormalConjectures.ErdosProblems.«755»","note":"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.","pair_key":"37f3a448fe966c98bab13f5932914ecb7c51d4a079a0b167889da80ca6100f1e","path":"FormalConjectures/ErdosProblems/755.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos755.IsEquilateralTriangle {d : ℕ} : ℝ → Finset (EuclideanSpace ℝ (Fin d)) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Affine.Simplex.Equilateral","end_line":84,"library":"mathlib","line":83,"location_key":"8815aba2498ad5f080615d4b9affc4088cdba2bd96adb1f41a66778b20e7a18e","module":"Mathlib.Analysis.Normed.Affine.Simplex","note":"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.","pair_key":"667e8a95e89bcbaea2cc1d2b154c7175f772dac61cf743ab9eda6f4389cb6eef","path":"Mathlib/Analysis/Normed/Affine/Simplex.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"64e1175f7765c4070bc0ee517fd382181e88d0ce5a321a34e240871399aae4a6","prominence":"central","quote":{"exact":"Equilateral: all edges are of the same length."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Equilateral: all edges are of the same length.","segments":[{"text":"Equilateral: all edges are of the same length."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"08ac64393a3c0c28cc96b58d5d5683f7074905bf4d0b10ff9bfbeb7a2e297597"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #0a98416f","item":"In-text #0a98416f","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos958.IsEquidistantOnCircle","end_line":47,"library":"formal-conjectures","line":44,"location_key":"2219db9d62ed9acf5b0d8c2ef0197d5d0da49e48edb3277ad306d22627c22e3a","module":"FormalConjectures.ErdosProblems.«958»","note":"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.","pair_key":"bb85e1c5bf1b4302e9fc08a7b3610094e00f7832b39f1bbd7e34bb7efee6dfe8","path":"FormalConjectures/ErdosProblems/958.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos958.IsEquidistantOnCircle : Finset (EuclideanSpace ℝ (Fin 2)) → Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"cafd4263e7c5c42000f078c145bfe685da59ccbc5f436b7299f93287ef480422","module":"FormalConjectures.ErdosProblems.«94»","note":"It constructs the corner set of one figure, the regular one inscribed in the unit circle, for each number of corners.","pair_key":"e68720882380eef735ee4016272ea5fe69e0d69cb9664fe3a9c79c90dafc1072","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos94.regularNGon : ℕ → Finset (EuclideanSpace ℝ (Fin 2))"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"032e6bac60f7d7bd96e126c345ff4e45a807dbb457ed155d2514fc7519941f8b","prominence":"central","quote":{"exact":"Regular: both equilateral and equiangular."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Regular: both equilateral and equiangular.","segments":[{"text":"Regular: both equilateral and equiangular."}]},"unresolved":null},{"absence":null,"basis":"bdc4ae10638903714780590021bea42bbe225d5c0fe6e1e72d95b702297f704d","coverage":null,"id":"enwiki-23621-1377769198::In-text #a36a9942","item":"In-text #a36a9942","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanGeometry.Concyclic","end_line":239,"library":"mathlib","line":237,"location_key":"bdc4ae10638903714780590021bea42bbe225d5c0fe6e1e72d95b702297f704d","module":"Mathlib.Geometry.Euclidean.Sphere.Basic","note":"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.","pair_key":"9c000509fedf3a80203ce17b0ce760d8e1a3153e9c333c056104c25be6650389","path":"Mathlib/Geometry/Euclidean/Sphere/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure EuclideanGeometry.Concyclic {V : Type*} {P : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] : Set P → Prop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanGeometry.Cospherical","end_line":151,"library":"mathlib","line":150,"location_key":"fe3f3f4535dff9b5e8308f7722ed9b3d314717307f8113f7a63c889a29b9e723","module":"Mathlib.Geometry.Euclidean.Sphere.Basic","note":"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.","pair_key":"7e5792de9234fe5859911a2728a15213f91b8d7a7c851418686a477d50986859","path":"Mathlib/Geometry/Euclidean/Sphere/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def EuclideanGeometry.Cospherical {P : Type*} [MetricSpace P] : Set P → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6f31505afa647f6fce7f48d2fb175351acafe7fdc5b0fdde1ad09bea9251028c","prominence":"central","quote":{"exact":"Cyclic: all corners lie on a single circle, called the circumcircle."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Cyclic: all corners lie on a single circle, called the circumcircle.","segments":[{"text":"Cyclic: all corners lie on a single circle, called the circumcircle."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"ac49a4a4cca383059d3844d85afaeb48d2b88ee23a9cddcb21f9f9dfb8d59882"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #2890d4d7","item":"In-text #2890d4d7","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"159b1db8668fd6ad72fad7a2da99ea76ebbf6effd5ea61f9b51d009ae82a968b","prominence":"central","quote":{"exact":"Tangential: all sides are tangent to an inscribed circle."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Tangential: all sides are tangent to an inscribed circle.","segments":[{"text":"Tangential: all sides are tangent to an inscribed circle."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"0b4a71531c12809b81bc6797c372af45c66ec5adc1e7769c4d006e1c306f6f9e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #1ed977e5","item":"In-text #1ed977e5","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d1d3b4b464433a2510b51332e4bedc36265c253495e5a83046b6432b33f5f0d3","prominence":"central","quote":{"exact":"Isogonal or vertex-transitive: all corners lie within the same symmetry orbit."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Isogonal or vertex-transitive: all corners lie within the same symmetry orbit.","segments":[{"text":"Isogonal or vertex-transitive: all corners lie within the same symmetry orbit."}]},"unresolved":null},{"absence":null,"basis":"2789c26eba4b22342f6a14d075a65f9d1849b6836236f99adcf6207898574f32","coverage":null,"id":"enwiki-23621-1377769198::In-text #4f0cbff2","item":"In-text #4f0cbff2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Affine.Simplex.mem_circumsphere","end_line":237,"library":"mathlib","line":235,"location_key":"2789c26eba4b22342f6a14d075a65f9d1849b6836236f99adcf6207898574f32","module":"Mathlib.Geometry.Euclidean.Circumcenter","note":"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.","pair_key":"06f90853f2e7f901e89d7457529bfd84cd39c848439253dbe8c64b945e73d615","path":"Mathlib/Geometry/Euclidean/Circumcenter.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"10e97286aecdcf9161f64ccce98f54a9520e335e8007afdd0de91989b61b8afb","prominence":"supporting","quote":{"exact":"The polygon is also cyclic and equiangular."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The polygon is also cyclic and equiangular.","segments":[{"text":"The polygon is also cyclic and equiangular."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"03f327677a0ee66f19b59260680d2949fad1172b2095838063fc0149b14dce29"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #e56786a7","item":"In-text #e56786a7","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"89270fffb11a3a48f41764acde02590728ee8089ab4b2b10ff550ee54f4e15fe","prominence":"central","quote":{"exact":"Isotoxal or edge-transitive: all sides lie within the same symmetry orbit."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Isotoxal or edge-transitive: all sides lie within the same symmetry orbit.","segments":[{"text":"Isotoxal or edge-transitive: all sides lie within the same symmetry orbit."}]},"unresolved":null},{"absence":null,"basis":"c80c5a06e7ac0e83d1e90fcedac5d136e19b5db8aa82445e4893d9c70e548c6a","coverage":null,"id":"enwiki-23621-1377769198::In-text #87503593","item":"In-text #87503593","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Affine.Simplex.isTangentAt_insphere_touchpoint","end_line":892,"library":"mathlib","line":889,"location_key":"c80c5a06e7ac0e83d1e90fcedac5d136e19b5db8aa82445e4893d9c70e548c6a","module":"Mathlib.Geometry.Euclidean.Incenter.Basic","note":"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.","pair_key":"6b19cd9efb570ebea5d7eddee918ff23f811ebc02d684aa511824e605a821c73","path":"Mathlib/Geometry/Euclidean/Incenter/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6c036592657a388f44a4c7ab08d90adf1e897ba144b1963d442df2b1f7419af1","prominence":"supporting","quote":{"exact":"The polygon is also equilateral and tangential."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The polygon is also equilateral and tangential.","segments":[{"text":"The polygon is also equilateral and tangential."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"6ace8c5c63afaf829ecbfe246be740600cc61cf55af9410bc098bba655876bf2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #c94ba7b2","item":"In-text #c94ba7b2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e74fbbbcd7b6057a570ebb0633a161f40953018b4aae728097153194a8e88671","prominence":"central","quote":{"exact":"The property of regularity may be defined in other ways: a polygon"},"quote_capped":true,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"a3ff3d115028ce06657c1b5e126ea9e9ab9e554e04f478379496d1253f0deecf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #a984adb9","item":"In-text #a984adb9","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e8be7af97fc14d0e7e5f879b0d2fc29262119b7a6ff3627df9c9c7b52cf1aedd","prominence":"central","quote":{"exact":"A non-convex regular polygon is called a regular star polygon."},"quote_capped":false,"section":["Classification","Equality and symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A non-convex regular polygon is called a regular star polygon.","segments":[{"text":"A non-convex regular polygon is called a regular star polygon."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"620686630fd46de50eee5733c1ada5b992d881e010476badeeaabf8fad1956fa"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #ece38bb1","item":"In-text #ece38bb1","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bee92a9e2a4f99ffa90f222c96aea73454f0849d5588c9d8073d806d6ebfd80d","prominence":"central","quote":{"exact":"Rectilinear: the polygon's sides meet at right angles, i.e. all its interior"},"quote_capped":true,"section":["Classification","Miscellaneous"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Rectilinear: the polygon's sides meet at right angles, i.e. all its interior angles are 90 or 270 degrees.","segments":[{"text":"Rectilinear: the polygon's sides meet at right angles, i.e. all its interior angles are 90 or 270 degrees."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"a27d8f91a109c423982859b558b53569b6e4bb1ef91cddbaf747b4ee223c8ee9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #236b9a25","item":"In-text #236b9a25","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d1bee56c5d0f64f3141491a1be7fc41809fd2e53a3885cdf9a75e25016ba80e1","prominence":"central","quote":{"exact":"Monotone with respect to a given line L: every line orthogonal to"},"quote_capped":true,"section":["Classification","Miscellaneous"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Monotone with respect to a given line L: every line orthogonal to L intersects the polygon not more than twice.","segments":[{"text":"Monotone with respect to a given line L: every line orthogonal to L intersects the polygon not more than twice."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"83a5da7de8887a19efeff0cb75a1c6e99d4fe9db5fd783f0912c819272ceb34d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #d85d4226","item":"In-text #d85d4226","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1cef7e0eb82d0e9de8e578aa4a782a3e2617290fee9cb3795065e7e9933c7f7e","prominence":"supporting","quote":{"exact":"Any polygon has as many corners as it has sides."},"quote_capped":false,"section":["Properties and formulas","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Any polygon has as many corners as it has sides.","segments":[{"text":"Any polygon has as many corners as it has sides."}]},"unresolved":null},{"absence":null,"basis":"ca97836f5d476646332d46e97dcba5ca2079aac5d86d78ffdb8561a3a2e83147","coverage":null,"id":"enwiki-23621-1377769198::In-text #88bcc4b3","item":"In-text #88bcc4b3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanGeometry.angle_add_angle_add_angle_eq_pi","end_line":321,"library":"mathlib","line":314,"location_key":"ca97836f5d476646332d46e97dcba5ca2079aac5d86d78ffdb8561a3a2e83147","module":"Mathlib.Geometry.Euclidean.Triangle","note":"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.","pair_key":"00e01d2b5bebfa43bc28d780fcacef4656ed7179768f293b79f50400982fd96d","path":"Mathlib/Geometry/Euclidean/Triangle.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₂ = π"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1221b37eaf6131bca78eb0be9411367cbfc26c68778d23fbecb3c621a1f712be","prominence":"central","quote":{"exact":"Interior angle – The sum of the interior angles of a simple"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"The two most important ones are: ","lead_in":true,"segments":[{"text":"The two most important ones are: "}]},"layer":"Interior angle – The sum of the interior angles of a simple n-gon is (n − 2) × π radians or (n − 2) × 180 degrees.","segments":[{"text":"Interior angle – The sum of the interior angles of a simple n-gon is (n − 2) × π radians or (n − 2) × 180 degrees."}]},"unresolved":null},{"absence":null,"basis":"189b0f24f4fc96e4a8bdcaa63d8b912dc351303f1bf2e7ab1b7f4945dd6dc632","coverage":null,"id":"enwiki-23621-1377769198::In-text #736fd066","item":"In-text #736fd066","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanGeometry.angle_add_angle_add_angle_eq_pi","end_line":321,"library":"mathlib","line":314,"location_key":"189b0f24f4fc96e4a8bdcaa63d8b912dc351303f1bf2e7ab1b7f4945dd6dc632","module":"Mathlib.Geometry.Euclidean.Triangle","note":"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.","pair_key":"998987943991817009e6c5f53d75da3b145f75fa28baf0804299cd5c9124ad0b","path":"Mathlib/Geometry/Euclidean/Triangle.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₂ = π"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a4588b5fbbb0431ee787df9b185745a9095053f55c76b1764e96d0db04fcf1cf","prominence":"supporting","quote":{"exact":"This is because any simple n-gon ( having n sides ) can"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"fe921a358ced8b6bdf06e8a8074f33f865fc1c677b110612b9e22d54db19ce4a","coverage":null,"id":"enwiki-23621-1377769198::In-text #bc2f0b42","item":"In-text #bc2f0b42","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Affine.Simplex.Equilateral.angle_eq_pi_div_three","end_line":51,"library":"mathlib","line":37,"location_key":"fe921a358ced8b6bdf06e8a8074f33f865fc1c677b110612b9e22d54db19ce4a","module":"Mathlib.Geometry.Euclidean.Simplex","note":"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.","pair_key":"a53ce5e77bc745da5ba768b1fe62b80b3b774453b76f793737df7b3e6b87f2f5","path":"Mathlib/Geometry/Euclidean/Simplex.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bf5f359f9ff5a254427e340c6873afe48e78d59492dc45021057bebc5574a1a6","prominence":"central","quote":{"exact":"The measure of any interior angle of a convex regular n-gon is"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The measure of any interior angle of a convex regular n-gon is ( 1 − 2 n ) π {\\displaystyle \\left(1-{\\tfrac {2}{n}}\\right)\\pi } radians or 180 − 360 n {\\displaystyle 180-{\\tfrac {360}{n}}} degrees.","segments":[{"text":"The measure of any interior angle of a convex regular n-gon is "},{"tex":"\\left(1-{\\tfrac {2}{n}}\\right)\\pi"},{"text":" radians or "},{"tex":"180-{\\tfrac {360}{n}}"},{"text":" degrees."}]},"unresolved":null},{"absence":null,"basis":"73c5b864967c94116204e737aaed2ba800e7e4327217e55a8f9b8df2b1a9a492","coverage":null,"id":"enwiki-23621-1377769198::In-text #8fcfba70","item":"In-text #8fcfba70","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Affine.Simplex.Equilateral.angle_eq_pi_div_three","end_line":51,"library":"mathlib","line":37,"location_key":"73c5b864967c94116204e737aaed2ba800e7e4327217e55a8f9b8df2b1a9a492","module":"Mathlib.Geometry.Euclidean.Simplex","note":"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.","pair_key":"7a2a2e5f784bc585b0f1729dfc86fa56f205d0e5db1dec94a6bb44637af215a6","path":"Mathlib/Geometry/Euclidean/Simplex.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"28267705e338cda148f2a867e26571e46f90bc4f7b8b85e69cc5ef4c854dfa45","prominence":"central","quote":{"exact":"for a regular p q {\\displaystyle {\\tfrac {p}{q}}} -gon (a p-gon with"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"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: ","segments":[{"text":"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: "}]},"layer":"for a regular p q {\\displaystyle {\\tfrac {p}{q}}} -gon (a p-gon with central density q), each interior angle is π ( p − 2 q ) p {\\displaystyle {\\tfrac {\\pi (p-2q)}{p}}} radians or 180 ( p − 2 q ) p {\\displaystyle {\\tfrac {180(p-2q)}{p}}} degrees.","segments":[{"text":"for a regular "},{"tex":"\\tfrac {p}{q}"},{"text":" -gon (a p-gon with central density q), each interior angle is "},{"tex":"\\tfrac {\\pi (p-2q)}{p}"},{"text":" radians or "},{"tex":"\\tfrac {180(p-2q)}{p}"},{"text":" degrees."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"13e6504d88760bd4c69eb50921ee09b37b7840682fde29498209ea0503aace88"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #8b217639","item":"In-text #8b217639","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d4bd2dbbc91c9ad0246a591b4681677d6177bfc7e78f0aa38176fadfba93edc3","prominence":"central","quote":{"exact":"Exterior angle – The exterior angle is the supplementary angle to the"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Exterior angle – The exterior angle is the supplementary angle to the interior angle.","segments":[{"text":"Exterior angle – The exterior angle is the supplementary angle to the interior angle."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"f7c91219a94a3f4db19073844dd7305c460ad9414b1fce9e0f8cd5387e8e9ebf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #084198f1","item":"In-text #084198f1","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"07337a52c237aaa48ca5855ce253c314227f8d7fce7c573ab0ee90887e510065","prominence":"supporting","quote":{"exact":"Tracing around a convex n-gon, the angle \"turned\" at a corner is"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Tracing around a convex n-gon, the angle \"turned\" at a corner is the exterior or external angle.","segments":[{"text":"Tracing around a convex n-gon, the angle \"turned\" at a corner is the exterior or external angle."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"fd4f3d0462c5cfb5ee72b29876b3af76049ffdeb0578350191ca07516c8ad032"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #230276ce","item":"In-text #230276ce","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.hopf_umlaufsatz","library":"atlas","line":96,"location_key":"af30018fca55a92e6f512339998d28899a73d12e60ca4dc07fc7038d0c395e12","module":"WantedExt.Geometry.HopfUmlaufsatzWanted","note":"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.","pair_key":"3149e551b9a32c1bc0afbdde38b8784383e9fcefb2d0e496604a5313af56c3a2","path":"WantedExt/Geometry/HopfUmlaufsatzWanted.lean","proof_status":"wanted","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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 * π"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a634b14ca7dbb16393b630cd003849f090f3bf6f9587cfcb68ec76ac592a9efa","prominence":"supporting","quote":{"exact":"Tracing all the way around the polygon makes one full turn"},"quote_capped":false,"section":["Properties and formulas","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":", so the sum of the exterior angles must be 360°.","segments":[{"text":", so the sum of the exterior angles must be 360°."}]},"layer":"Tracing all the way around the polygon makes one full turn","segments":[{"text":"Tracing all the way around the polygon makes one full turn"}]},"unresolved":null},{"absence":null,"basis":"1d21be6fd08056ccb5d4a548e12a2f0a981dd08aebabd5ec2f42e589e531494a","coverage":null,"id":"enwiki-23621-1377769198::In-text #52fcd000","item":"In-text #52fcd000","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanGeometry.angle_add_angle_add_angle_eq_pi","end_line":321,"library":"mathlib","line":314,"location_key":"1d21be6fd08056ccb5d4a548e12a2f0a981dd08aebabd5ec2f42e589e531494a","module":"Mathlib.Geometry.Euclidean.Triangle","note":"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.","pair_key":"19007aa9b6f129fc24cf32c3d686753baa852360073e0a40bdb9353d2d868dc6","path":"Mathlib/Geometry/Euclidean/Triangle.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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₂ = π"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Geometry.HopfUmlaufsatzWanted.Geometry.HopfUmlaufsatz.hopf_umlaufsatz","library":"atlas","line":96,"location_key":"27e948c57fa408ad85e7b0e4bcf471f5a87aaeb50892ba628b1f65119a17ad55","module":"WantedExt.Geometry.HopfUmlaufsatzWanted","note":"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.","pair_key":"381fe2c3da504150a590212d37b1261afec3b2ae82a2133f0f6c43ab088492c1","path":"WantedExt/Geometry/HopfUmlaufsatzWanted.lean","proof_status":"wanted","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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 * π"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c690f1841c12a58fa3d02da0af3b61c522db99a23e34427880f4cb118dceef9f","prominence":"central","quote":{"exact":"the sum of the exterior angles must be 360°."},"quote_capped":false,"section":["Properties and formulas","Angles"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"Tracing all the way around the polygon makes one full turn, so ","segments":[{"text":"Tracing all the way around the polygon makes one full turn, so "}]},"layer":"the sum of the exterior angles must be 360°.","segments":[{"text":"the sum of the exterior angles must be 360°."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"3691d60f29d283968af9e22c0f584c04f477b5788aaedd85f7785b6237800c4f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #f805fe76","item":"In-text #f805fe76","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"AbsolutelyContinuousOnInterval.exists_int_windingNumber","end_line":82,"library":"tauceti","line":74,"location_key":"2dba4f75dd5f7cdf640457340bcbc9b2af95129a9e065bbadb53ebcf40e59ceb","module":"TauCeti.Analysis.Contour.Winding.AbsolutelyContinuous.Basic","note":"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.","pair_key":"c5fb4474b47505c272d13870b286a8d5963f8b9a3411559601f59f9fcbe1eca1","path":"TauCeti/Analysis/Contour/Winding/AbsolutelyContinuous/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"16f4a957c72ca97aba9909372ca1d53322284e672f470b9bfed2e5c88fed6b89","prominence":"central","quote":{"exact":"Tracing around an n-gon in general, the sum of the exterior angles"},"quote_capped":true,"section":["Properties and formulas","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"838c3e484bff67ea3ad2fca6fdb5efdf7975029ab37029c37266bcb614ec8ea1","coverage":null,"id":"enwiki-23621-1377769198::In-text #253cffd9","item":"In-text #253cffd9","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polygon","end_line":31,"library":"mathlib","line":29,"location_key":"838c3e484bff67ea3ad2fca6fdb5efdf7975029ab37029c37266bcb614ec8ea1","module":"Mathlib.Geometry.Polygon.Basic","note":"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.","pair_key":"43b479a997b6667ccfe7006049190f3c628c33d9d717a97818f5336c42bcd38b","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Polygon : Type u_1 → ℕ → Type u_1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9dafd1e9674b19b7373abaf3efc884f2d3edb9e67b94e84e7d52d162b5cb74ac","prominence":"supporting","quote":{"exact":"In this section, the vertices of the polygon under consideration are taken"},"quote_capped":true,"section":["Properties and formulas","Area"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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 ) {\\displaystyle (x_{0},y_{0}),(x_{1},y_{1}),\\ldots ,(x_{n-1},y_{n-1})} in order.","segments":[{"text":"In this section, the vertices of the polygon under consideration are taken to be "},{"tex":"(x_{0},y_{0}),(x_{1},y_{1}),\\ldots ,(x_{n-1},y_{n-1})"},{"text":" in order."}]},"unresolved":null},{"absence":null,"basis":"46081c4b63833d91dbc0b3d76d04d006620132d1061c2fb300fba4c75be7378d","coverage":null,"id":"enwiki-23621-1377769198::In-text #8de8b296","item":"In-text #8de8b296","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Fin.natCast_self","end_line":391,"library":"mathlib","line":391,"location_key":"46081c4b63833d91dbc0b3d76d04d006620132d1061c2fb300fba4c75be7378d","module":"Mathlib.Data.Fin.Basic","note":"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.","pair_key":"88f4f91cb9bd39778e10218b078698346c87d360f2c3a0402d8534ea3534cc4c","path":"Mathlib/Data/Fin/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fin.natCast_self (n : ℕ) [NeZero n] : ↑n = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"93017f26df97e958f02964cb5a5dc62ee7610ddf6c9405cc8a158832c3b18046","prominence":"supporting","quote":{"exact":"For convenience in some formulas, the notation (xn, yn) = (x0, y0)"},"quote_capped":true,"section":["Properties and formulas","Area"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"For convenience in some formulas, the notation (xn, yn) = (x0, y0) will also be used.","segments":[{"text":"For convenience in some formulas, the notation (xn, yn) = (x0, y0) will also be used."}]},"unresolved":null},{"absence":null,"basis":"ec050729f160bb4e201b33e01a7a03fb9e188514f81108e20bd515adc2b89968","coverage":null,"id":"enwiki-23621-1377769198::In-text #8307cda8","item":"In-text #8307cda8","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.curveIntegral_area_polygon","end_line":51,"library":"tauceti","line":44,"location_key":"ec050729f160bb4e201b33e01a7a03fb9e188514f81108e20bd515adc2b89968","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"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.","pair_key":"2ba3068d5b2620398ba9d60d6cbade069de6442850f13eba05aac9a197af3049","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.integral_circulationFun_area_shoelace","end_line":65,"library":"tauceti","line":54,"location_key":"a3e9e3d55ce07f1cf993b40266bb3f3b1c3511e2d37998aa1edf443bf4c6303b","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"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.","pair_key":"0fd2f112433ca53271eb7c4a6d181c5925d3a8db1a0404f3ec4452c55a7faf99","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.integral_windingWeight_shoelace","end_line":84,"library":"tauceti","line":69,"location_key":"f0de47e408208fc29c17fe3d446407308a68a51bbbd99b97765ece31cf87c88f","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"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.","pair_key":"7823f6cb408286bef72ffad86e2bff644f8af0a2384378eed5ab1a9fcfec451d","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":true,"text":"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","type":"∀ {γ : ℝ → ℂ} {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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e172ce76ae3da691bdabc307f0536402558dcaa42c80021b5a03c1e9c17d4f5e","prominence":"central","quote":{"exact":"If the polygon is non-self-intersecting (that is, simple), the signed area is"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":" or, using determinants 16 A 2 = ∑ i = 0 n − 1 ∑ j = 0 n − 1 | Q i , j Q i , j + 1 Q i + 1 , j Q i + 1 , j + 1 | , {\\displaystyle 16A^{2}=\\sum _{i=0}^{n-1}\\sum _{j=0}^{n-1}{\\begin{vmatrix}Q_{i,j}&Q_{i,j+1}\\\\Q_{i+1,j}&Q_{i+1,j+1}\\end{vmatrix}},} where Q i , j {\\displaystyle Q_{i,j}} is the squared distance between ( x i , y i ) {\\displaystyle (x_{i},y_{i})}","segments":[{"text":" or, using determinants "},{"display":true,"tex":"16A^{2}=\\sum _{i=0}^{n-1}\\sum _{j=0}^{n-1}{\\begin{vmatrix}Q_{i,j}&Q_{i,j+1}\\\\Q_{i+1,j}&Q_{i+1,j+1}\\end{vmatrix}},"},{"text":" where "},{"tex":"Q_{i,j}"},{"text":" is the squared distance between "},{"tex":"(x_{i},y_{i})"}],"trimmed":true},"layer":"If the polygon is non-self-intersecting (that is, simple), the signed area is A = 1 2 ∑ i = 0 n − 1 ( x i y i + 1 − x i + 1 y i ) where x n = x 0 and y n = y 0 , {\\displaystyle A={\\frac {1}{2}}\\sum _{i=0}^{n-1}(x_{i}y_{i+1}-x_{i+1}y_{i})\\quad {\\text{where }}x_{n}=x_{0}{\\text{ and }}y_{n}=y_{0},}","segments":[{"text":"If the polygon is non-self-intersecting (that is, simple), the signed area is "},{"display":true,"tex":"A={\\frac {1}{2}}\\sum _{i=0}^{n-1}(x_{i}y_{i+1}-x_{i+1}y_{i})\\quad {\\text{where }}x_{n}=x_{0}{\\text{ and }}y_{n}=y_{0},"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"e317f2dc36aaa80b86a82da33791e0e5610371bd476a41ee6237b0a615cf1ba2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #b6be334c","item":"In-text #b6be334c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cb8d5a8aa5cd3bb973a65fef56aba8bb1382c201c5b6fe9b9ea362bd6f632261","prominence":"supporting","quote":{"exact":"or, using determinants 16 A 2 = ∑ i = 0 n"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"If the polygon is non-self-intersecting (that is, simple), the signed area is A = 1 2 ∑ i = 0 n − 1 ( x i y i + 1 − x i + 1 y i ) where x n = x 0 and y n = y 0 , {\\displaystyle A={\\frac {1}{2}}\\sum _{i=0}^{n-1}(x_{i}y_{i+1}-x_{i+1}y_{i})\\quad {\\text{where }}x_{n}=x_{0}{\\text{ and }}y_{n}=y_{0},} ","segments":[{"text":"If the polygon is non-self-intersecting (that is, simple), the signed area is "},{"display":true,"tex":"A={\\frac {1}{2}}\\sum _{i=0}^{n-1}(x_{i}y_{i+1}-x_{i+1}y_{i})\\quad {\\text{where }}x_{n}=x_{0}{\\text{ and }}y_{n}=y_{0},"},{"text":" "}]},"layer":"or, using determinants 16 A 2 = ∑ i = 0 n − 1 ∑ j = 0 n − 1 | Q i , j Q i , j + 1 Q i + 1 , j Q i + 1 , j + 1 | , {\\displaystyle 16A^{2}=\\sum _{i=0}^{n-1}\\sum _{j=0}^{n-1}{\\begin{vmatrix}Q_{i,j}&Q_{i,j+1}\\\\Q_{i+1,j}&Q_{i+1,j+1}\\end{vmatrix}},} where Q i , j {\\displaystyle Q_{i,j}} is the squared distance between ( x i , y i ) {\\displaystyle (x_{i},y_{i})} and ( x j , y j ) . {\\displaystyle (x_{j},y_{j}).}","segments":[{"text":"or, using determinants "},{"display":true,"tex":"16A^{2}=\\sum _{i=0}^{n-1}\\sum _{j=0}^{n-1}{\\begin{vmatrix}Q_{i,j}&Q_{i,j+1}\\\\Q_{i+1,j}&Q_{i+1,j+1}\\end{vmatrix}},"},{"text":" where "},{"tex":"Q_{i,j}"},{"text":" is the squared distance between "},{"tex":"(x_{i},y_{i})"},{"text":" and "},{"tex":"(x_{j},y_{j})."}]},"unresolved":null},{"absence":null,"basis":"9651c0cb351e45977b7aec455ae4dee4bea8e06676432fa4f608bbb98e6309bc","coverage":null,"id":"enwiki-23621-1377769198::In-text #ab5e80fd","item":"In-text #ab5e80fd","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.signedArea_symm","end_line":59,"library":"tauceti","line":58,"location_key":"9651c0cb351e45977b7aec455ae4dee4bea8e06676432fa4f608bbb98e6309bc","module":"TauCeti.Analysis.Green.Examples.CurveArea.SignedArea","note":"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.","pair_key":"290625a25c72f0d43c23c14607391105480850adb8020d803f0f8d760a87089c","path":"TauCeti/Analysis/Green/Examples/CurveArea/SignedArea.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.signedArea_symm (γ : ℝ → ℂ) (a b : ℝ) : TauCeti.signedArea γ b a = -TauCeti.signedArea γ a b"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Orientation.areaForm_neg_orientation","end_line":118,"library":"mathlib","line":116,"location_key":"56441c88bcc5a0b59d66227311af55ab94108ba6ccc7159795f478fe03c49f22","module":"Mathlib.Analysis.InnerProductSpace.TwoDim","note":"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.","pair_key":"82f787987b9226d8f553e7f68e38e530b4ec68d451dfe09bf25f48217cc45efd","path":"Mathlib/Analysis/InnerProductSpace/TwoDim.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.triangleDet_swap","end_line":50,"library":"tauceti","line":48,"location_key":"23ba93acd0f5760c1a4035d7e5cf9c9026756f38bb614adefb679d0187d74a64","module":"TauCeti.Analysis.Green.Polygonal.Geometry","note":"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.","pair_key":"5e4cd20021ffa2c2bf725f5e16db018045b5cf7e2d23649d3caae43518bd8aad","path":"TauCeti/Analysis/Green/Polygonal/Geometry.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Green.triangleDet_swap (c p q : ℂ) : TauCeti.Green.triangleDet c q p = -TauCeti.Green.triangleDet c p q"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f39b19659c017c0491783faa238eeaa765a2a839bf2f8bf1a91d14174181410c","prominence":"supporting","quote":{"exact":"The signed area depends on the ordering of the vertices and of"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The signed area depends on the ordering of the vertices and of the orientation of the plane.","segments":[{"text":"The signed area depends on the ordering of the vertices and of the orientation of the plane."}]},"unresolved":null},{"absence":null,"basis":"4275f0c7ed9db3f6dafc0af97b4e99ad22abb13604ac45ccee11dd89b4c50645","coverage":null,"id":"enwiki-23621-1377769198::In-text #1c2e9fbe","item":"In-text #1c2e9fbe","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.orientation","end_line":25,"library":"mathlib","line":24,"location_key":"4275f0c7ed9db3f6dafc0af97b4e99ad22abb13604ac45ccee11dd89b4c50645","module":"Mathlib.LinearAlgebra.Complex.Orientation","note":"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.","pair_key":"94118fc12d8befcc26b50a8af0182188210e5ca71f62eb0bb95d82eda652d165","path":"Mathlib/LinearAlgebra/Complex/Orientation.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Complex.orientation : Orientation ℝ ℂ (Fin 2)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"31e7b91101adafa2671f1372a05285cb013a14550ea51d22633d482a9114ac27","prominence":"supporting","quote":{"exact":"Commonly, the positive orientation is defined by the (counterclockwise) rotation that maps"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Commonly, the positive orientation is defined by the (counterclockwise) rotation that maps the positive x-axis to the positive y-axis.","segments":[{"text":"Commonly, the positive orientation is defined by the (counterclockwise) rotation that maps the positive x-axis to the positive y-axis."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"b77ac1284f0ffdca4e8fe4a4d020c20e87dd356292260b3dfcab7d6e31c81bf2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #1c89ef8e","item":"In-text #1c89ef8e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"37ef7e0e545d17594181dc5b8104affb7bf2cf8c1d25fe91b31faf2cbd6ce25f","prominence":"supporting","quote":{"exact":"If the vertices are ordered counterclockwise (that is, according to positive orientation),"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"If the vertices are ordered counterclockwise (that is, according to positive orientation), the signed area is positive; otherwise, it is negative.","segments":[{"text":"If the vertices are ordered counterclockwise (that is, according to positive orientation), the signed area is positive; otherwise, it is negative."}]},"unresolved":null},{"absence":null,"basis":"88e0ab7b25e946dd06cb15c63d7f46d1e83642247808c0593ade3369877d59d4","coverage":null,"id":"enwiki-23621-1377769198::In-text #640f78eb","item":"In-text #640f78eb","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MeasureTheory.toReal_volume_convexHull_triangle","library":"atlas","line":326,"location_key":"88e0ab7b25e946dd06cb15c63d7f46d1e83642247808c0593ade3369877d59d4","module":"MathlibExt.MeasureTheory.Measure.Lebesgue.TriangleArea","note":"The declaration quantifies over three arbitrary planar points, so it covers both vertex orders and also collinear triples, where both sides vanish.","pair_key":"63c159758ce15ea6c4e8a587e1b4429c967bebcdc9cd2eed7ffe1f8ea75a6095","path":"MathlibExt/MeasureTheory/Measure/Lebesgue/TriangleArea.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e1b35825b5633c6a181424043b946e4fec58f9539bed189a79bdc4fdfb29e546","prominence":"supporting","quote":{"exact":"In either case, the area formula is correct in absolute value."},"quote_capped":false,"section":["Properties and formulas","Area","Simple polygons"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"In either case, the area formula is correct in absolute value.","segments":[{"text":"In either case, the area formula is correct in absolute value."}]},"unresolved":null},{"absence":null,"basis":"33b6f770ead8a55aed989a006e8d05e450958d4788fa6ceb39c29fe1835bf8d3","coverage":null,"id":"enwiki-23621-1377769198::In-text #453aac9f","item":"In-text #453aac9f","kind":"notation","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.curveIntegral_area_polygon","end_line":51,"library":"tauceti","line":44,"location_key":"33b6f770ead8a55aed989a006e8d05e450958d4788fa6ceb39c29fe1835bf8d3","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"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.","pair_key":"1e61229317bcf7c8a4ca7fbec0dcf5a3fd12e7e82838d509839904e125a39840","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.integral_circulationFun_area_shoelace","end_line":65,"library":"tauceti","line":54,"location_key":"d8e78da8843ae2f18f0d39a7937dfdafe73cd4b5600f391e833b98a476a18071","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"It is stated for an arbitrary piecewise linear closed path, which includes paths whose edges meet outside their endpoints.","pair_key":"58beba398144b9c0ec428c420594698e465aaa2586ecf85c8fb0212d311c2d53","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6fe4bc6ca0603b339eb043471555cc584fa7d0d4dc90e22310ac762e47795189","prominence":"central","quote":{"exact":"This is commonly called the shoelace formula or surveyor's formula."},"quote_capped":false,"section":["Properties and formulas","Area","Simple polygons"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"This is commonly called the shoelace formula or surveyor's formula.","segments":[{"text":"This is commonly called the shoelace formula or surveyor's formula."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"5b481d9bd6b7bf963b9916df6227c73937e1f23d6c453588f92d646f6427a02a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #d6f065ce","item":"In-text #d6f065ce","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"54245d3a53eda4525af7efc3a59c497d6513c6c7d90e4b13f2889b72a79d64b6","prominence":"central","quote":{"exact":"The area A of a simple polygon can also be computed if"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":" The formula was described by Lopshits in 1963.","segments":[{"text":" The formula was described by Lopshits in 1963."}]},"layer":"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 ) ] ) . {\\displaystyle {\\begin{aligned}A={\\frac {1}{2}}(a_{1}[a_{2}\\sin(\\theta _{1})+a_{3}\\sin(\\theta _{1}+\\theta _{2})+\\cdots +a_{n-1}\\sin(\\theta _{1}+\\theta _{2}+\\cdots +\\theta _{n-2})]\\\\{}+a_{2}[a_{3}\\sin(\\theta _{2})+a_{4}\\sin(\\theta _{2}+\\theta _{3})+\\cdots +a_{n-1}\\sin(\\theta _{2}+\\cdots +\\theta _{n-2})]\\\\{}+\\cdots +a_{n-2}[a_{n-1}\\sin(\\theta _{n-2})]).\\end{aligned}}}","segments":[{"text":"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: "},{"display":true,"tex":"\\begin{aligned}A={\\frac {1}{2}}(a_{1}[a_{2}\\sin(\\theta _{1})+a_{3}\\sin(\\theta _{1}+\\theta _{2})+\\cdots +a_{n-1}\\sin(\\theta _{1}+\\theta _{2}+\\cdots +\\theta _{n-2})]\\\\{}+a_{2}[a_{3}\\sin(\\theta _{2})+a_{4}\\sin(\\theta _{2}+\\theta _{3})+\\cdots +a_{n-1}\\sin(\\theta _{2}+\\cdots +\\theta _{n-2})]\\\\{}+\\cdots +a_{n-2}[a_{n-1}\\sin(\\theta _{n-2})]).\\end{aligned}"}]},"unresolved":null},{"absence":null,"basis":"2263a2b6550abd10c35cc6429397cb8c0fd2899bb6fa3cd2b28b7be98114faf9","coverage":null,"id":"enwiki-23621-1377769198::In-text #925ea390","item":"In-text #925ea390","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.pick","library":"atlas","line":96,"location_key":"2263a2b6550abd10c35cc6429397cb8c0fd2899bb6fa3cd2b28b7be98114faf9","module":"WantedExt.Geometry.PicksTheoremWanted","note":"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.","pair_key":"83e681a40a7dd575a93fee98bfd6bcd3541cb5ee98fd58e507e1d91a2ea31802","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"wanted","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":true,"text":"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) + …","type":"∀ {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"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.pick_convex_lattice_polygon","library":"atlas","line":2017,"location_key":"b53a0f957f04541f4bf0b8af2e7e59c9f1c4ba4ab0efb42a361a6808c203975c","module":"MathlibExt.Geometry.Convex.PickTheorem","note":"Convexity is assumed, and polygons drawn on a grid need not be convex; the hypothesis of nonempty interior rules out the flat cases.","pair_key":"ab57db62e6fa7e51c4486f729379eb069a6e48214f2c9dd98beb5b4ac2b3809a","path":"MathlibExt/Geometry/Convex/PickTheorem.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MeasureTheory.toReal_volume_convexHull_lattice_triangle","library":"atlas","line":841,"location_key":"758b6c8df6a75b9654e778a19acb69b838626d6112f14908a4e1117d8563a7a5","module":"MathlibExt.Geometry.Convex.PickTheorem","note":"It is stated for three lattice points, one of them the origin, whereas the passage allows any number of grid vertices.","pair_key":"ab9182e61dd6364dfc7ca0ddb6b1cb91e851bb2d6993be72bb6cc849aefca6a9","path":"MathlibExt/Geometry/Convex/PickTheorem.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e851c3928c1f625dadd054eed849a6e4e4815767774b59002f3b2655f523c24c","prominence":"central","quote":{"exact":"If the polygon can be drawn on an equally spaced grid such"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"56e0251751898855c366ead9f08145d0cefd1ddf3ca4b6df3f3c0baf9efaa78d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #e241f32e","item":"In-text #e241f32e","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.isoperimetric_inequality","library":"atlas","line":23,"location_key":"11a3ac28aa9d2e80621dd082ae869d3703bf01704568359642db2ea676bfb4f1","module":"WantedExt.Analysis.Geometry.IsoperimetricInequalityWanted","note":"It bounds four pi times the enclosed area by the squared length of a rectifiable simple closed curve and characterises equality by circles; getting the passage's strict inequality for a polygon needs both the equality case and the fact that a polygonal boundary is no circle, which is a further named step.","pair_key":"02e8c9669648b3ca454ba67e1a93ec48013e799febe078dab06a0e848e0a594c","path":"WantedExt/Analysis/Geometry/IsoperimetricInequalityWanted.lean","proof_status":"wanted","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":true,"text":"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)","type":"∀ {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)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9048ab214e8404fb3735e80800a96aa30dabcb0b14ea2514c31230199d9040ad","prominence":"central","quote":{"exact":"In every polygon with perimeter p and area A , the isoperimetric"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"In every polygon with perimeter p and area A , the isoperimetric inequality p 2 > 4 π A {\\displaystyle p^{2}>4\\pi A} holds.","segments":[{"text":"In every polygon with perimeter p and area A , the isoperimetric inequality "},{"tex":"p^{2}>4\\pi A"},{"text":" holds."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"46f5575faf0014b53f84c0f188ce79de43b13aa602e3293952c370f3cbbbd6bb"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #d0148e3d","item":"In-text #d0148e3d","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.MeasureTheory.Geometry.BanachTarskiWanted.FinitelyEquidecomposableByIsometries","library":"atlas","line":2201,"location_key":"28c2a60805d87898793b31cd002fc16251cfda677dbe153d7a8f87f998aff3a0","module":"MathlibExt.MeasureTheory.Geometry.BanachTarski","note":"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.","pair_key":"b61439aeb9b21aa05d1620ff4409266c2ce86a7b78e801c05ff3bddfa1652759","path":"MathlibExt/MeasureTheory/Geometry/BanachTarski.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.MeasureTheory.Geometry.BanachTarskiWanted.FinitelyEquidecomposableByIsometries {X : Type*} [MetricSpace X] : Set X → Set X → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"90fd430273199517966a3516379c235a9890d21a569bc056a8499e165421b8df","prominence":"central","quote":{"exact":"For any two simple polygons of equal area, the Bolyai–Gerwien theorem asserts"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"7a1188a962855c7a53d5b0b8dfa775c906f3919efec0239e558ec546329a6c1e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #a5835728","item":"In-text #a5835728","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ddf733891fd9e86323ee27acaf6b63916cbbf4e5c5e573c4951c124e8afa1827","prominence":"supporting","quote":{"exact":"The lengths of the sides of a polygon do not in general"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The lengths of the sides of a polygon do not in general determine its area.[9]","segments":[{"text":"The lengths of the sides of a polygon do not in general determine its area."},{"ref":"[9]"}]},"unresolved":null},{"absence":null,"basis":"66625d04e9a27f14ec92ac88fafd119fe00e4b3beca97395ed534bc8613cc5a9","coverage":null,"id":"enwiki-23621-1377769198::In-text #e1b418bb","item":"In-text #e1b418bb","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.brahmagupta_area","library":"atlas","line":138,"location_key":"66625d04e9a27f14ec92ac88fafd119fe00e4b3beca97395ed534bc8613cc5a9","module":"MathlibExt.Geometry.Euclidean.BrahmaguptaArea","note":"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.","pair_key":"15e56a568ff58f59e5ba6cfba5b7741587dbe4cae3b1acc53aa0105a87269c8f","path":"MathlibExt/Geometry/Euclidean/BrahmaguptaArea.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":true,"text":"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))","type":"∀ (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))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1e0f8b9200faa7267c6db0f969393260ea0ae50656bc63fa970505b1c776a6ea","prominence":"central","quote":{"exact":"However, if the polygon is simple and cyclic then the sides do"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"However, if the polygon is simple and cyclic then the sides do determine the area.[10]","segments":[{"text":"However, if the polygon is simple and cyclic then the sides do determine the area."},{"ref":"[10]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"3d226bae4000a64255cfe995cce4806e8a4fb1a1d86d2c70eb83d22fff633186"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #89fb73ed","item":"In-text #89fb73ed","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fcb6401d5851db4fb11120fba99fa9c5ada71f189b4990c30791c7867b2796ec","prominence":"central","quote":{"exact":"Of all n-gons with given side lengths, the one with the largest"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Of all n-gons with given side lengths, the one with the largest area is cyclic.","segments":[{"text":"Of all n-gons with given side lengths, the one with the largest area is cyclic."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"5d5e9b87359e47f95a706fef8cf8a96dbc6854288d26a3e108f330a842fd803e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #5cfba2fe","item":"In-text #5cfba2fe","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7a251f157cc525fd3e7b0280fcc36cd4b7a9837182ca0ac5f65a38d8f7780d30","prominence":"central","quote":{"exact":"Of all n-gons with a given perimeter, the one with the largest"},"quote_capped":true,"section":["Properties and formulas","Area","Simple polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Of all n-gons with a given perimeter, the one with the largest area is regular (and therefore cyclic).","segments":[{"text":"Of all n-gons with a given perimeter, the one with the largest area is regular (and therefore cyclic)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"87bcbfac1d457e4a412293cd8f2ce875223353a8dea5f57b76abb8370e02c345"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #7f49c3e3","item":"In-text #7f49c3e3","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"df77571e19d98c4057b10e1dda8fe2a4592b08d4ef6c3abd013e59cc8daeab43","prominence":"central","quote":{"exact":"The area of a regular polygon is given in terms of the"},"quote_capped":true,"section":["Properties and formulas","Area","Regular polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":" This radius is also termed its apothem and is often represented as a.","segments":[{"text":" This radius is also termed its apothem and is often represented as a."}]},"layer":"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 . {\\displaystyle A={\\tfrac {1}{2}}\\cdot p\\cdot r.}","segments":[{"text":"The area of a regular polygon is given in terms of the radius r of its inscribed circle and its perimeter p by "},{"display":true,"tex":"A={\\tfrac {1}{2}}\\cdot p\\cdot r."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"bd6ddea7d97632aa27c1c4074cf05593e6e3b6ed814910fcbf4fe87ab71e481c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #a071de18","item":"In-text #a071de18","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c9451796df17f8d09ae1257529ea0c86adedac24fdea053a2b59498d62615ded","prominence":"supporting","quote":{"exact":"This radius is also termed its apothem and is often represented as"},"quote_capped":true,"section":["Properties and formulas","Area","Regular polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"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 . {\\displaystyle A={\\tfrac {1}{2}}\\cdot p\\cdot r.} ","segments":[{"text":"The area of a regular polygon is given in terms of the radius r of its inscribed circle and its perimeter p by "},{"display":true,"tex":"A={\\tfrac {1}{2}}\\cdot p\\cdot r."},{"text":" "}]},"layer":"This radius is also termed its apothem and is often represented as a.","segments":[{"text":"This radius is also termed its apothem and is often represented as a."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"3b080ecb509be78cef1bf11805a9afc8184a1d9197716b0f41b0087eec2f33bd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #0c2a2b34","item":"In-text #0c2a2b34","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1c6b3366f2ebd99c339b0ef044143156e0043d9ce4fe1aaca0b2c0e1491c7fd8","prominence":"central","quote":{"exact":"The area of a regular n-gon can be expressed in terms of"},"quote_capped":true,"section":["Properties and formulas","Area","Regular polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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 {\\displaystyle A=R^{2}\\cdot {\\frac {n}{2}}\\cdot \\sin {\\frac {2\\pi }{n}}=R^{2}\\cdot n\\cdot \\sin {\\frac {\\pi }{n}}\\cdot \\cos {\\frac {\\pi }{n}}}","segments":[{"text":"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:"},{"ref":"[12][13]"},{"text":" "},{"display":true,"tex":"A=R^{2}\\cdot {\\frac {n}{2}}\\cdot \\sin {\\frac {2\\pi }{n}}=R^{2}\\cdot n\\cdot \\sin {\\frac {\\pi }{n}}\\cdot \\cos {\\frac {\\pi }{n}}"}]},"unresolved":null},{"absence":null,"basis":"155e69123639ba918d921c169f19cff891c11edda48ea298706fd0f1f77fc947","coverage":null,"id":"enwiki-23621-1377769198::In-text #2ce21ad0","item":"In-text #2ce21ad0","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.integral_windingWeight_shoelace","end_line":84,"library":"tauceti","line":69,"location_key":"155e69123639ba918d921c169f19cff891c11edda48ea298706fd0f1f77fc947","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"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.","pair_key":"7f60a4421ca768d0cbd0e1a28ac786d81f36561254d79d6e4f7fc3b9bec1f974","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":true,"text":"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","type":"∀ {γ : ℝ → ℂ} {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"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.signedArea_eq_intCast_mul_volume_real_of_windingNumber_eq","end_line":71,"library":"tauceti","line":56,"location_key":"c59153bdf505ceb553d4c0f8e542544587c202fdd95d6e9e9a9341d92187cea3","module":"TauCeti.Analysis.Green.Examples.CurveArea.Winding","note":"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.","pair_key":"dbf05136c104db9fc0db3681a86056d0305b6480cba8301c017aaa85d8677771","path":"TauCeti/Analysis/Green/Examples/CurveArea/Winding.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.signedArea_eq_integral_windingWeight","end_line":50,"library":"tauceti","line":44,"location_key":"9e356beeeb834bff3b3dd1ae3fea429a7e3367421b26cec1ef8b5e5be54137e0","module":"TauCeti.Analysis.Green.Examples.CurveArea.Winding","note":"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.","pair_key":"d74ab4f9a28a75b042cee8768a58e8971b12c7def3fceb2378305f1a8822b78e","path":"TauCeti/Analysis/Green/Examples/CurveArea/Winding.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bebfdb4b4840566a34f61ab0645e6b075cbfd6fb12bb283d4cbfd3f760327877","prominence":"supporting","quote":{"exact":"Using the formulas for simple polygons, we allow that particular regions within"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"The area of a self-intersecting polygon can be defined in two different ways, giving different answers: ","lead_in":true,"segments":[{"text":"The area of a self-intersecting polygon can be defined in two different ways, giving different answers: "}]},"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3319f1174d3654b730dc8cc68ea15895190f9391663a2642cfc5ee2147e04bed"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #6d889c48","item":"In-text #6d889c48","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6628dfa17489f3b84e0f757977d11ac0ef29498dde325e0d435a7ca3057e703b","prominence":"supporting","quote":{"exact":"For example, the central convex pentagon in the center of a pentagram"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"For example, the central convex pentagon in the center of a pentagram has density 2.","segments":[{"text":"For example, the central convex pentagon in the center of a pentagram has density 2."}]},"unresolved":null},{"absence":null,"basis":"b3afb226217f77ab63891ab5e3a46cb04e18bfbbe432b442b48abb464960de0a","coverage":null,"id":"enwiki-23621-1377769198::In-text #cf31e61c","item":"In-text #cf31e61c","kind":"example","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.windingNumber_bowTieCurve_upper","end_line":180,"library":"tauceti","line":168,"location_key":"b3afb226217f77ab63891ab5e3a46cb04e18bfbbe432b442b48abb464960de0a","module":"TauCeti.Analysis.Green.Examples.BowTie","note":"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.","pair_key":"da316dbd867b0c1ca12d0e58e1d46dbb19ec6b8ca0df38c5635f8366b2780e47","path":"TauCeti/Analysis/Green/Examples/BowTie.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Green.Examples.windingNumber_bowTieCurve_upper : TauCeti.Contour.windingNumber TauCeti.Green.Examples.bowTieCurve 0 4 { re := 1 / 2, im := 3 / 4 } = 1"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Green.Examples.windingNumber_bowTieCurve_lower","end_line":195,"library":"tauceti","line":183,"location_key":"50fc29df823faedeb8a0ebacf84f768da992a02568fd4610a7aea639fdfaabd5","module":"TauCeti.Analysis.Green.Examples.BowTie","note":"Taken with the companion result for the upper lobe this exhibits the opposition of sign, but neither declaration asserts the opposition on its own.","pair_key":"4499dc06feaa31471a47e3e50bd12cc059665dc9616ab911cd223072cb269332","path":"TauCeti/Analysis/Green/Examples/BowTie.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Green.Examples.windingNumber_bowTieCurve_lower : TauCeti.Contour.windingNumber TauCeti.Green.Examples.bowTieCurve 0 4 { re := 1 / 2, im := 1 / 4 } = -1"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Green.Examples.bowTieCurve_crossing","end_line":36,"library":"tauceti","line":33,"location_key":"e089f5a00791726dd6f537b5ca47b8a1e3b7ed611530d150c4d7a7e909ec5a04","module":"TauCeti.Analysis.Green.Examples.BowTie","note":"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.","pair_key":"8be0dbc357539ba8eb8cf9db7c9ae1660486b19e32b76712e6b45f2fedd445d7","path":"TauCeti/Analysis/Green/Examples/BowTie.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6cd876bf645a385ab5d3fe226017268df594b181016b2cd0d0aab5fad687b553","prominence":"supporting","quote":{"exact":"The two triangular regions of a cross-quadrilateral (like a figure 8) have"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":", and adding their areas together can give a total area of zero for the whole figure.","segments":[{"text":", and adding their areas together can give a total area of zero for the whole figure."}]},"layer":"The two triangular regions of a cross-quadrilateral (like a figure 8) have opposite-signed densities","segments":[{"text":"The two triangular regions of a cross-quadrilateral (like a figure 8) have opposite-signed densities"}]},"unresolved":null},{"absence":null,"basis":"c1f05471c975054eeceb00f6ca32ba1b5be92861bbb1a2cf8c94316921a707b3","coverage":null,"id":"enwiki-23621-1377769198::In-text #ad17f939","item":"In-text #ad17f939","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Green.Examples.integral_windingWeight_bowTieCurve","end_line":227,"library":"tauceti","line":222,"location_key":"c1f05471c975054eeceb00f6ca32ba1b5be92861bbb1a2cf8c94316921a707b3","module":"TauCeti.Analysis.Green.Examples.BowTie","note":"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.","pair_key":"a3d5b333b9e44a1e6f774cbe31ff6f74231eda8953706694f2260309bbc406b5","path":"TauCeti/Analysis/Green/Examples/BowTie.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Green.Examples.integral_windingWeight_bowTieCurve : ∫ (z : ℂ), TauCeti.Green.windingWeight TauCeti.Green.Examples.bowTieCurve 0 4 z = 0"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Green.Examples.integral_circulationFun_area_bowTieCurve","end_line":219,"library":"tauceti","line":203,"location_key":"a0321a4aeae19f681fb680ca4d7f239f9ae3a1b3aa6eb074473a88e694bf0c3d","module":"TauCeti.Analysis.Green.Examples.BowTie","note":"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.","pair_key":"15f2c674178d14cfa22e8047f0212754f8b8bc517b90c10d5d0fd2995f3b357e","path":"TauCeti/Analysis/Green/Examples/BowTie.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"22321b880121f0a4232215eb0934f92ebed44b85897c4d7d05423d131c53e8f6","prominence":"supporting","quote":{"exact":"adding their areas together can give a total area of zero for"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"The two triangular regions of a cross-quadrilateral (like a figure 8) have opposite-signed densities, and ","segments":[{"text":"The two triangular regions of a cross-quadrilateral (like a figure 8) have opposite-signed densities, and "}]},"layer":"adding their areas together can give a total area of zero for the whole figure.","segments":[{"text":"adding their areas together can give a total area of zero for the whole figure."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"1cdc618f2d1dc37cd3d8dadeff488be54bab64e20ffbd9e07fa8f074b1eddb78"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #834d0cce","item":"In-text #834d0cce","kind":"definition","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.filledHull","end_line":82,"library":"tauceti","line":82,"location_key":"810df2611f392c54c527007f2335f9ac092e7c0d6b68e807fca8b93c2642e136","module":"TauCeti.Topology.FilledHull","note":"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.","pair_key":"c1a2ad5ed249c3df40e3111a174be50fe19bebfddaa2db13abb1fe0e88e672b3","path":"TauCeti/Topology/FilledHull.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.filledHull {E : Type*} [TopologicalSpace E] [Bornology E] : Set E → Set E"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"077c9b302d137ff4b8b8858d304ea6ded7568d37ff5efade3dd6b5dad93c4f16","prominence":"supporting","quote":{"exact":"Considering the enclosed regions as point sets, we can find the area"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Considering the enclosed regions as point sets, we can find the area of the enclosed point set.","segments":[{"text":"Considering the enclosed regions as point sets, we can find the area of the enclosed point set."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"adf3fc16fc1b6973eae20be49c5ca501142fc4821041636b63e97ec0acbe0d7f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #2f83caea","item":"In-text #2f83caea","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.signedArea_eq_intCast_mul_volume_real_of_windingNumber_eq","end_line":71,"library":"tauceti","line":56,"location_key":"e8fd33366af1329d87bd12d356fabba76a9c81d95ee1e7057cfc0bb7c8d38fe3","module":"TauCeti.Analysis.Green.Examples.CurveArea.Winding","note":"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.","pair_key":"702640b83eabde18f24724fd2ee2bd8324a7208ca2e7ef247cf2ff523411e3d7","path":"TauCeti/Analysis/Green/Examples/CurveArea/Winding.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c7ca5840d31c99a65297fa1fbee83358f05ddffbc28987b88542233f55de227a","prominence":"supporting","quote":{"exact":"This corresponds to the area of the plane covered by the polygon"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"d34ecca5e959dd5592fc44a912be2a01095486061f0ad0f23b80367c08c45826"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #ac0f463c","item":"In-text #ac0f463c","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"dda3ed73ff8c82f36a34bd5b08e4fb9a2aa0929af1639393f61d9eddc9e4415c","prominence":"supporting","quote":{"exact":"In the case of the cross-quadrilateral, it is treated as two simple"},"quote_capped":true,"section":["Properties and formulas","Area","Self-intersecting"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"In the case of the cross-quadrilateral, it is treated as two simple triangles.[citation needed]","segments":[{"text":"In the case of the cross-quadrilateral, it is treated as two simple triangles.[citation needed]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"c8c0e2e87468ed8f71014f1e33fc75b95b13112a250af71eb865340f68ced431"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #bffa0283","item":"In-text #bffa0283","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"092c45954b736ae96b49b66e9fada6f70a35e24e36fbc228fbc19e999f6abf61","prominence":"central","quote":{"exact":"Using the same convention for vertex coordinates as in the previous section,"},"quote_capped":true,"section":["Properties and formulas","Centroid"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":" In these formulas, the signed value of area A {\\displaystyle A} must be used.","segments":[{"text":" In these formulas, the signed value of area "},{"tex":"A"},{"text":" must be used."}]},"layer":"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 6 A ∑ i = 0 n − 1 ( x i + x i + 1 ) ( x i y i + 1 − x i + 1 y i ) C y = 1 6 A ∑ i = 0 n − 1 ( y i + y i + 1 ) ( x i y i + 1 − x i + 1 y i ) . {\\displaystyle {\\begin{aligned}C_{x}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(x_{i}+x_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i})\\\\C_{y}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(y_{i}+y_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i}).\\end{aligned}}}","segments":[{"text":"Using the same convention for vertex coordinates as in the previous section, the coordinates of the centroid of a solid simple polygon are "},{"display":true,"tex":"\\begin{aligned}C_{x}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(x_{i}+x_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i})\\\\C_{y}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(y_{i}+y_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i}).\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"46e2e11f51d2ab9834f8b4ea86623ccc97ea8fe0bac6166d40789d051a8315c6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #cb7a19b2","item":"In-text #cb7a19b2","kind":"notation","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.signedArea","end_line":39,"library":"tauceti","line":38,"location_key":"314fef1f1ffb990e58b9af8b3324c4e5f4bc574a2d0e394119e51b31b49cc0eb","module":"TauCeti.Analysis.Green.Examples.CurveArea.SignedArea","note":"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.","pair_key":"0b6000445f004c797a70be1015989d2cd67b6e13c93d235c3d6a7cbff613ac60","path":"TauCeti/Analysis/Green/Examples/CurveArea/SignedArea.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.signedArea : (ℝ → ℂ) → ℝ → ℝ → ℝ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a211c9691f5e790e7610fbf06a3552443d18ce2f0359552fbe5ea044627081a9","prominence":"supporting","quote":{"exact":"In these formulas, the signed value of area A {\\displaystyle A} must"},"quote_capped":true,"section":["Properties and formulas","Centroid"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"C x = 1 6 A ∑ i = 0 n − 1 ( x i + x i + 1 ) ( x i y i + 1 − x i + 1 y i ) C y = 1 6 A ∑ i = 0 n − 1 ( y i + y i + 1 ) ( x i y i + 1 − x i + 1 y i ) . {\\displaystyle {\\begin{aligned}C_{x}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(x_{i}+x_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i})\\\\C_{y}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(y_{i}+y_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i}).\\end{aligned}}} ","segments":[{"display":true,"tex":"\\begin{aligned}C_{x}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(x_{i}+x_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i})\\\\C_{y}&={\\frac {1}{6A}}\\sum _{i=0}^{n-1}(y_{i}+y_{i+1})(x_{i}y_{i+1}-x_{i+1}y_{i}).\\end{aligned}"},{"text":" "}],"trimmed":true},"layer":"In these formulas, the signed value of area A {\\displaystyle A} must be used.","segments":[{"text":"In these formulas, the signed value of area "},{"tex":"A"},{"text":" must be used."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"1bccdcb4b7f3c7041348814ed440efbaaf637975a057df468f0763e1b90e2c5d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #3e95bcf8","item":"In-text #3e95bcf8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"56f01cec0f993dc51d5c81b678e16e4916da92cb9d7d147a600f539a353f5aee","prominence":"supporting","quote":{"exact":"For triangles (n = 3), the centroids of the vertices and of"},"quote_capped":true,"section":["Properties and formulas","Centroid"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"01aed9144d7fdbe01ddbd58421eba518637e9a05109abd61f4487c62cfed5464","coverage":null,"id":"enwiki-23621-1377769198::In-text #3ac122f6","item":"In-text #3ac122f6","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.finiteMean_eq_inv_smul_sum","end_line":58,"library":"tauceti","line":56,"location_key":"01aed9144d7fdbe01ddbd58421eba518637e9a05109abd61f4487c62cfed5464","module":"TauCeti.Analysis.Convex.FiniteMean","note":"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.","pair_key":"7709cc5b35d202f6f08fd9d6fcf9ca7734e46dd99bdd886dd9300648e9c106d0","path":"TauCeti/Analysis/Convex/FiniteMean.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.centroid","end_line":80,"library":"mathlib","line":79,"location_key":"d93c639b49c6075b139c197ef467c858a063a70c8591883b2e9cc442c74bdf32","module":"Mathlib.LinearAlgebra.AffineSpace.Centroid","note":"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.","pair_key":"e9899ce4d8ed1824c9c823666c1763b0df87e18951a638de660383305890a8d4","path":"Mathlib/LinearAlgebra/AffineSpace/Centroid.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.centroid (k : Type*) {V : Type*} {P : Type*} [DivisionRing k] [AddCommGroup V] [_root_.Module k V] [AddTorsor V P] {ι : Type*} : Finset ι → (ι → P) → P"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3b9f683d0bea979d53cba2dc42d841382eada5d1e83365e8c3b8f52b89279ec0","prominence":"central","quote":{"exact":"The centroid of the vertex set of a polygon with n vertices"},"quote_capped":true,"section":["Properties and formulas","Centroid"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The centroid of the vertex set of a polygon with n vertices has the coordinates c x = 1 n ∑ i = 0 n − 1 x i c y = 1 n ∑ i = 0 n − 1 y i {\\displaystyle {\\begin{aligned}c_{x}&={\\frac {1}{n}}\\sum _{i=0}^{n-1}x_{i}\\\\c_{y}&={\\frac {1}{n}}\\sum _{i=0}^{n-1}y_{i}\\end{aligned}}}","segments":[{"text":"The centroid of the vertex set of a polygon with n vertices has the coordinates "},{"display":true,"tex":"\\begin{aligned}c_{x}&={\\frac {1}{n}}\\sum _{i=0}^{n-1}x_{i}\\\\c_{y}&={\\frac {1}{n}}\\sum _{i=0}^{n-1}y_{i}\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"8b0798185016dc5e6aeb38604201ec2102fcdfd562197b4cec65f6051366ee11"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #74d18e24","item":"In-text #74d18e24","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6ee455aba83849251627fe7b0d3870fde771d8d6a8b145bd63b2bd2bf8833dca","prominence":"central","quote":{"exact":"A spherical polygon is a circuit of arcs of great circles (sides)"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"Some of the more important include: ","lead_in":true,"segments":[{"text":"Some of the more important include: "}]},"layer":"A spherical polygon is a circuit of arcs of great circles (sides) and vertices on the surface of a sphere.","segments":[{"text":"A spherical polygon is a circuit of arcs of great circles (sides) and vertices on the surface of a sphere."}]},"unresolved":null},{"absence":null,"basis":"4de61770a1a7ba76e40609aa2254989ed8b482e0fe6ea86ea894479315c95a12","coverage":null,"id":"enwiki-23621-1377769198::In-text #1ccfc8aa","item":"In-text #1ccfc8aa","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polygon.HasNondegenerateVertices.three_le","end_line":94,"library":"mathlib","line":89,"location_key":"4de61770a1a7ba76e40609aa2254989ed8b482e0fe6ea86ea894479315c95a12","module":"Mathlib.Geometry.Polygon.Basic","note":"It carries only the half of the passage about the flat plane; nothing in the universe produces the two-sided polygon on a sphere.","pair_key":"7b3a2f03a950d610bca057d952ec6195a123ac9ec81e17c0d1808fa06387b494","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Polygon.IsSimple.three_le","end_line":166,"library":"tauceti","line":146,"location_key":"5580560ae3f50816249cf110ea515eaf6bdd3162972c46decb7842bb5c9209d5","module":"TauCeti.Geometry.Polygon.Simple","note":"Like the mathlib lemma it speaks only of flat spaces, so the spherical half of the passage stays unstated.","pair_key":"1fd30a5b22e7ee10592ea151aa0b3dc6a9fe78c3b2db98a6d9e3daa76d2879cb","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"281624577a81f3424b35e51e5818a7849f5fa5f0aa631d52ca8bf97340ba4e26","prominence":"supporting","quote":{"exact":"It allows the digon, a polygon having only two sides and two"},"quote_capped":true,"section":["Generalizations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"It allows the digon, a polygon having only two sides and two corners, which is impossible in a flat plane.","segments":[{"text":"It allows the digon, a polygon having only two sides and two corners, which is impossible in a flat plane."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"9db9f816f2e6627d73fe24971cbabb5bc7f93d73f034f7ab055ade7100b4c052"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #c0b538ca","item":"In-text #c0b538ca","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cb227f57b8ae97ecf9339f400e0f497a6494dc2fef8278f8b42451cbc977c0bd","prominence":"central","quote":{"exact":"A skew polygon does not lie in a flat plane, but zigzags"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A skew polygon does not lie in a flat plane, but zigzags in three (or more) dimensions.","segments":[{"text":"A skew polygon does not lie in a flat plane, but zigzags in three (or more) dimensions."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"14fe4c5db22ffb293f64d2ab055cd1421296ee420068f8a67fc3a98c254fabe3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #ed1dddd3","item":"In-text #ed1dddd3","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"93248921f733b6cec78267635db6645d6c083032a824ef1b0f47a0f39a1433cd","prominence":"supporting","quote":{"exact":"The Petrie polygons of the regular polytopes are well known examples."},"quote_capped":false,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The Petrie polygons of the regular polytopes are well known examples.","segments":[{"text":"The Petrie polygons of the regular polytopes are well known examples."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3357a1868df6e01a548110e65811e342fb5d219f915e9b6ca8f19f7fc57a573c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #5425620f","item":"In-text #5425620f","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"074fd5769536a23ee1b9a12684c497cc48b144974948ae7f8f42c27f9c3b027e","prominence":"central","quote":{"exact":"An apeirogon is an infinite sequence of sides and angles, which is"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":" because it extends indefinitely in both directions.","segments":[{"text":" because it extends indefinitely in both directions."}]},"layer":"An apeirogon is an infinite sequence of sides and angles, which is not closed but has no ends","segments":[{"text":"An apeirogon is an infinite sequence of sides and angles, which is not closed but has no ends"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"c28ce4b406ad998bcd159cf5303ff6d0ae60ba083d06ea57122018184cb7dfb4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #63385ade","item":"In-text #63385ade","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8c07a3b3812019c7cf50b5fc27ba54802f0fc22208d1598bb11933fd2b22f557","prominence":"central","quote":{"exact":"A skew apeirogon is an infinite sequence of sides and angles that"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A skew apeirogon is an infinite sequence of sides and angles that do not lie in a flat plane.","segments":[{"text":"A skew apeirogon is an infinite sequence of sides and angles that do not lie in a flat plane."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"0cb509599913341899d32589b52f87549876594664af96009766169ef1669b00"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #5066a975","item":"In-text #5066a975","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"21c0eaa0fc43fe66d9e906e0359e74d1744e54986837b9ee0008e7723530e9e1","prominence":"central","quote":{"exact":"A polygon with holes is an area-connected or multiply-connected planar polygon with"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A polygon with holes is an area-connected or multiply-connected planar polygon with one external boundary and one or more interior boundaries (holes).","segments":[{"text":"A polygon with holes is an area-connected or multiply-connected planar polygon with one external boundary and one or more interior boundaries (holes)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"502dc5a2ce36618f465c676ffc6e770b68d0a2cf752525a5ede42284be7da266"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #680451ea","item":"In-text #680451ea","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1ffa2c3318315129202333e2a709fca6721945530cc792f2b324ba78e9be812a","prominence":"central","quote":{"exact":"A complex polygon is a configuration analogous to an ordinary polygon, which"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A complex polygon is a configuration analogous to an ordinary polygon, which exists in the complex plane of two real and two imaginary dimensions.","segments":[{"text":"A complex polygon is a configuration analogous to an ordinary polygon, which exists in the complex plane of two real and two imaginary dimensions."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"cb6e6aab374eb8074d61ab2b650aeeb604db0e51836fd4c156c940ca33a58f53"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #ad962352","item":"In-text #ad962352","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e29a1b6f6b5582f84cb1d504b5ad3274aac883c495fbfe39e157e9e23dbd539d","prominence":"central","quote":{"exact":"An abstract polygon is an algebraic partially ordered set representing the various"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"An abstract polygon is an algebraic partially ordered set representing the various elements (sides, vertices, etc.) and their connectivity.","segments":[{"text":"An abstract polygon is an algebraic partially ordered set representing the various elements (sides, vertices, etc.) and their connectivity."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"ac9cb71a503e5635b008f872c031617ca7769488440878af37fee2269f5cb38b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #fda0e21e","item":"In-text #fda0e21e","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"81f436b8b985f9bc25a77a68b8a02b52f4f301c19e65555614ffa1f248b4f304","prominence":"supporting","quote":{"exact":"A real geometric polygon is said to be a realization of the"},"quote_capped":true,"section":["Generalizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A real geometric polygon is said to be a realization of the associated abstract polygon.","segments":[{"text":"A real geometric polygon is said to be a realization of the associated abstract polygon."}]},"unresolved":null},{"absence":null,"basis":"7c7dde4ff21b36daf02d8bf9710aba1ed48fb1530acfd8d103f3da16136abece","coverage":null,"id":"enwiki-23621-1377769198::In-text #3951b32f","item":"In-text #3951b32f","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron","library":"atlas","line":111,"location_key":"7c7dde4ff21b36daf02d8bf9710aba1ed48fb1530acfd8d103f3da16136abece","module":"WantedExt.Topology.FamiliesOfMapsB01Wanted","note":"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.","pair_key":"0b3febcd0659b7e8ebae29b09e8c25fcd7e019a7a56d1908440c754db1aec8ef","path":"WantedExt/Topology/FamiliesOfMapsB01Wanted.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron {k : ℕ} : Set (Fin k → ℝ) → Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos660.IsPolyhedronVertices","end_line":44,"library":"formal-conjectures","line":43,"location_key":"cfff5b8e6bc389917354d815533a6577d1bab2fefcda1a87a5f1f3cf26592675","module":"FormalConjectures.ErdosProblems.«660»","note":"It is written for three-dimensional space, but it describes which finite point sets are vertex sets, not what the bounded solid itself is.","pair_key":"8fae1e2f67812217576342b325d9848c574b035118ed8b43a4654a426c2f0143","path":"FormalConjectures/ErdosProblems/660.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos660.IsPolyhedronVertices : Finset (EuclideanSpace ℝ (Fin 3)) → Prop"},"statement":true},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.IsConvexPolyhedron","end_line":57,"library":"tauceti","line":56,"location_key":"69a6222d2b98769a9bba27c49e894854edb941dce78846763ec14e30d3db8f29","module":"TauCeti.Analysis.Convex.Polyhedron.Basic","note":"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.","pair_key":"2e22d604201032c6898c6d741d5ecd45ec73f34dfd384cd27b826372f00c4428","path":"TauCeti/Analysis/Convex/Polyhedron/Basic.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.IsConvexPolyhedron {E : Type*} [AddCommGroup E] [_root_.Module ℝ E] [TopologicalSpace E] : Set E → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8303f94b2ac91f1dca1d61ff2e441d35e198214e9d056f9949c788580b026452","prominence":"central","quote":{"exact":"A polyhedron is a three-dimensional solid bounded by flat polygonal faces, analogous"},"quote_capped":true,"section":["Generalizations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"A polyhedron is a three-dimensional solid bounded by flat polygonal faces, analogous to a polygon in two dimensions.","segments":[{"text":"A polyhedron is a three-dimensional solid bounded by flat polygonal faces, analogous to a polygon in two dimensions."}]},"unresolved":null},{"absence":null,"basis":"4790be831d702d251c285df43b044d8dc55e08e29816347cfd5fea8a9b022ec3","coverage":null,"id":"enwiki-23621-1377769198::In-text #38d01d36","item":"In-text #38d01d36","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope","library":"atlas","line":73,"location_key":"4790be831d702d251c285df43b044d8dc55e08e29816347cfd5fea8a9b022ec3","module":"WantedExt.Geometry.PlatonicClassificationWanted","note":"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.","pair_key":"3d1e708a5a3cc3ed721ccd02cb19115f5c964d3cf582382f82f04d69c147f258","path":"WantedExt/Geometry/PlatonicClassificationWanted.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"structure MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope : ℕ → Type"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"low","declaration":"MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron","library":"atlas","line":111,"location_key":"58c20f6ccb3b7075a28552fb986c32c7235c2150c49028bc5247bcc16ab9fbfd","module":"WantedExt.Topology.FamiliesOfMapsB01Wanted","note":"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.","pair_key":"903dc22245cd34c958ceffed139167f4c3754fd8bb682f8feb67aac703b5b7ef","path":"WantedExt/Topology/FamiliesOfMapsB01Wanted.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Topology.FamiliesOfMapsB01Wanted.FamiliesOfMapsB01.IsPolyhedron {k : ℕ} : Set (Fin k → ℝ) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"48f50068a9b6cae3fa30186605d30a34b8531241c951bbfd9291324967cc15dd","prominence":"central","quote":{"exact":"The corresponding shapes in four or higher dimensions are called polytopes.[15]"},"quote_capped":false,"section":["Generalizations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"The corresponding shapes in four or higher dimensions are called polytopes.[15]","segments":[{"text":"The corresponding shapes in four or higher dimensions are called polytopes."},{"ref":"[15]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"fd5a87f277eba4d13ebf7e6c9bce588419a5ea2a942082af2b88b1f940d8c465"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #cef6e646","item":"In-text #cef6e646","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"16286fdc8891e310a595193f37cb3c81c4361af2ebc71564ca6a112db6b5a205","prominence":"supporting","quote":{"exact":"If a square mesh has n + 1 points (vertices) per side,"},"quote_capped":true,"section":["Computer graphics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"after":{"layer":" since there are two triangles in a square.","segments":[{"text":" since there are two triangles in a square."}]},"layer":"If a square mesh has n + 1 points (vertices) per side, there are n squared squares in the mesh, or 2n squared triangles","segments":[{"text":"If a square mesh has n + 1 points (vertices) per side, there are n squared squares in the mesh, or 2n squared triangles"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"2f193d95dbf2f05ee37fa66156399870877e6168bd1e0db3f620c46b6f4dd027"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #1417f8cd","item":"In-text #1417f8cd","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"91c8e36777b81bfee28b8f5f05084efcf0837c288f7ef18e4c277467679ab8b8","prominence":"supporting","quote":{"exact":"there are two triangles in a square."},"quote_capped":false,"section":["Computer graphics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"before":{"layer":"If a square mesh has n + 1 points (vertices) per side, there are n squared squares in the mesh, or 2n squared triangles since ","segments":[{"text":"If a square mesh has n + 1 points (vertices) per side, there are n squared squares in the mesh, or 2n squared triangles since "}]},"layer":"there are two triangles in a square.","segments":[{"text":"there are two triangles in a square."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"0988a4adafa7e8ca27c1e73b80d9f768681e1173c6515b858b993a6bfd7a9019"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #70bd96b5","item":"In-text #70bd96b5","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2d72476a0445ae6ab5678ceed17fc7e196647bb699e7e30aa7b7b211f41687f7","prominence":"supporting","quote":{"exact":"There are (n + 1)2 / 2(n2) vertices per triangle."},"quote_capped":false,"section":["Computer graphics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"There are (n + 1)2 / 2(n2) vertices per triangle.","segments":[{"text":"There are (n + 1)2 / 2(n2) vertices per triangle."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"f3952e92cb05a55e822b2f20db4cbc26885f4a3dc6779e84815ed3daa92b933e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #48ed2332","item":"In-text #48ed2332","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.div_tendsto_atTop_leadingCoeff_div_of_degree_eq","end_line":188,"library":"mathlib","line":184,"location_key":"491dd79c634d5870f3df2ef1d753f5971c833bb5b03970be122a9082a126187d","module":"Mathlib.Analysis.Polynomial.Basic","note":"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.","pair_key":"8f0e2cf1825009c46a072ab6b576395895cba79652948709719b73dc80779b49","path":"Mathlib/Analysis/Polynomial/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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))"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"280bab597deccffcc44731d1ab7e22f00b93d2839ceb8fe7921ea919035eb38a","prominence":"supporting","quote":{"exact":"Where n is large, this approaches one half."},"quote_capped":false,"section":["Computer graphics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Where n is large, this approaches one half.","segments":[{"text":"Where n is large, this approaches one half."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"844becfd6fe8c0cc984f002d041470e4fa0446cbc6bf19dad6c246b04be8ceb0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23621-1377769198::In-text #19a1f42d","item":"In-text #19a1f42d","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"SimpleGraph.degree_boxProd","end_line":253,"library":"mathlib","line":249,"location_key":"ec571ee6ed538b007852ce19177d1ddd8d7ae80e88aaffeda06598765092cbac","module":"Mathlib.Combinatorics.SimpleGraph.Prod","note":"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.","pair_key":"edcc664a30923167526cd82dc5a61a08a99704bbfbf139329db079b3ec0b9ae9","path":"Mathlib/Combinatorics/SimpleGraph/Prod.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"94e2b1050b8bff6553b9f78c6f6b0a5714ed4e79b7dcb02dcc01c92a1bab0e04","prominence":"supporting","quote":{"exact":"Or, each vertex inside the square mesh connects four edges (lines)."},"quote_capped":false,"section":["Computer graphics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"Or, each vertex inside the square mesh connects four edges (lines).","segments":[{"text":"Or, each vertex inside the square mesh connects four edges (lines)."}]},"unresolved":null},{"absence":null,"basis":"02e9c53a8e7a63b3e70b6d5ef6ed033da8b3c55d3d64d3ff1050d4a626d54b19","coverage":null,"id":"enwiki-23621-1377769198::In-text #7d249d29","item":"In-text #7d249d29","kind":"notation","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside","library":"atlas","line":67,"location_key":"02e9c53a8e7a63b3e70b6d5ef6ed033da8b3c55d3d64d3ff1050d4a626d54b19","module":"WantedExt.Geometry.PicksTheoremWanted","note":"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.","pair_key":"0f2d83cf3a0c06828c2c3d397be973322cc0e9b5216c174fe7d1dab1650ca8e2","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.inside : Set (ℝ × ℝ) → Set (ℝ × ℝ)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple","library":"atlas","line":78,"location_key":"76cec7feab2ea9000f5ebfa38fa06f0092e7eaf18b3fcbec4083d24b52dddf03","module":"WantedExt.Geometry.PicksTheoremWanted","note":"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.","pair_key":"d95c8d40d5c8339e915d67e85553e3afac18e5a1229097705e03495ac4b5501b","path":"WantedExt/Geometry/PicksTheoremWanted.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PicksTheoremWanted.Geometry.PicksTheorem.IsSimple {n : ℕ} : Polygon (ℝ × ℝ) n → Prop"},"statement":true},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Polygon.IsSimple","end_line":108,"library":"tauceti","line":102,"location_key":"52b2137e74dea8a64923b47ed924bd4dabfd06b2e18ea066bbbf192d54d889a0","module":"TauCeti.Geometry.Polygon.Simple","note":"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.","pair_key":"0a69b4f9f76d9c44faf0f9d572e9b9825acdefeaca4ba8bd9db05077fe6364f0","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7a5fd699e849504939880df500bf379acc8bef598d7ed3fc39eb04b11bcac2c7","prominence":"supporting","quote":{"exact":"In computer graphics and computational geometry, it is often necessary to determine"},"quote_capped":true,"section":["Computer graphics"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23621&oldid=1377769198","text":{"layer":"In computer graphics and computational geometry, it is often necessary to determine whether a given point P = ( x 0 , y 0 ) {\\displaystyle 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.","segments":[{"text":"In computer graphics and computational geometry, it is often necessary to determine whether a given point "},{"tex":"P=(x_{0},y_{0})"},{"text":" lies inside a simple polygon given by a sequence of line segments. This is called the point in polygon test."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":236646,"images":[{"author":"CountingPine","file":"Assorted_polygons.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":null,"file":"Fotothek_df_tg_0003352_Geometrie_^_Dreieck_^_Viereck_^_Vieleck_^_Winkel.jpg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Matthew Mayer (User Matthewmayer in English Wikipedia)","file":"Giants_causeway_closeup.jpg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"https://phabricator.wikimedia.org/diffusion/GOJU/browse/master/AUTHORS.txt","file":"OOjs_UI_icon_edit-ltr-progressive.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Salix alba at English Wikipedia","file":"Polygon_types.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Qef","file":"Polygon_vertex_labels.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Tkgd2007","file":"Question_book-new.svg","licence":"Cc-by-sa-3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"en"},{"author":"Ag2gaeh","file":"Winkelsumme-polygon.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"}],"marks":438,"passages":100,"sha256":"33f6af178a067e2608d508a29ffaa11ff6273ef18df7eebe1bf449485daf7cea","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"f9512fcb71e05b96f8877d22cdb978c9d9cbca54e0cfde844fcfc72b3634adef","revision":1377769198,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"e8d891d42ac9c14062886840c3da12049dc67b329ab93a9cd70055835944e05b","layer_sha256":"5e79046eb82c3f266603154d895b10b8913360dd150492d5273804ca17576c4a","renderer":"web-html/3"},"source_id":"enwiki-23621-1377769198","summary":{"by_library":{"atlas":{"complete":13,"incomplete":1,"locations":14,"passages":11,"related":12},"formal-conjectures":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":5},"mathlib":{"complete":24,"incomplete":0,"locations":24,"passages":20,"related":11},"tauceti":{"complete":25,"incomplete":0,"locations":25,"passages":17,"related":24}},"by_prominence":{"central":{"by_status":{"formalized":11,"not_formalized":30,"partial":10,"statement_only":1,"unresolved":0},"passages":52},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":7,"not_formalized":27,"partial":13,"statement_only":0,"unresolved":0},"passages":47}},"by_proof_status":{"definition":59,"proved":54,"wanted":4},"by_relation":{"broadMatch":32,"closeMatch":3,"exactMatch":2,"hasPart":9,"narrowMatch":19,"relatedMatch":52},"by_status":{"formalized":19,"not_formalized":57,"partial":23,"statement_only":1,"unresolved":0},"locations":65,"passages":100,"related":52},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Polygon","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q37555"}
