{"assessment":{"class":"C","importance":"high"},"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":333306,"passages":[{"absence":null,"basis":"3c307b10ffe7373702b510cfe34bd3f24d13b38c1241246b2a45a448019b8c54","coverage":null,"id":"enwiki-333306-1379891336::In-text #6ecceedb","item":"In-text #6ecceedb","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular","library":"atlas","line":118,"location_key":"3c307b10ffe7373702b510cfe34bd3f24d13b38c1241246b2a45a448019b8c54","module":"WantedExt.Geometry.PlatonicClassificationWanted","note":"Regularity is written here as a full-dimensional convex polytope whose symmetry group is transitive on flags, which for a plane polygon amounts to equal sides together with equal angles, while the convex hull setting leaves out the star polygons the article also admits.","pair_key":"425fa29086c61f81b37f3c75bb9d49ce82bf0ab3dfce7df34d119d95e2a174c1","path":"WantedExt/Geometry/PlatonicClassificationWanted.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular {n : ℕ} : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope n → Prop"},"statement":true},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"low","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"1085282cd23e6f3fcad75535f19fa4772554bfa5efcc3bf04c053b9331d55eef","module":"FormalConjectures.ErdosProblems.«94»","note":"The object is built from equally spaced points of the unit circle rather than from a condition on sides and angles, and it fixes both the centre and the circumradius.","pair_key":"9e3aa5301dd5836f7ecd0e3aa067370d991a650571160f7a546b5e52e54edac1","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","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":"73a2732b8ccc12ab1564cbc6a8410027cbddfad76821b314db558ccd419d2a66","prominence":"subject","quote":{"exact":"In Euclidean geometry, a regular polygon is a polygon that is direct"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length).","segments":[{"text":"In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"514f9d143e353561a7ee0af259d1001124f8ae44e20eb932cb1d4dcbdae71730"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #927a6818","item":"In-text #927a6818","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6b7c1ab0eba6add33a31ba799b6c6decab5e7ee3846942bbd9d35fac4ac943d9","prominence":"supporting","quote":{"exact":"Regular polygons may be either convex or star."},"quote_capped":false,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Regular polygons may be either convex or star.","segments":[{"text":"Regular polygons may be either convex or star."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"89a37f030393ef37a6637fc18726fae3f40b1b55caa1417a5aef5b7549ec0fd4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #1546951c","item":"In-text #1546951c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b65ab97e9773d119990ecc9dc87f5a21a660a1b911a749e4e29f7975ca502f39","prominence":"supporting","quote":{"exact":"In the limit, a sequence of regular polygons with an increasing number"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a straight line), if the edge length is fixed.","segments":[{"text":"In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a straight line), if the edge length is fixed."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"765ac3af06b6e83c1a0b0b6cdd59abc4cfef53ba94265f2747c36c24c66beabe"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #ed1f0e4e","item":"In-text #ed1f0e4e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2e6e77907e3d2d293397ee5739c8ebdb4ee3cb1708d2ad34dfa81bc9c1f8ebef","prominence":"supporting","quote":{"exact":"A regular n-sided polygon has rotational symmetry of order n."},"quote_capped":false,"section":["General properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"These properties apply to all regular polygons, whether convex or star: ","lead_in":true,"segments":[{"text":"These properties apply to all regular polygons, whether convex or star: "}]},"layer":"A regular n-sided polygon has rotational symmetry of order n.","segments":[{"text":"A regular n-sided polygon has rotational symmetry of order n."}]},"unresolved":null},{"absence":null,"basis":"744f653b1da67be1237507fa59231cbbafca5fc75263400956bb71e33230bdc1","coverage":null,"id":"enwiki-333306-1379891336::In-text #6db9715a","item":"In-text #6db9715a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Affine.Simplex.mem_circumsphere","end_line":237,"library":"mathlib","line":235,"location_key":"744f653b1da67be1237507fa59231cbbafca5fc75263400956bb71e33230bdc1","module":"Mathlib.Geometry.Euclidean.Circumcenter","note":"The declaration speaks of a simplex of arbitrary dimension, so inside the plane it reaches the three-sided polygons of the article, and the common circle is the circumsphere Mathlib attaches to the simplex.","pair_key":"bae0cc872b3a4c8ed3f0214e502ad9f9662616b4e68149ac5799b35a95f575d2","path":"Mathlib/Geometry/Euclidean/Circumcenter.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","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":"311cf42a5d46c08824a5349699a4cdd7ae046de3b097ad1b69149f9bbea4471e","prominence":"supporting","quote":{"exact":"All vertices of a regular polygon lie on a common circle (the"},"quote_capped":true,"section":["General properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon.","segments":[{"text":"All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"0719458f93a6263d7c30ab483a078a17fef0015386e2aa286965bafc8184b196"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #6eca6bd5","item":"In-text #6eca6bd5","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"66d6c828227cc3d1fdffb983ca89079fd425b55a97d359590d3babf777f3ad67","prominence":"supporting","quote":{"exact":"Together with the property of equal-length sides, this implies that every regular"},"quote_capped":true,"section":["General properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Together with the property of equal-length sides, this implies that every regular polygon also has an inscribed circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon.","segments":[{"text":"Together with the property of equal-length sides, this implies that every regular polygon also has an inscribed circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon."}]},"unresolved":null},{"absence":null,"basis":"a5e362d699039223bb97750a1ebd27754bc228c39d2cc17b5bef713a0943b953","coverage":null,"id":"enwiki-333306-1379891336::In-text #15ab28cb","item":"In-text #15ab28cb","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon","library":"atlas","line":82,"location_key":"a5e362d699039223bb97750a1ebd27754bc228c39d2cc17b5bef713a0943b953","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"The library writes the drawing of the n-gon as membership of the cosine of two pi over n in the smallest subfield of the reals closed under square roots, and names the arithmetic side after Gauss and Wantzel, asking there that each odd prime factor of n be a distinct Fermat prime; it is asserted for n of three or more, the range in which an n-gon is a polygon at all.","pair_key":"94043df1b5b2e0e8f36150be680d5922b904c601836618bc24c898705460e349","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"wanted","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6ae3e3a6e5028ef935e497eb36ea61c8a71a64d70ab1729d006a41232aca2477","prominence":"central","quote":{"exact":"A regular n-sided polygon can be constructed with compass and straightedge if"},"quote_capped":true,"section":["General properties"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A regular n-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of n are distinct Fermat primes.","segments":[{"text":"A regular n-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of n are distinct Fermat primes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"c3c0cabdac468ca4d8c65cef985452a6906df787d256a85785276c60beaf9d32"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #d50e982e","item":"In-text #d50e982e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2c38cb8e5dde141cb9bfbd04f894b73fa2d08fcd0793525156b3aa10ab788efa","prominence":"central","quote":{"exact":"A regular n-sided polygon can be constructed with origami if and only"},"quote_capped":true,"section":["General properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"(See constructible polygon.) ","lead_in":true,"segments":[{"text":"(See constructible polygon.) "}]},"layer":"A regular n-sided polygon can be constructed with origami if and only if n = 2 a 3 b p 1 ⋯ p r {\\displaystyle n=2^{a}3^{b}p_{1}\\cdots p_{r}} for some r ∈ N {\\displaystyle r\\in \\mathbb {N} } , where each distinct p i {\\displaystyle p_{i}} is a Pierpont prime.","segments":[{"text":"A regular n-sided polygon can be constructed with origami if and only if "},{"tex":"n=2^{a}3^{b}p_{1}\\cdots p_{r}"},{"text":" for some "},{"tex":"r\\in \\mathbb {N}"},{"text":" , where each distinct "},{"tex":"p_{i}"},{"text":" is a Pierpont prime."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"758df7405bf9ef8ff2fb652a344320676a3a7057f079f9bf9fa374e99fa9c2d1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #144e7d38","item":"In-text #144e7d38","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"DihedralGroup.nat_card","end_line":162,"library":"mathlib","line":159,"location_key":"a2fb27933926e32ca91e8cdf2bd0c6e1a6b44144ca925db4a336619894d08ce2","module":"Mathlib.GroupTheory.SpecificGroups.Dihedral","note":"It counts the elements of the abstract dihedral group and mentions no geometric figure.","pair_key":"11f1cafec21d897d6755704999979b08300d30c3cc186c86e5f8712b905d5f21","path":"Mathlib/GroupTheory/SpecificGroups/Dihedral.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem DihedralGroup.nat_card {n : ℕ} : Nat.card (DihedralGroup n) = 2 * n"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"d503fbed617a9971dbda9be54b23539d5813896d8751bd3efc8e259215f2e539","module":"FormalConjectures.ErdosProblems.«94»","note":"It names the vertex set of a regular n-gon on the unit circle but proves nothing about its symmetries.","pair_key":"ffbe5945a6bdeef99ed106a63128732764c65928ff621968aff834681e8e029e","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":"8302b67160ea3c745cab7a5c090b9a04b7e9e542e25b85d26d3b13ae84ba938d","prominence":"central","quote":{"exact":"The symmetry group of an n-sided regular polygon is the dihedral group"},"quote_capped":true,"section":["General properties","Symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The symmetry group of an n-sided regular polygon is the dihedral group Dn (of order 2n): D2, D3, D4, ...","segments":[{"text":"The symmetry group of an n-sided regular polygon is the dihedral group Dn (of order 2n): D2, D3, D4, ..."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"e2703cec79ff4753978f72f225b86e6ea8db2e5c9f39f2d79d91fc2bfa4d300a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #30c1a558","item":"In-text #30c1a558","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.isCyclic_dihedralRotations","end_line":528,"library":"tauceti","line":527,"location_key":"cf3f92927dbf7d43a1802ba470d4ce31acfa43b344e32c12ea50d5d4764d1877","module":"TauCeti.GroupTheory.SpecificGroups.Dihedral.Basic","note":"It says the rotation subgroup of the abstract dihedral group is cyclic, with no plane figure and no axes.","pair_key":"66a026ff2de7f44620a7de31a0aa761af4d38d49e49d50c0a683d3cc00cd63f4","path":"TauCeti/GroupTheory/SpecificGroups/Dihedral/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"instance TauCeti.isCyclic_dihedralRotations (n : ℕ) : IsCyclic ↥(TauCeti.dihedralRotations n)"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.index_dihedralRotations","end_line":439,"library":"tauceti","line":436,"location_key":"ffdf8a5e0e5c0c7a3d736f57dfc1f9a11626b26a69fb2f16239422c00c0fdba6","module":"TauCeti.GroupTheory.SpecificGroups.Dihedral.Basic","note":"It gives the index two of the rotation subgroup, which counts non-rotations abstractly rather than describing reflection axes.","pair_key":"30a2dd35c929f5c231294ac3a76af59309fe2165a3846383fb79709ec3dcba60","path":"TauCeti/GroupTheory/SpecificGroups/Dihedral/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.index_dihedralRotations (n : ℕ) : (TauCeti.dihedralRotations n).index = 2"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bafeda25306d1dd6b86591ad90e011b714d4472fdb9a5f9bb470c265f5cecf59","prominence":"supporting","quote":{"exact":"It consists of the rotations in Cn, together with reflection symmetry in"},"quote_capped":true,"section":["General properties","Symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"It consists of the rotations in Cn, together with reflection symmetry in n axes that pass through the center.","segments":[{"text":"It consists of the rotations in Cn, together with reflection symmetry in n axes that pass through the center."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"50bc09ba1961eacbeea5e0d9b2a19afe77950929688fbe2ddfb2a51b8845ea3c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #00bbd3c4","item":"In-text #00bbd3c4","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3afb07af507917f88354b213e46f4b3978dd3e048419d3d8dbe8f22285cfcff6","prominence":"supporting","quote":{"exact":"If n is even then half of these axes pass through two"},"quote_capped":true,"section":["General properties","Symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"If n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides.","segments":[{"text":"If n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"9daabe80914a9f29e05d89216f1e31cb3f80437723e3fa686c69f41f0de1d177"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #b23242c6","item":"In-text #b23242c6","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1743041333188563a33722738034e74f8f10fc128011c92334ae07952afa2dd0","prominence":"supporting","quote":{"exact":"If n is odd then all axes pass through a vertex and"},"quote_capped":true,"section":["General properties","Symmetry"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"If n is odd then all axes pass through a vertex and the midpoint of the opposite side.","segments":[{"text":"If n is odd then all axes pass through a vertex and the midpoint of the opposite side."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"f37ce940d4d2e52e5e3d69ac5c81dcf213848313e3489e34272a3c4f8725bf27"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #53006acf","item":"In-text #53006acf","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Polygon.IsSimple.isJordanCurve_boundary","end_line":420,"library":"tauceti","line":412,"location_key":"74faa74dcdd86b90523ef29e5543869a4d884bbcbdc69069dcde5bba8117af0f","module":"TauCeti.Geometry.Polygon.Simple","note":"It concludes that a simple polygon's boundary is a Jordan curve, which is not convexity and uses no regularity.","pair_key":"ad06c02d0d02448a196e9d1a2134b34e655812255c0c9e1ec5798d1481c3762b","path":"TauCeti/Geometry/Polygon/Simple.lean","proof_status":"proved","rank":1,"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}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"4d7d3afb085f185b7dd2ebca9a667f410263157dc4e190e3660d8f8a37bc1928","prominence":"central","quote":{"exact":"All regular simple polygons (a simple polygon is one that does not"},"quote_capped":true,"section":["Regular convex polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"All regular simple polygons (a simple polygon is one that does not intersect itself anywhere) are convex.","segments":[{"text":"All regular simple polygons (a simple polygon is one that does not intersect itself anywhere) are convex."}]},"unresolved":null},{"absence":null,"basis":"e6defdf3362a93119b2a6d32d9f6c2c34045525c0d269d91d725da423c84b742","coverage":null,"id":"enwiki-333306-1379891336::In-text #824f9234","item":"In-text #824f9234","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"similar_of_dist_mul_eq_dist_mul_eq","end_line":324,"library":"mathlib","line":313,"location_key":"e6defdf3362a93119b2a6d32d9f6c2c34045525c0d269d91d725da423c84b742","module":"Mathlib.Topology.MetricSpace.Similarity","note":"The lemma reaches only the three-sided case of the passage, since it is stated for triples of points rather than for n-gons.","pair_key":"0f99b7ff86cf08bce48a16e0f03930fc2d51e5c3879fd74b0bf40f21135a0d11","path":"Mathlib/Topology/MetricSpace/Similarity.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem similar_of_dist_mul_eq_dist_mul_eq {P₁ : Type*} {P₂ : Type*} [PseudoMetricSpace P₁] [PseudoMetricSpace P₂] {a b c : P₁} {a' b' c' : P₂} : Dist.dist a b ≠ 0 → Dist.dist a' b' ≠ 0 → Dist.dist a b * Dist.dist b' c' = Dist.dist b c * Dist.dist a' b' → Dist.dist a b * Dist.dist c' a' = Dist.dist c a * Dist.dist a' b' → Similar ![a, b, c] ![a', b', c']"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"similar_iff_exists_dist_eq","end_line":231,"library":"mathlib","line":226,"location_key":"022234b35449e667aa25a0e593333e7ea0470cbcc26238daec3759388fc1afbb","module":"Mathlib.Topology.MetricSpace.Similarity","note":"It unfolds similarity of two point families into a common ratio of distances and mentions no polygon.","pair_key":"4e22f61ebf0c3877159fa16e56f8ccde3826d1b8cd9ecc99a1f0f1bb08724f8a","path":"Mathlib/Topology/MetricSpace/Similarity.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem similar_iff_exists_dist_eq {ι : Type*} {P₁ : Type*} {P₂ : Type*} {v₁ : ι → P₁} {v₂ : ι → P₂} [PseudoMetricSpace P₁] [PseudoMetricSpace P₂] : Similar v₁ v₂ ↔ ∃ r, r ≠ 0 ∧ ∀ (i₁ i₂ : ι), Dist.dist (v₁ i₁) (v₁ i₂) = ↑r * Dist.dist (v₂ i₁) (v₂ i₂)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"71c509e2afb4e341d13a6642f38882525919bcc73e0d7c4b69e799c506abd672","prominence":"supporting","quote":{"exact":"Those having the same number of sides are also similar."},"quote_capped":false,"section":["Regular convex polygons"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Those having the same number of sides are also similar.","segments":[{"text":"Those having the same number of sides are also similar."}]},"unresolved":null},{"absence":null,"basis":"fe35cd1653a628967ba4fffc36c60887fb6c53ecf841721010e4e6f769cf5fa8","coverage":null,"id":"enwiki-333306-1379891336::In-text #a4cc7a3b","item":"In-text #a4cc7a3b","kind":"notation","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"fe35cd1653a628967ba4fffc36c60887fb6c53ecf841721010e4e6f769cf5fa8","module":"FormalConjectures.ErdosProblems.«94»","note":"The library object fixes the centre and the circumradius and is carried by the vertex finset, so it is one placed copy of the convex regular n-gon rather than the general one.","pair_key":"823c3f799c9b74b67f0fee6336daef95e3e4eea6ebb7a7a96cae998e357452c9","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","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":"101ec726416508f67a6dad45634de4177204aa654ba090eb987b78182a70f0d8","prominence":"central","quote":{"exact":"An n-sided convex regular polygon is denoted by its Schläfli symbol {"},"quote_capped":true,"section":["Regular convex polygons"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"An n-sided convex regular polygon is denoted by its Schläfli symbol { n } {\\displaystyle \\{n\\}} .","segments":[{"text":"An n-sided convex regular polygon is denoted by its Schläfli symbol "},{"tex":"\\{n\\}"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"a609fcad71ec064fcf4156f1538151f9b639861c5e87ee7c7ef43cc386d1a028"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #8e1e56d4","item":"In-text #8e1e56d4","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Green.Examples.green_annulus_region_area","end_line":220,"library":"tauceti","line":180,"location_key":"6da22bf26ded82a091e31a4ffecb1bad5d91a388bce66433c47f36c5420bc3e7","module":"TauCeti.Analysis.Green.Examples.CurveArea.Green","note":"It computes the measure of the region between two concentric circles as pi times the difference of the squared radii, with no polygon in sight.","pair_key":"2c31b6fd8d5744e1ebdb716bffcf342781b63ee8d76c098c2d71cdc770b49552","path":"TauCeti/Analysis/Green/Examples/CurveArea/Green.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":true,"text":"theorem TauCeti.Green.Examples.green_annulus_region_area {r R : ℝ} : … → have D := Metric.ball 0 R \\ Metric.closedBall 0 r; IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (circleMap 0 R)) MeasureTheory.MeasureSpace.volume 0 (2 * π) ∧ IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (TauCeti.Green.Examples.clockwiseCircle r)) MeasureTheory.MeasureSpace.volume 0 (2 * π) ∧ …","type":"∀ {r R : ℝ},\n  0 < r →\n    r < R →\n      have D := Metric.ball 0 R \\ Metric.closedBall 0 r;\n      IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (circleMap 0 R)) MeasureTheory.MeasureSpace.volume 0 (2 * Real.pi) ∧ IntervalIntegrable (TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (TauCeti.Green.Examples.clockwiseCircle r)) MeasureTheory.MeasureSpace.volume 0 (2 * Real.pi) ∧ MeasureTheory.IntegrableOn (fun x ↦ 1) D MeasureTheory.MeasureSpace.volume ∧ ∫ (x : ℂ) in D, 1 = Real.pi * (R ^ 2 - r ^ 2) ∧ MeasureTheory.MeasureSpace.volume D = ENNReal.ofReal (Real.pi * (R ^ 2 - r ^ 2)) ∧ (∫ (t : ℝ) in 0..2 * Real.pi, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (circleMap 0 R) t) + ∫ (t : ℝ) in 0..2 * Real.pi, TauCeti.Green.circulationFun TauCeti.Green.Examples.areaP TauCeti.Green.Examples.areaQ (TauCeti.Green.Examples.clockwiseCircle r) t = Real.pi * (R ^ 2 - r ^ 2)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"75673b0ea47af8f822c6f896e582825e73810ca616965221a877af911a06259a","prominence":"supporting","quote":{"exact":"As a corollary of the annulus chord formula, the area bounded by"},"quote_capped":true,"section":["Regular convex polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"As a corollary of the annulus chord formula, the area bounded by the circumcircle and incircle of every unit convex regular polygon is π/4","segments":[{"text":"As a corollary of the annulus chord formula, the area bounded by the circumcircle and incircle of every unit convex regular polygon is π/4"}]},"unresolved":null},{"absence":null,"basis":"bbdeadd0d12149203b3b8940a403e1f4230835df585b1a28de8f601177e5b34f","coverage":null,"id":"enwiki-333306-1379891336::In-text #92bc0502","item":"In-text #92bc0502","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":"bbdeadd0d12149203b3b8940a403e1f4230835df585b1a28de8f601177e5b34f","module":"Mathlib.Geometry.Euclidean.Simplex","note":"The lemma also covers equilateral simplices of higher dimension, where the angle is a face angle; at a planar triangle it fixes the three-sided value of the angle formula, and it gives nothing about the exterior angles of c2 and c3.","pair_key":"8255a7c198ca2bf8cbc873db40d676f6cc7f519364fcfbd41c16dc1a112707e5","path":"Mathlib/Geometry/Euclidean/Simplex.lean","proof_status":"proved","rank":1,"relation":"hasPart","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},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanGeometry.exterior_angle_eq_angle_add_angle","end_line":328,"library":"mathlib","line":325,"location_key":"8e91583e3738adaecc586ef8663c0b2ad34d67473835fa5a7c130a668a36d37f","module":"Mathlib.Geometry.Euclidean.Triangle","note":"It states the Euclidean exterior angle theorem for a triangle; reaching the value 360 over n for a regular polygon needs the interior-angle value as a second ingredient.","pair_key":"e2b28b53f4d8ccda2e96034399d1b508c64d2ee73e49ea739a4f387749cf33a9","path":"Mathlib/Geometry/Euclidean/Triangle.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanGeometry.exterior_angle_eq_angle_add_angle {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {p₁ p₂ p₃ : P} (p : P) : Sbtw ℝ p p₁ p₂ → EuclideanGeometry.angle p₃ p₁ p = EuclideanGeometry.angle p₁ p₃ p₂ + EuclideanGeometry.angle p₃ p₂ p₁"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4d8c53ca10cf3f0741dbbda75239872f4533d9b9f4edc2ca3a8c87056229d88a","prominence":"central","quote":{"exact":"For a regular convex n-gon, each interior angle has a measure of:"},"quote_capped":true,"section":["Regular convex polygons","Angles"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For a regular convex n-gon, each interior angle has a measure of: ( n − 2 ) 180 n {\\displaystyle {\\frac {(n-2)180}{n}}} degrees; ( n − 2 ) π n {\\displaystyle {\\frac {(n-2)\\pi }{n}}} radians; or ( n − 2 ) 2 n = 1 2 − 1 n {\\displaystyle {\\frac {(n-2)}{2n}}={\\frac {1}{2}}-{\\frac {1}{n}}} full turns, and each exterior angle (i.e., supplementary to the interior angle) has a measure of 360 n {\\displaystyle {\\tfrac {360}{n}}} degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn.","segments":[{"text":"For a regular convex n-gon, each interior angle has a measure of: "},{"tex":"\\frac {(n-2)180}{n}"},{"text":" degrees; "},{"tex":"\\frac {(n-2)\\pi }{n}"},{"text":" radians; or "},{"tex":"{\\frac {(n-2)}{2n}}={\\frac {1}{2}}-{\\frac {1}{n}}"},{"text":" full turns, and each exterior angle (i.e., supplementary to the interior angle) has a measure of "},{"tex":"\\tfrac {360}{n}"},{"text":" degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"918ddbf5444aecf22df78ed28934fd5b215330c5dc615053545fa5cfd9bd7983"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #c8493a95","item":"In-text #c8493a95","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2f106190585dbacfac713b1efcf07bfa39b97e867d336f03ef6710c961686d86","prominence":"supporting","quote":{"exact":"As n approaches infinity, the internal angle approaches 180 degrees."},"quote_capped":false,"section":["Regular convex polygons","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"As n approaches infinity, the internal angle approaches 180 degrees.","segments":[{"text":"As n approaches infinity, the internal angle approaches 180 degrees."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"174b8ec7147ea6befa91d2b2e6170b7307d3101137eb024f659089438e8c7a62"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #e6b37252","item":"In-text #e6b37252","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9d83a39bc827a6ecf5af57c6c5718308b5a8d7121953ee58aaf026d33bf1d58f","prominence":"supporting","quote":{"exact":"For a regular polygon with 10,000 sides (a myriagon) the internal angle"},"quote_capped":true,"section":["Regular convex polygons","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For a regular polygon with 10,000 sides (a myriagon) the internal angle is 179.964°.","segments":[{"text":"For a regular polygon with 10,000 sides (a myriagon) the internal angle is 179.964°."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"d707810c597139c62e4c832380700ccf1eeb628eef96c495be30c7fe7850f5a1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #77d0b8e3","item":"In-text #77d0b8e3","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"55de100ac023827e222387c2b8e32bc29b72e1a3c91f5f4ddc624082e678be2e","prominence":"supporting","quote":{"exact":"As the number of sides increases, the internal angle can come very"},"quote_capped":true,"section":["Regular convex polygons","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"As the number of sides increases, the internal angle can come very close to 180°, and the shape of the polygon approaches that of a circle.","segments":[{"text":"As the number of sides increases, the internal angle can come very close to 180°, and the shape of the polygon approaches that of a circle."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"7891b81513d4975568d25a3a25e1e1f187a8b94bc322e96f1cbdb7e13a9242b1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #20a443ba","item":"In-text #20a443ba","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5599b17750cfa7b21ce863a3452f23d47d350a245df156e9a774b3ec8c364c51","prominence":"supporting","quote":{"exact":"However the polygon can never become a circle."},"quote_capped":false,"section":["Regular convex polygons","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"However the polygon can never become a circle.","segments":[{"text":"However the polygon can never become a circle."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"4e28c3f1bf7b7de624643ea70aceacd1710dacc260e4db8a7081bdd19d543a53"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #d29c8687","item":"In-text #d29c8687","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":"503af02360d8baca7d209c4c75a4d0f83a20868222a5f91583c4605146861154","module":"TauCeti.Analysis.Complex.UpperHalfPlane.Polygon.Basic","note":"Its polygons are hyperbolic ones in the upper half plane, a setting that neither contains nor sits inside the Euclidean plane of this passage.","pair_key":"1190c7c63e5f518eb840ded9dc6811ec1e5f0ad969c330bddc79137c0dddbc6f","path":"TauCeti/Analysis/Complex/UpperHalfPlane/Polygon/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","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}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"45a095d061a9aab6125b09c522e223b2eebd375c3e6aaab47f2c69e8006df5db","prominence":"supporting","quote":{"exact":"The value of the internal angle can never become exactly equal to"},"quote_capped":true,"section":["Regular convex polygons","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"after":{"layer":", as the circumference would effectively become a straight line (see apeirogon).","segments":[{"text":", as the circumference would effectively become a straight line (see apeirogon)."}]},"layer":"The value of the internal angle can never become exactly equal to 180°","segments":[{"text":"The value of the internal angle can never become exactly equal to 180°"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"a4a9bc4fd9ec7adedff7ea17d8aa8347a468f8b0f7335294eb49d468f96a02f6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #9f3ce8d9","item":"In-text #9f3ce8d9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a4f1adbf575410bbf358edcfdb2a0f69ee6c20957ad9035bc8955df7f39c44d6","prominence":"supporting","quote":{"exact":"For this reason, a circle is not a polygon with an infinite"},"quote_capped":true,"section":["Regular convex polygons","Angles"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For this reason, a circle is not a polygon with an infinite number of sides.","segments":[{"text":"For this reason, a circle is not a polygon with an infinite number of sides."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"eaa41084f344510041b93261763d14a00f2b6843a49cb20cbd133e57375556ad"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #bd7f4e98","item":"In-text #bd7f4e98","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"adeea69986cd8d773365ff48f071068a01de795e817aabaf3d8bf2a841b8052c","prominence":"central","quote":{"exact":"the number of diagonals is 1 2 n ( n − 3"},"quote_capped":true,"section":["Regular convex polygons","Diagonals"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"For n > 2 {\\displaystyle n>2} , ","segments":[{"text":"For "},{"tex":"n>2"},{"text":" , "}]},"layer":"the number of diagonals is 1 2 n ( n − 3 ) {\\displaystyle {\\tfrac {1}{2}}n(n-3)} ; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... .","segments":[{"text":"the number of diagonals is "},{"tex":"{\\tfrac {1}{2}}n(n-3)"},{"text":" ; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"fa96a481c484175b7bac1ee6b2234fad91792e84dd8f58964c6add1b83fcc70e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #2ad98016","item":"In-text #2ad98016","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a05fbce0db6c01e87de1eb34fed4d3946ab3e663844fe718aeee5a1f009116ef","prominence":"supporting","quote":{"exact":"The diagonals divide the polygon into 1, 4, 11, 24, ... pieces."},"quote_capped":false,"section":["Regular convex polygons","Diagonals"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The diagonals divide the polygon into 1, 4, 11, 24, ... pieces.","segments":[{"text":"The diagonals divide the polygon into 1, 4, 11, 24, ... pieces."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"8d1411dd9d3d1970e3666f6837c4e95e42a593de8879b4b22b0fec0f7be62d52"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #34ba61fd","item":"In-text #34ba61fd","kind":"theorem","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsPrimitiveRoot.prod_one_sub_pow_eq_order","end_line":40,"library":"mathlib","line":33,"location_key":"15997150abe18fcf24ef4e084bb2de5c750a51ff9569f90d4f8805f15b585faa","module":"Mathlib.RingTheory.RootsOfUnity.Lemmas","note":"The lemma is stated over any commutative domain, so it also covers rings the passage never speaks of; over the complex numbers it gives the signed product of the vertex differences, whose modulus is the product of distances the passage reports.","pair_key":"9d85863187dd83685233ce35df7021f97ab3e60fcfb1f9d9d1de78080c328271","path":"Mathlib/RingTheory/RootsOfUnity/Lemmas.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsPrimitiveRoot.prod_one_sub_pow_eq_order {R : Type*} [CommRing R] [IsDomain R] {n : ℕ} {μ : R} : IsPrimitiveRoot μ (n + 1) → ∏ k ∈ Finset.range n, (1 - μ ^ (k + 1)) = ↑n + 1"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"53b7fa018f316eeebba3835b79762c5d2e62d021126f3bb55540d1cbbe493a7a","prominence":"central","quote":{"exact":"For a regular n-gon inscribed in a circle of radius 1 {\\displaystyle"},"quote_capped":true,"section":["Regular convex polygons","Diagonals"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For a regular n-gon inscribed in a circle of radius 1 {\\displaystyle 1} , the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals n.","segments":[{"text":"For a regular n-gon inscribed in a circle of radius "},{"tex":"1"},{"text":" , the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals n."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"27ba6ff30618e7066d765cbaaad872eb2e6b01980378e5a33b81efd0ff9f7fc3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #12faca6b","item":"In-text #12faca6b","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6ca7cb573d32580ce762559eb61b81b57da8bd4ad9e7096a8dccb5fd90ce9f6b","prominence":"central","quote":{"exact":"For a regular simple n-gon with circumradius R and distances di from"},"quote_capped":true,"section":["Regular convex polygons","Points in the plane"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For a regular simple n-gon with circumradius R and distances di from an arbitrary point in the plane to the vertices, we have[2] 1 n ∑ i = 1 n d i 4 + 3 R 4 = ( 1 n ∑ i = 1 n d i 2 + R 2 ) 2 . {\\displaystyle {\\frac {1}{n}}\\sum _{i=1}^{n}d_{i}^{4}+3R^{4}={\\biggl (}{\\frac {1}{n}}\\sum _{i=1}^{n}d_{i}^{2}+R^{2}{\\biggr )}^{2}.}","segments":[{"text":"For a regular simple n-gon with circumradius R and distances di from an arbitrary point in the plane to the vertices, we have"},{"ref":"[2]"},{"text":" "},{"tex":"{\\frac {1}{n}}\\sum _{i=1}^{n}d_{i}^{4}+3R^{4}={\\biggl (}{\\frac {1}{n}}\\sum _{i=1}^{n}d_{i}^{2}+R^{2}{\\biggr )}^{2}."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"1097e3eaf4b99f1112f61f4cfb3ed3a15b14b1ec0de5fcd6047f667cd50ed9db"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #7df0cd40","item":"In-text #7df0cd40","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1706fbf139aa6c22fd000db15bcadbb1f4a8b881250d62512256e4506b6dcb2b","prominence":"central","quote":{"exact":"For higher powers of distances d i {\\displaystyle d_{i}} from an arbitrary"},"quote_capped":true,"section":["Regular convex polygons","Points in the plane"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For higher powers of distances d i {\\displaystyle d_{i}} from an arbitrary point in the plane to the vertices of a regular n-gon, if S n ( 2 m ) = 1 n ∑ i = 1 n d i 2 m {\\displaystyle S_{n}^{(2m)}={\\frac {1}{n}}\\sum _{i=1}^{n}d_{i}^{2m}} , then[3] S n ( 2 m ) = ( S n ( 2 ) ) m + ∑ k = 1 ⌊ m / 2 ⌋ ( m 2 k ) ( 2 k k ) R 2 k ( S n ( 2 ) − R 2 ) k ( S n ( 2 ) ) m − 2 k {\\displaystyle S_{n}^{(2m)}=\\left(S_{n}^{(2)}\\right)^{m}+\\sum _{k=1}^{\\left\\lfloor m/2\\right\\rfloor }{\\binom {m}{2k}}{\\binom {2k}{k}}R^{2k}\\left(S_{n}^{(2)}-R^{2}\\right)^{k}\\left(S_{n}^{(2)}\\right)^{m-2k}} , and S n ( 2 m ) = ( S n ( 2 ) ) m + ∑ k = 1 ⌊ m / 2 ⌋ 1 2 k ( m 2 k ) ( 2 k k ) ( S n ( 4 ) − ( S n ( 2 ) ) 2 ) k ( S n ( 2 ) ) m − 2 k {\\displaystyle S_{n}^{(2m)}=\\left(S_{n}^{(2)}\\right)^{m}+\\sum _{k=1}^{\\left\\lfloor m/2\\right\\rfloor }{\\frac {1}{2^{k}}}{\\binom {m}{2k}}{\\binom {2k}{k}}\\left(S_{n}^{(4)}-\\left(S_{n}^{(2)}\\right)^{2}\\right)^{k}\\left(S_{n}^{(2)}\\right)^{m-2k}} , where m is a positive integer less than n.","segments":[{"text":"For higher powers of distances "},{"tex":"d_{i}"},{"text":" from an arbitrary point in the plane to the vertices of a regular n-gon, if "},{"tex":"S_{n}^{(2m)}={\\frac {1}{n}}\\sum _{i=1}^{n}d_{i}^{2m}"},{"text":" , then"},{"ref":"[3]"},{"text":" "},{"tex":"S_{n}^{(2m)}=\\left(S_{n}^{(2)}\\right)^{m}+\\sum _{k=1}^{\\left\\lfloor m/2\\right\\rfloor }{\\binom {m}{2k}}{\\binom {2k}{k}}R^{2k}\\left(S_{n}^{(2)}-R^{2}\\right)^{k}\\left(S_{n}^{(2)}\\right)^{m-2k}"},{"text":" , and "},{"tex":"S_{n}^{(2m)}=\\left(S_{n}^{(2)}\\right)^{m}+\\sum _{k=1}^{\\left\\lfloor m/2\\right\\rfloor }{\\frac {1}{2^{k}}}{\\binom {m}{2k}}{\\binom {2k}{k}}\\left(S_{n}^{(4)}-\\left(S_{n}^{(2)}\\right)^{2}\\right)^{k}\\left(S_{n}^{(2)}\\right)^{m-2k}"},{"text":" , where m is a positive integer less than n."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"1136fb7c06b3af6cbb110e2aea59dea5522654be5a0c5c3f837458532bb3c098"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #c98b8fdb","item":"In-text #c98b8fdb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"48258457236c05f150ab17e50542bac47f261536d9bffa584aaac3971b474f74","prominence":"central","quote":{"exact":"If L is the distance from an arbitrary point in the plane"},"quote_capped":true,"section":["Regular convex polygons","Points in the plane"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"If L is the distance from an arbitrary point in the plane to the centroid of a regular n-gon with circumradius R, then[3] ∑ i = 1 n d i 2 m = n ( ( R 2 + L 2 ) m + ∑ k = 1 ⌊ m / 2 ⌋ ( m 2 k ) ( 2 k k ) R 2 k L 2 k ( R 2 + L 2 ) m − 2 k ) {\\displaystyle \\sum _{i=1}^{n}d_{i}^{2m}=n\\left(\\left(R^{2}+L^{2}\\right)^{m}+\\sum _{k=1}^{\\left\\lfloor m/2\\right\\rfloor }{\\binom {m}{2k}}{\\binom {2k}{k}}R^{2k}L^{2k}\\left(R^{2}+L^{2}\\right)^{m-2k}\\right)} , where m = 1 , 2 , … , n − 1 {\\displaystyle m=1,2,\\dots ,n-1} .","segments":[{"text":"If L is the distance from an arbitrary point in the plane to the centroid of a regular n-gon with circumradius R, then"},{"ref":"[3]"},{"text":" "},{"tex":"\\sum _{i=1}^{n}d_{i}^{2m}=n\\left(\\left(R^{2}+L^{2}\\right)^{m}+\\sum _{k=1}^{\\left\\lfloor m/2\\right\\rfloor }{\\binom {m}{2k}}{\\binom {2k}{k}}R^{2k}L^{2k}\\left(R^{2}+L^{2}\\right)^{m-2k}\\right)"},{"text":" , where "},{"tex":"m=1,2,\\dots ,n-1"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"f51069f55459c239982a92e98721d5a50a8a9cbd3969fe9f0860842c68bcd070","coverage":null,"id":"enwiki-333306-1379891336::In-text #28ed609c","item":"In-text #28ed609c","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.viviani_general","library":"atlas","line":192,"location_key":"f51069f55459c239982a92e98721d5a50a8a9cbd3969fe9f0860842c68bcd070","module":"MathlibExt.Geometry.Euclidean.Viviani","note":"The declaration fixes the Euclidean plane and an equilateral triangle, so it is the passage read at n equal to three, and it writes the right-hand side as the altitude rather than as three apothems.","pair_key":"56657ef539a06d6ce2d6e6cbac2ad4ea966924080edc370f2209b4a4ab1b17b0","path":"MathlibExt/Geometry/Euclidean/Viviani.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.viviani_general (A B C P : EuclideanSpace ℝ (Fin 2)) : Dist.dist A B = Dist.dist B C → Dist.dist B C = Dist.dist C A → P ∈ interior ((convexHull ℝ) {A, B, C}) → Metric.infDist P ↑line[ℝ, A, B] + Metric.infDist P ↑line[ℝ, B, C] + Metric.infDist P ↑line[ℝ, C, A] = Metric.infDist A ↑line[ℝ, B, C]"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.viviani","library":"atlas","line":258,"location_key":"74abd607504b8c51ba0be9591e0783ab891874da9f2c195e2ea7916597c07daa","module":"MathlibExt.Geometry.Euclidean.Viviani","note":"A wrapper of the preceding theorem that keeps an unused positivity hypothesis on the side length, which rules out only the degenerate triangle of side zero.","pair_key":"734676ebb5125e4aa8d414627cbb27a9317a277d8a2b958fa43b2e04033bd8eb","path":"MathlibExt/Geometry/Euclidean/Viviani.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.viviani (A B C P : EuclideanSpace ℝ (Fin 2)) : Dist.dist A B = Dist.dist B C → Dist.dist B C = Dist.dist C A → 0 < Dist.dist A B → P ∈ interior ((convexHull ℝ) {A, B, C}) → Metric.infDist P ↑line[ℝ, A, B] + Metric.infDist P ↑line[ℝ, B, C] + Metric.infDist P ↑line[ℝ, C, A] = Metric.infDist A ↑line[ℝ, B, C]"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ca5af9d0574e82b68eb038b5266109473255b38f4b6bc79a67d965f953925074","prominence":"central","quote":{"exact":"For a regular n-gon, the sum of the perpendicular distances from any"},"quote_capped":true,"section":["Regular convex polygons","Points in the plane","Interior points"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For a regular n-gon, the sum of the perpendicular distances from any interior point to the n sides is n times the apothem[4]: p. 72 (the apothem being the distance from the center to any side).","segments":[{"text":"For a regular n-gon, the sum of the perpendicular distances from any interior point to the n sides is n times the apothem"},{"ref":"[4]: p. 72"},{"text":" (the apothem being the distance from the center to any side)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"23f2eac483af6dd31733ab3011bc8449259d87e69351f99945dcb87110b54c9f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #136089fb","item":"In-text #136089fb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c3cd949031e9c1fcc81a8c0fa2e2850e8c0a5c0c602397bb17e13b739326dcf9","prominence":"central","quote":{"exact":"The circumradius R from the center of a regular polygon to one"},"quote_capped":true,"section":["Regular convex polygons","Circumradius"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The circumradius R from the center of a regular polygon to one of the vertices is related to the side length s or to the apothem a by R = s 2 sin ⁡ ( π n ) = a cos ⁡ ( π n ) , a = s 2 tan ⁡ ( π n ) {\\displaystyle R={\\frac {s}{2\\sin \\left({\\frac {\\pi }{n}}\\right)}}={\\frac {a}{\\cos \\left({\\frac {\\pi }{n}}\\right)}}\\quad _{,}\\quad a={\\frac {s}{2\\tan \\left({\\frac {\\pi }{n}}\\right)}}}","segments":[{"text":"The circumradius R from the center of a regular polygon to one of the vertices is related to the side length s or to the apothem a by "},{"tex":"R={\\frac {s}{2\\sin \\left({\\frac {\\pi }{n}}\\right)}}={\\frac {a}{\\cos \\left({\\frac {\\pi }{n}}\\right)}}\\quad _{,}\\quad a={\\frac {s}{2\\tan \\left({\\frac {\\pi }{n}}\\right)}}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"15b8d27a5bc1de936afa089ebee56867e76d1cf1b75155efeba5d7d560be8fea"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #c16cb22f","item":"In-text #c16cb22f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cf4176d27c20b35549b30dac6f8e07f7e5a9a7216e0c89dae4ffc9a3ab42e81e","prominence":"central","quote":{"exact":"The sum of the perpendiculars from a regular n-gon's vertices to any"},"quote_capped":true,"section":["Regular convex polygons","Circumradius"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The sum of the perpendiculars from a regular n-gon's vertices to any line tangent to the circumcircle equals n times the circumradius.","segments":[{"text":"The sum of the perpendiculars from a regular n-gon's vertices to any line tangent to the circumcircle equals n times the circumradius."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"85432eb18b9aed4d238b4760a0f7a2bd3305db763f9515af210bc6bc0c6e0d0c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #8893dc06","item":"In-text #8893dc06","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"8702f23624e545aa403cee35bcbae500712a3a542e3cfa397ff632cf43b7272b","module":"FormalConjectures.ErdosProblems.«94»","note":"A definition of the vertex set of a regular n-gon inscribed in the unit circle, with no distance identity attached.","pair_key":"fe2019c79f787bef1ed84d2cd3369aee210930e102a1b54a141549a6972f4dad","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":1,"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":"0f42f37d6e756d86b524a5c004d042b422f2aff187b06ba8f2f2b2dc5fd32a96","prominence":"central","quote":{"exact":"The sum of the squared distances from the vertices of a regular"},"quote_capped":true,"section":["Regular convex polygons","Circumradius"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR2 where R is the circumradius.","segments":[{"text":"The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR2 where R is the circumradius."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"392c0c2faccc882402f48f948bf7093f890278433e0829d6e26ab0aa5d4c87cf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #d575dfc0","item":"In-text #d575dfc0","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"3dcf11d6c794a68983ee67a32a4ddc5fc412d80e03e4e6a91116f50e211500a4","module":"FormalConjectures.ErdosProblems.«94»","note":"It fixes the vertices of a regular n-gon on the unit circle, and nothing about the midpoints of its sides.","pair_key":"16e32ab53bfb26e91cc3328e119d4e435708252fe864512a12df5837e6e13279","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":1,"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":"2ff7ebddded01dfd883eb0ee7f3cf6c9760353ed4cbd2ce15d8e1ca0a2f5eb1a","prominence":"central","quote":{"exact":"The sum of the squared distances from the midpoints of the sides"},"quote_capped":true,"section":["Regular convex polygons","Circumradius"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR2 − ⁠1/4⁠ns2, where s is the side length and R is the circumradius.","segments":[{"text":"The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR2 − ⁠1/4⁠ns2, where s is the side length and R is the circumradius."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"fdb1fcdba3ad71c51cf8a011f10e41ec48a624dabf2792326c2812bd4f6e5b82"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #aaa3f250","item":"In-text #aaa3f250","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"a571ffd617d5f3ed0d6214381f1657456ff4c4a3acc751a861aead3a1a851350","module":"FormalConjectures.ErdosProblems.«94»","note":"The regular n-gon on the unit circle is defined here, but no relation between second and fourth power sums of distances appears.","pair_key":"026e116c1e4106ec9782b9139644090642b5630411f25a5e123efea8ca3cf0ea","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":1,"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":"19f1c5b41490e5cd4d1490a243e0ab1f4396c639099259447dab645af7fbbe5e","prominence":"central","quote":{"exact":"If d i {\\displaystyle d_{i}} are the distances from the vertices of"},"quote_capped":true,"section":["Regular convex polygons","Circumradius"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"If d i {\\displaystyle d_{i}} are the distances from the vertices of a regular n {\\displaystyle n} -gon to any point on its circumcircle, then[3] 3 ( ∑ i = 1 n d i 2 ) 2 = 2 n ∑ i = 1 n d i 4 {\\displaystyle 3{\\biggl (}\\sum _{i=1}^{n}d_{i}^{2}{\\biggr )}^{2}=2n\\sum _{i=1}^{n}d_{i}^{4}} .","segments":[{"text":"If "},{"tex":"d_{i}"},{"text":" are the distances from the vertices of a regular "},{"tex":"n"},{"text":" -gon to any point on its circumcircle, then"},{"ref":"[3]"},{"text":" "},{"tex":"3{\\biggl (}\\sum _{i=1}^{n}d_{i}^{2}{\\biggr )}^{2}=2n\\sum _{i=1}^{n}d_{i}^{4}"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"7abfc81b8bd627c50c88dbb3c88562d30bd587eddd4f591c2d7c441d531e41cb"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #2cdd0909","item":"In-text #2cdd0909","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bd9cf22f9b906904f768efd50c49c24920b30d0f013d169a41e44578afb580c0","prominence":"central","quote":{"exact":"Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel"},"quote_capped":true,"section":["Regular convex polygons","Dissections"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel and of equal length) can be dissected into ( m 2 ) {\\displaystyle {\\tbinom {m}{2}}} or ⁠1/2⁠m(m − 1) parallelograms.","segments":[{"text":"Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel and of equal length) can be dissected into "},{"tex":"\\tbinom {m}{2}"},{"text":" or ⁠1/2⁠m(m − 1) parallelograms."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"88fd8e80b32f0f4a261981c725797051dc4595566ac57e170587e22e3770b6a5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #3a84c5ee","item":"In-text #3a84c5ee","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"82bc4a640298f7eba6b3a2b91a9c57fcae747918306f7361cfcb67ef36c7cec1","prominence":"supporting","quote":{"exact":"These tilings are contained as subsets of vertices, edges and faces in"},"quote_capped":true,"section":["Regular convex polygons","Dissections"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"These tilings are contained as subsets of vertices, edges and faces in orthogonal projections m-cubes.","segments":[{"text":"These tilings are contained as subsets of vertices, edges and faces in orthogonal projections m-cubes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"38ad24bc8c85de8067fab90b8d472f3986e35aa40304343cd2492a408be991b5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #89fadf41","item":"In-text #89fadf41","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2d9cec9b2f841bbdba4533fa94b8e0cf95b37d47eb8b6b0f248c987259460ffd","prominence":"supporting","quote":{"exact":"In particular, this is true for any regular polygon with an even"},"quote_capped":true,"section":["Regular convex polygons","Dissections"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"In particular, this is true for any regular polygon with an even number of sides, in which case the parallelograms are all rhombi.","segments":[{"text":"In particular, this is true for any regular polygon with an even number of sides, in which case the parallelograms are all rhombi."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"192685baafb68bd008ef1b92534df616e94e2b6653b979118fea92e91e55e5d4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #fe49c156","item":"In-text #fe49c156","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2bf18073fa4bd89aec00546a8e74c9f8f0ae83e4aeed214d7da270dd2eaac375","prominence":"supporting","quote":{"exact":"Regular polygons with 4m+2 sides can be dissected in a way with"},"quote_capped":true,"section":["Regular convex polygons","Dissections"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Regular polygons with 4m+2 sides can be dissected in a way with (2m+1)-fold radial symmetry.","segments":[{"text":"Regular polygons with 4m+2 sides can be dissected in a way with (2m+1)-fold radial symmetry."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"db0028060ee56cf05682467b625e4d606abb7a50b7c4602dfc3bae92357c1c87"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #1ece284f","item":"In-text #1ece284f","kind":"theorem","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA64313.area","end_line":36,"library":"formal-conjectures","line":35,"location_key":"c63bc7c56126c1b20bc315cdc26e07ef63b1e28cc02e39ee192e24c4893a57a6","module":"FormalConjectures.OEIS.«64313»","note":"A function of type natural to real documented as the area of a regular n-gon of unit side; being a definition it asserts no equality with the passage's trigonometric expressions.","pair_key":"d6d3ae32046779eff03dd33544f5e25b5489aec2ea72e33f8366f250bb465740","path":"FormalConjectures/OEIS/64313.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def OeisA64313.area : ℕ → ℝ"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Green.Examples.curveIntegral_area_polygon","end_line":51,"library":"tauceti","line":44,"location_key":"01b2cb96ea606988331d5465b263efac5a4229b00dc31d882bd6c35bae94e4ee","module":"TauCeti.Analysis.Green.Examples.Shoelace","note":"The shoelace sum for the signed-area circulation around any polygonal chain, in terms of vertex coordinates rather than side, apothem or circumradius.","pair_key":"bc34f8f2df1e3acfaae5c5811248ad1a16d1508ae6eddb82b6a67686f49ac882","path":"TauCeti/Analysis/Green/Examples/Shoelace.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","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}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"39c12f5cf05c16759a90edbf55fe0f0369fa8ccae8c42e6060b121166effa6a1","prominence":"central","quote":{"exact":"The area A of a convex regular n-sided polygon having side s,"},"quote_capped":true,"section":["Regular convex polygons","Area"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The area A of a convex regular n-sided polygon having side s, circumradius R, apothem a, and perimeter p is given by[8][9] A = 1 2 n s a = 1 2 p a = 1 4 n s 2 cot ⁡ ( π n ) = n a 2 tan ⁡ ( π n ) = 1 2 n R 2 sin ⁡ ( 2 π n ) {\\displaystyle {\\begin{aligned}A&={\\tfrac {1}{2}}nsa\\\\&={\\tfrac {1}{2}}pa\\\\&={\\tfrac {1}{4}}ns^{2}\\cot \\left({\\tfrac {\\pi }{n}}\\right)\\\\&=na^{2}\\tan \\left({\\tfrac {\\pi }{n}}\\right)\\\\&={\\tfrac {1}{2}}nR^{2}\\sin \\left({\\tfrac {2\\pi }{n}}\\right)\\end{aligned}}}","segments":[{"text":"The area A of a convex regular n-sided polygon having side s, circumradius R, apothem a, and perimeter p is given by"},{"ref":"[8][9]"},{"text":" "},{"display":true,"tex":"\\begin{aligned}A&={\\tfrac {1}{2}}nsa\\\\&={\\tfrac {1}{2}}pa\\\\&={\\tfrac {1}{4}}ns^{2}\\cot \\left({\\tfrac {\\pi }{n}}\\right)\\\\&=na^{2}\\tan \\left({\\tfrac {\\pi }{n}}\\right)\\\\&={\\tfrac {1}{2}}nR^{2}\\sin \\left({\\tfrac {2\\pi }{n}}\\right)\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"8ac53ece2a189fe89de40bb9870a0ca54670d6202ea22f9e1409508af26543bf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #55223ac7","item":"In-text #55223ac7","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.tendsto_tan_div_nhdsNE_zero","end_line":75,"library":"mathlib","line":73,"location_key":"e49eb4daf9870f71d2a6b1c2a1fd2b34247f9ccef7664e72c9154193abda9bc4","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv","note":"It states the reciprocal comparison, tangent against the identity, at the punctured origin.","pair_key":"4127688aef9d14b43c3b91cf106077a1b48be076877cac45eb07c014faa8a0d6","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/ArctanDeriv.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.tendsto_tan_div_nhdsNE_zero : Filter.Tendsto (fun x ↦ Real.tan x / x) (𝓝[≠] 0) (𝓝 1)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.isEquivalent_sin","end_line":334,"library":"mathlib","line":334,"location_key":"4f62156b518fd7b6f5020621bd4b3f255d49b68e7e7c43e584e6b611acdb5dea","module":"Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv","note":"It compares the sine with the identity map near the origin.","pair_key":"af2d7ad4a7cdd43bd78dcea9e1e73d5dc5b47b32e6d3ec0f031fae42743052a9","path":"Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.isEquivalent_sin : Asymptotics.IsEquivalent (𝓝 0) Real.sin id"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"033580b9ff83021cd30a20770253371a33ef409f666f61a3a1c8702f83c6a081","prominence":"supporting","quote":{"exact":"(Since cot ⁡ x → 1 / x {\\displaystyle \\cot x\\rightarrow 1/x}"},"quote_capped":true,"section":["Regular convex polygons","Area"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"after":{"layer":" , the area when s = 1 {\\displaystyle s=1} tends to n 2 / 4 π {\\displaystyle n^{2}/4\\pi } as n {\\displaystyle n} grows large.)","segments":[{"text":" , the area when "},{"tex":"s=1"},{"text":" tends to "},{"tex":"n^{2}/4\\pi"},{"text":" as "},{"tex":"n"},{"text":" grows large.)"}]},"before":{"layer":"For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:[b] ","segments":[{"text":"For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:"},{"ref":"[b]"},{"text":" "}]},"layer":"(Since cot ⁡ x → 1 / x {\\displaystyle \\cot x\\rightarrow 1/x} as x → 0 {\\displaystyle x\\rightarrow 0}","segments":[{"text":"(Since "},{"tex":"\\cot x\\rightarrow 1/x"},{"text":" as "},{"tex":"x\\rightarrow 0"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"6b702f0926385321c40142a10a73c7292a5781553c3ecbbe80843e11659841d3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #970f3df6","item":"In-text #970f3df6","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"OeisA64313.area","end_line":36,"library":"formal-conjectures","line":35,"location_key":"d1fb86a50cb5978568a9eeb424cc0435a9a3862a8b9fade5e052c552d43b4777","module":"FormalConjectures.OEIS.«64313»","note":"It is the exact area of the unit-sided regular polygon with the given number of sides.","pair_key":"cb57504641562bb493da13d52ec2a53a3ca0ff0f0314d6ebb9a88b5cb02cd9d5","path":"FormalConjectures/OEIS/64313.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def OeisA64313.area : ℕ → ℝ"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"OeisA64313.conjecture","end_line":112,"library":"formal-conjectures","line":110,"location_key":"dbbc63ed099872defc9b7b164c8e0e2f688a959834553a01454559d3dc7e91a5","module":"FormalConjectures.OEIS.«64313»","note":"It equates the rounded-down area with a floor expression involving the squared side count over four pi.","pair_key":"e39a19430edf2378c58be4c6c769da4bbd0c61223fa4d9c987da50595de8fba5","path":"FormalConjectures/OEIS/64313.lean","proof_status":"statement_only","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem OeisA64313.conjecture (n : ℕ) : 3 ≤ n → OeisA64313.a n = ⌊↑n ^ 2 / (4 * π) - π / 12⌋.toNat"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"37fbbc2d49e715661fbaf090d447579fb29cc376e9e8f0135075f373e7c89460","prominence":"supporting","quote":{"exact":"the area when s = 1 {\\displaystyle s=1} tends to n 2"},"quote_capped":true,"section":["Regular convex polygons","Area"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:[b] (Since cot ⁡ x → 1 / x {\\displaystyle \\cot x\\rightarrow 1/x} as x → 0 {\\displaystyle x\\rightarrow 0} , ","segments":[{"text":"For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:"},{"ref":"[b]"},{"text":" (Since "},{"tex":"\\cot x\\rightarrow 1/x"},{"text":" as "},{"tex":"x\\rightarrow 0"},{"text":" , "}]},"layer":"the area when s = 1 {\\displaystyle s=1} tends to n 2 / 4 π {\\displaystyle n^{2}/4\\pi } as n {\\displaystyle n} grows large.)","segments":[{"text":"the area when "},{"tex":"s=1"},{"text":" tends to "},{"tex":"n^{2}/4\\pi"},{"text":" as "},{"tex":"n"},{"text":" grows large.)"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"9cb85d6f6f60ee2beedc7e7fe85d6db9bab00b32330c176b8820ac83127e8193"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #5cfba2fe","item":"In-text #5cfba2fe","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.isoperimetric_inequality","library":"atlas","line":23,"location_key":"122031cb2270a5d7c4c70dbb2e2519b36b83b787a4ce290c06dda541cc629630","module":"WantedExt.Analysis.Geometry.IsoperimetricInequalityWanted","note":"It bounds the enclosed area by the squared boundary length for rectifiable closed curves, with equality exactly for circles.","pair_key":"f2ea1d2fb4633e6d9ac7ba392851699fbdf5e3cc2014cc0d65626c0dda832f8d","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":"2a410db49712dfcde7a1768748b1099bd8529ef7e724e5adcaf9e59a859bd96b","prominence":"central","quote":{"exact":"Of all n-gons with a given perimeter, the one with the largest"},"quote_capped":true,"section":["Regular convex polygons","Area"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Of all n-gons with a given perimeter, the one with the largest area is regular.","segments":[{"text":"Of all n-gons with a given perimeter, the one with the largest area is regular."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"2fc6ba136c02b477b302fae9e807abdd96d974927e19ed51523edc951f17e9f5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #3059e93f","item":"In-text #3059e93f","kind":"theorem","locations":[{"challenge":"downgraded","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.angle_trisection_impossible","library":"atlas","line":425,"location_key":"386bfbb23922863fdccd012ce7e0f28408c696a10cbc2a5f229bd0ebd2fdc287","module":"MathlibExt.Geometry.Euclidean.AngleTrisectionImpossible","note":"The declaration is aimed at trisecting an angle, and the cosine it rules out belongs to the eighteen-sided regular polygon; the number pi over nine equals two pi over eighteen by arithmetic alone.","pair_key":"00166a781b2f5f7bd18ad74f04ae3b6ed35866ff79f32cb82a60f70963afc747","path":"MathlibExt/Geometry/Euclidean/AngleTrisectionImpossible.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":true,"text":"theorem MetaMathlibExt.angle_trisection_impossible (IsConstructible IsConstructibleAngle : ℝ → Prop) : … → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (π / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (π / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)","type":"∀ (IsConstructible IsConstructibleAngle : ℝ → Prop), (∀ (x : ℝ), IsConstructible x ↔ ∃ n K, K 0 = ⊥ ∧ x ∈ K (Fin.last n) ∧ ∀ (i : Fin n), K i.castSucc ≤ K i.succ ∧ ∃ b ∈ K i.succ, b ^ 2 ∈ K i.castSucc ∧ ∀ y ∈ K i.succ, ∃ u v, u ∈ K i.castSucc ∧ v ∈ K i.castSucc ∧ y = u + b * v) → (∀ (θ : ℝ), IsConstructibleAngle θ ↔ IsConstructible (Real.cos θ)) → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (Real.pi / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (Real.pi / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon","library":"atlas","line":82,"location_key":"8f47b23ac1b8917a0690d9d654aace0a1ad0c7bbc7ba8ef39a1de29b6ee0abec","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"It characterises which side counts give a constructible regular polygon by an arithmetic condition.","pair_key":"fcd8e0bdb404dc8016a6325853121005f2f2488cb5b81f3efc03bd739c3676ce","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"wanted","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f185d8c15024012ce8637fa9a46fe5d9c431a68a16672f42127b6fc30046db29","prominence":"supporting","quote":{"exact":"other regular polygons are not constructible at all."},"quote_capped":false,"section":["Constructible polygon"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"Some regular polygons are easy to construct with compass and straightedge; ","segments":[{"text":"Some regular polygons are easy to construct with compass and straightedge; "}]},"layer":"other regular polygons are not constructible at all.","segments":[{"text":"other regular polygons are not constructible at all."}]},"unresolved":null},{"absence":null,"basis":"30da4cd948e7c384c51e160dd88cc44359ecccf498bb8a0025fcf2cfbba2db3f","coverage":null,"id":"enwiki-333306-1379891336::In-text #c6574f4a","item":"In-text #c6574f4a","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon","library":"atlas","line":82,"location_key":"30da4cd948e7c384c51e160dd88cc44359ecccf498bb8a0025fcf2cfbba2db3f","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"The attribution to Gauss and the year are historical and no declaration carries them; the declaration phrases polygon constructibility through constructibility of the cosine of the central angle.","pair_key":"1f631fa764049166c88b148f335e06350ee9f0134922f494af27e71eb93ff828","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"wanted","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.fermatNumber_two","end_line":39,"library":"mathlib","line":39,"location_key":"042aad7c4cd500a67e07d0de5a388c83a6931fb144481eb5d3e59ae991cef993","module":"Mathlib.NumberTheory.Fermat","note":"It records that the Fermat number of index two is seventeen.","pair_key":"c593ac853473ff15e772f43b57102b7b1239bd3050d3c06fec9df687ff99adfa","path":"Mathlib/NumberTheory/Fermat.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.fermatNumber_two : Nat.fermatNumber 2 = 17"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3c6ee7d631ebbd9691eb2b015aa9944b17b085caa81de2f280c627dabfd02cb5","prominence":"central","quote":{"exact":"Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796."},"quote_capped":false,"section":["Constructible polygon"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796.","segments":[{"text":"Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796."}]},"unresolved":null},{"absence":null,"basis":"b66d826a5f96447d14235c24dadd4a08b9c9f780381cb6374ec65974862c8ee2","coverage":null,"id":"enwiki-333306-1379891336::In-text #542bb81b","item":"In-text #542bb81b","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon","library":"atlas","line":82,"location_key":"b66d826a5f96447d14235c24dadd4a08b9c9f780381cb6374ec65974862c8ee2","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"It gives both directions where the passage claims one, and phrases polygon constructibility through constructibility of the cosine of the central angle; the counts one and two it leaves aside are the degenerate monogon and digon, for which the claim is empty.","pair_key":"c8bd2edb434aa5d9ec8c2d57cbfb4356abf29b8f77f1bfc7ef19e32abea2fc60","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"wanted","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber","library":"atlas","line":73,"location_key":"5e2fe6c48493e197bfab6b9f674b5913f32d7a5c6c89729ed1d96191812c5e0a","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"It names the arithmetic condition on a side count that the theorem uses.","pair_key":"5cc409291db7e976b2b49f87126a8b91f14e6a6f54af388bf7f7e0d300e44e4c","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber : ℕ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6aa1e94b7f922acdab7c8a2a9b533b42139fbdd796be7c5dcb2443ca71b2cfbc","prominence":"central","quote":{"exact":"A regular n-gon can be constructed with compass and straightedge if n"},"quote_capped":true,"section":["Constructible polygon"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"This theory allowed him to formulate a sufficient condition for the constructibility of regular polygons: ","lead_in":true,"segments":[{"text":"This theory allowed him to formulate a sufficient condition for the constructibility of regular polygons: "}]},"layer":"A regular n-gon can be constructed with compass and straightedge if n is the product of a power of 2 and any number of distinct Fermat primes (including none).","segments":[{"text":"A regular n-gon can be constructed with compass and straightedge if n is the product of a power of 2 and any number of distinct Fermat primes (including none)."}]},"unresolved":null},{"absence":null,"basis":"52c71fe082b1301e55bb9b7fd6654e5e3cd1be682bd87214c8bcf31072bf0380","coverage":null,"id":"enwiki-333306-1379891336::In-text #79a2d868","item":"In-text #79a2d868","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.IsFermatPrime","library":"atlas","line":28,"location_key":"52c71fe082b1301e55bb9b7fd6654e5e3cd1be682bd87214c8bcf31072bf0380","module":"MathlibExt.NumberTheory.FermatPrime","note":"It is written through Mathlib's Fermat-number function, itself defined by that very formula, and it names the same notion the passage introduces.","pair_key":"3063977005f9f093da90a123b9f6463d2005427286d43cd14271905873c24b12","path":"MathlibExt/NumberTheory/FermatPrime.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.IsFermatPrime : ℕ → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.fermatNumber","end_line":35,"library":"mathlib","line":35,"location_key":"dc08e618b064b3ceb4f81a5e52c671489eadbf6d632a7f52c4ca323ff53bf39e","module":"Mathlib.NumberTheory.Fermat","note":"It defines the numbers of the shape the passage names, without any primality requirement.","pair_key":"67cbba365028a3a7f1da3b5183143b2deee7830698e1f0a0dca7af09225efdf7","path":"Mathlib/NumberTheory/Fermat.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.fermatNumber : ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1c99ad272c895ff603804f26b3c2625706ac4d022608e6647c5ebabffd54d18a","prominence":"central","quote":{"exact":"A Fermat prime is a prime number of the form 2 ("},"quote_capped":true,"section":["Constructible polygon"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A Fermat prime is a prime number of the form 2 ( 2 n ) + 1 {\\displaystyle 2^{\\left(2^{n}\\right)}+1} .","segments":[{"text":"A Fermat prime is a prime number of the form "},{"tex":"2^{\\left(2^{n}\\right)}+1"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"bb614c37c0ff6ae334987b512e0bb2685d69fb661db20c82958781e999c29814"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #9d75557c","item":"In-text #9d75557c","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible","library":"atlas","line":61,"location_key":"4f54e37399ace5f72f72270d321c3a83ffc0c4ae242d01cf533225ecf9a4cf1a","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"It defines the constructible reals as the smallest subfield of the reals closed under square roots.","pair_key":"ccbb475f6509e0c57cd37f85b6675cd3df8e7c65ad502e593aa2aef2b80cbfe0","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"inductive MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible : ℝ → Prop"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.angle_trisection_impossible","library":"atlas","line":425,"location_key":"0850d91b411aa23b22510daa5a348433c943e9ff89479991c6976aa561944e91","module":"MathlibExt.Geometry.Euclidean.AngleTrisectionImpossible","note":"It takes the criterion that an angle is constructible exactly when its cosine is, as a hypothesis of its own.","pair_key":"fa6681d65a53781165c9a9df7bc850fe187a6f9732783f5aab1a2bde9ad59ee1","path":"MathlibExt/Geometry/Euclidean/AngleTrisectionImpossible.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":true,"text":"theorem MetaMathlibExt.angle_trisection_impossible (IsConstructible IsConstructibleAngle : ℝ → Prop) : … → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (π / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (π / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)","type":"∀ (IsConstructible IsConstructibleAngle : ℝ → Prop), (∀ (x : ℝ), IsConstructible x ↔ ∃ n K, K 0 = ⊥ ∧ x ∈ K (Fin.last n) ∧ ∀ (i : Fin n), K i.castSucc ≤ K i.succ ∧ ∃ b ∈ K i.succ, b ^ 2 ∈ K i.castSucc ∧ ∀ y ∈ K i.succ, ∃ u v, u ∈ K i.castSucc ∧ v ∈ K i.castSucc ∧ y = u + b * v) → (∀ (θ : ℝ), IsConstructibleAngle θ ↔ IsConstructible (Real.cos θ)) → Irreducible (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) ∧ (Polynomial.aeval (Real.cos (Real.pi / 9))) (8 * Polynomial.X ^ 3 - 6 * Polynomial.X - 1) = 0 ∧ ¬IsConstructible (Real.cos (Real.pi / 9)) ∧ ¬∀ (θ : ℝ), IsConstructibleAngle θ → IsConstructibleAngle (θ / 3)"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon","library":"atlas","line":82,"location_key":"76f9b7f5562385eeed32dfc22229e4c59bb32585beaf37dc37f813058cdbdf31","module":"WantedExt.NumberTheory.GaussWantzelWanted","note":"It already speaks of the cosine of the central angle when it characterises constructible side counts.","pair_key":"2f305649087f7b19e857909e2f381973041f6ac1f0f5091402029f3e2dd7066f","path":"WantedExt/NumberTheory/GaussWantzelWanted.lean","proof_status":"wanted","rank":3,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.gauss_wantzel_constructible_polygon (n : ℕ) : 3 ≤ n → (MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.IsConstructible (Real.cos (2 * π / ↑n)) ↔ MathlibExt.NumberTheory.GaussWantzelWanted.NumberTheory.GaussWantzel.GaussWantzelNumber n)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f09663149d36c6747faf7c5cd1bf71a1dc4efcec1688f88dd675e47662e2c511","prominence":"central","quote":{"exact":"Equivalently, a regular n-gon is constructible if and only if the cosine"},"quote_capped":true,"section":["Constructible polygon"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Equivalently, a regular n-gon is constructible if and only if the cosine of its common angle is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots.","segments":[{"text":"Equivalently, a regular n-gon is constructible if and only if the cosine of its common angle is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"ed1eeab0aab570816e247382cc7e75fdf925078a3413529bc9a83c2e499761b8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #452940cd","item":"In-text #452940cd","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e2bf4e194eee7cb9e23765b28bd7655839643fdf46e12a99619e5506079bd42a","prominence":"supporting","quote":{"exact":"The cube contains a skew regular hexagon, seen as 6 red edges"},"quote_capped":true,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The cube contains a skew regular hexagon, seen as 6 red edges zig-zagging between two planes perpendicular to the cube's diagonal axis.","segments":[{"text":"The cube contains a skew regular hexagon, seen as 6 red edges zig-zagging between two planes perpendicular to the cube's diagonal axis."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"0d586a08277b57030054e5accb66ad3a4af4d431ce91314aab4cdcd7d9f18e83"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #9b6aa201","item":"In-text #9b6aa201","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"da5150a1e2a7e6ec4289b8f904af7e7f5fc96dc1ca3ddc6eb7dbb4f7b1338f7f","prominence":"supporting","quote":{"exact":"The zig-zagging side edges of a n-antiprism represent a regular skew 2n-gon,"},"quote_capped":true,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The zig-zagging side edges of a n-antiprism represent a regular skew 2n-gon, as shown in this 17-gonal antiprism.","segments":[{"text":"The zig-zagging side edges of a n-antiprism represent a regular skew 2n-gon, as shown in this 17-gonal antiprism."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3856d77d4df8ae385171920f7af52fcbf00dc55d093751b3e82cecd2af1f2404"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #e3c4a4bd","item":"In-text #e3c4a4bd","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polygon","end_line":31,"library":"mathlib","line":29,"location_key":"5c20d64c0df07fdc5dbf2e60c05348576666960484bcc858517fb18cc3e1f3f9","module":"Mathlib.Geometry.Polygon.Basic","note":"Mathlib's polygon is a closed circuit of n vertices in any affine space; it carries neither regularity nor the two parallel planes the passage's definition rests on.","pair_key":"3d7e44e1a01d56fe1cdb9c8babebdd03a347a77cb54a661517c81e7b1eab59e2","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Polygon : Type u_1 → ℕ → Type u_1"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d58f58fb43b0ea61e2ca5982dd47728251cc4ea89eff00d994248ef0568164b3","prominence":"central","quote":{"exact":"A regular skew polygon in 3-space can be seen as nonplanar paths"},"quote_capped":true,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A regular skew polygon in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform antiprism.","segments":[{"text":"A regular skew polygon in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform antiprism."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"f12f6c395b877fd94b86db4b0a663eb50bcda6344d5029391051abe5d207556b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #3a1fa8a8","item":"In-text #3a1fa8a8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"941802b8fd03a2e9224f2801c291288267675a559ccf28d1f2ba37012ca1e9ee","prominence":"supporting","quote":{"exact":"All edges and internal angles are equal."},"quote_capped":false,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"All edges and internal angles are equal.","segments":[{"text":"All edges and internal angles are equal."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"dedd26f94fb96541583ea7c6c97a7331309bcbacaeb92c4d9bb1514882c1f96b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #1ad54ff6","item":"In-text #1ad54ff6","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polygon","end_line":31,"library":"mathlib","line":29,"location_key":"a9a27171c27cc543164db0fb8cde7a852bd5cf43208c82107d936f16c55945b1","module":"Mathlib.Geometry.Polygon.Basic","note":"The structure already lives in an affine space of any dimension, so the ambient generality the passage asks for is present, but no regular skew polygon is defined over it.","pair_key":"7417e89d4d041aaeee3b65f71eea64b53cbabc545768253283462721846e3c34","path":"Mathlib/Geometry/Polygon/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Polygon : Type u_1 → ℕ → Type u_1"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d7bf678d91b7f51f52e439051246bcfe043fc5738d9dcc73ac2b879083178856","prominence":"supporting","quote":{"exact":"More generally regular skew polygons can be defined in n-space."},"quote_capped":false,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"More generally regular skew polygons can be defined in n-space.","segments":[{"text":"More generally regular skew polygons can be defined in n-space."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"5f6aba1e57be0fb95f8db8e273611422f10a4c471c871e62eca60206586f364f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #9b66b5a4","item":"In-text #9b66b5a4","kind":"example","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular","library":"atlas","line":118,"location_key":"78c23cba3eb0661edf28deb68d0279fea65a0a5929ef97934bc885cbe00bddef","module":"WantedExt.Geometry.PlatonicClassificationWanted","note":"It defines regularity of a convex polytope by flag-transitivity of its symmetry group; the polytope is there, but no edge path through it and no projection are.","pair_key":"23c8a445350a48a0dafdb43e5c33a226a7f4d2f501afdbedb9c826b47ed20e60","path":"WantedExt/Geometry/PlatonicClassificationWanted.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular {n : ℕ} : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope n → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a266e7dc22685324fbb15000b7ab969c5f9810198fd25d23ca8730a4261ee537","prominence":"supporting","quote":{"exact":"Examples include the Petrie polygons, polygonal paths of edges that divide a"},"quote_capped":true,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"Examples include the Petrie polygons, polygonal paths of edges that divide a regular polytope into two halves, and seen as a regular polygon in orthogonal projection.","segments":[{"text":"Examples include the Petrie polygons, polygonal paths of edges that divide a regular polytope into two halves, and seen as a regular polygon in orthogonal projection."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"1d8370e38e96845b5bf1fcf44be0eb588eab6834521db40f67f76239d15b7d9a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #d9af8a77","item":"In-text #d9af8a77","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d355c7c34f8e9502dc45d67e282cae7ff0bb8018acc7a900bb2da663402d98a1","prominence":"supporting","quote":{"exact":"In the infinite limit regular skew polygons become skew apeirogons."},"quote_capped":false,"section":["Regular skew polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"In the infinite limit regular skew polygons become skew apeirogons.","segments":[{"text":"In the infinite limit regular skew polygons become skew apeirogons."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"e22511cd7d4b727426793b3f5d8fa16a5ab8eabd45fc2c623e6300a54c55bc6d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #35ae59d9","item":"In-text #35ae59d9","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos94.regularNGon","end_line":42,"library":"formal-conjectures","line":40,"location_key":"b8723928f9944d619faefe5179214953339b4730199e80e2c35fe6cad00aba69","module":"FormalConjectures.ErdosProblems.«94»","note":"It is the regular n-gon on the unit circle, a convex figure given as a finite vertex set, with no notion of failing convexity and no star polygon.","pair_key":"9b15fa17034f3d45f3a9bd598ae5ac2794e3a15adf08af3b34a07fbb26db7ea2","path":"FormalConjectures/ErdosProblems/94.lean","proof_status":"definition","rank":1,"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":"3fb8004debd717f3d9107d2248f47a755b5accf5500e0d9c29ff2769cf48d0fd","prominence":"central","quote":{"exact":"A non-convex regular polygon is a regular star polygon."},"quote_capped":false,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A non-convex regular polygon is a regular star polygon.","segments":[{"text":"A non-convex regular polygon is a regular star polygon."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"162db3b51eb43216a717bd0ec1130a97c8b9f0bda47e87d0c43c00dfec5b6515"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #eafbbb7b","item":"In-text #eafbbb7b","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e9e6a743a8ce5e351a1b1432de2b27ab0a59faa8bf297665c356be07087725b9","prominence":"supporting","quote":{"exact":"The most common example is the pentagram, which has the same vertices"},"quote_capped":true,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The most common example is the pentagram, which has the same vertices as a pentagon, but connects alternating vertices.","segments":[{"text":"The most common example is the pentagram, which has the same vertices as a pentagon, but connects alternating vertices."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"bb44c31f990cf880074b9bb7a59f99f03d7a7babccec6f5313050df3684ba716"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #656e9fbb","item":"In-text #656e9fbb","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"4c67d381c01ba96353fad7e9e492bda2cca9e047a1633a99cce08ad91fc65b5a","prominence":"central","quote":{"exact":"For an n-sided star polygon, the Schläfli symbol is modified to indicate"},"quote_capped":true,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"For an n-sided star polygon, the Schläfli symbol is modified to indicate the density or \"starriness\" m of the polygon, as {n/m}.","segments":[{"text":"For an n-sided star polygon, the Schläfli symbol is modified to indicate the density or \"starriness\" m of the polygon, as {n/m}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"de33dc19e597c179b8356719b2a4ca41c1a6e78f7c190834a7f76f1f1ff577e0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #72039383","item":"In-text #72039383","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"dd00be1aa47f1d8c0a7a43f5c8cc0668dd1c4ea8aeb0a2fecc6eea11511e5bdb","prominence":"supporting","quote":{"exact":"If m is 2, for example, then every second point is joined."},"quote_capped":false,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"If m is 2, for example, then every second point is joined.","segments":[{"text":"If m is 2, for example, then every second point is joined."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"73aa5f881c603acfc6492affd09002d122f44e452d5f3933ebab082aad05cfd7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #7bbf4d14","item":"In-text #7bbf4d14","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c9abaac360faf9b5a01ce1215cffc9c53ea3f7a5f8bb804b00dd28d0713ce06b","prominence":"supporting","quote":{"exact":"If m is 3, then every third point is joined."},"quote_capped":false,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"If m is 3, then every third point is joined.","segments":[{"text":"If m is 3, then every third point is joined."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"82210ba46f846d1c18060a0fd0f941351d18e2e463bb736f16bf1f62be5dcb9e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #00606638","item":"In-text #00606638","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"77bb83b3a569b0a41ea72c7250ab3957f435f87cce909c4de1a5a673115065d1","prominence":"supporting","quote":{"exact":"The boundary of the polygon winds around the center m times."},"quote_capped":false,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The boundary of the polygon winds around the center m times.","segments":[{"text":"The boundary of the polygon winds around the center m times."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"fd40d82bf3b1f1e1cf710caef0ecef1e073963eee7cce9086dfb0dfbbdfc46f2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #9999bfc2","item":"In-text #9999bfc2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"faf7fc96e6c4740930083df1d03b3c4617f6718301393051d6ff656c9dc784f6","prominence":"central","quote":{"exact":"m and n must be coprime, or the figure will degenerate."},"quote_capped":false,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"Dodecagram – {12/5} ","lead_in":true,"segments":[{"text":"Dodecagram – {12/5} "}]},"layer":"m and n must be coprime, or the figure will degenerate.","segments":[{"text":"m and n must be coprime, or the figure will degenerate."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"3ab1503352abb372141ef8cbf5203d3a80152852fb83cc5521873803bbfca407"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #fabc219d","item":"In-text #fabc219d","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1568bcdc6e83e5dc9b2b02121da6d30dd115acd231299ed86847412ee76d9dc4","prominence":"supporting","quote":{"exact":"For much of the 20th century (see for example Coxeter (1948)), we"},"quote_capped":true,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"For example, {6/2} may be treated in either of two ways: ","lead_in":true,"segments":[{"text":"For example, {6/2} may be treated in either of two ways: "}]},"layer":"For much of the 20th century (see for example Coxeter (1948)), we have commonly taken the /2 to indicate joining each vertex of a convex {6} to its near neighbors two steps away, to obtain the regular compound of two triangles, or hexagram.","segments":[{"text":"For much of the 20th century (see for example Coxeter (1948)), we have commonly taken the /2 to indicate joining each vertex of a convex {6} to its near neighbors two steps away, to obtain the regular compound of two triangles, or hexagram."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"b5ad27cfd0bf69a92c3973723f4e21bc36feb54bb56b8f51da82bfc14bd72f2a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #dc681440","item":"In-text #dc681440","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"688c7017a24c7116a053690d8bdb2b1fbaedcf1d6ff5e785bc7bef04dfb11ea9","prominence":"supporting","quote":{"exact":"Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound"},"quote_capped":true,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"after":{"layer":", so the hexagram is represented as {6}[2{3}]{6}.","segments":[{"text":", so the hexagram is represented as {6}[2{3}]{6}."}]},"layer":"Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}","segments":[{"text":"Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"eb64e78c83d21022bdb8298bcf19af66f357401c9df42ed7e1e327c67bfb356d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #66452d58","item":"In-text #66452d58","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"db4be9937ce8022f3d7032c88201ca5eb77e944e4dc8f7076ab14532784c7697","prominence":"supporting","quote":{"exact":"the hexagram is represented as {6}[2{3}]{6}.[14]"},"quote_capped":false,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}, so ","segments":[{"text":"Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}, so "}]},"layer":"the hexagram is represented as {6}[2{3}]{6}.[14]","segments":[{"text":"the hexagram is represented as {6}[2{3}]{6}."},{"ref":"[14]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"ee5a8bfcd6fc29743f86020848d1f5cfacc6dcd7d1ee9605dd5a99daa72b385e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #c2494aa1","item":"In-text #c2494aa1","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f8acb809541222e87a64c0a832a8bededc8bc03af1d9fdd5420d45b93a1dfaf9","prominence":"supporting","quote":{"exact":"More compactly Coxeter also writes 2{n/2}, like 2{3} for a hexagram as"},"quote_capped":true,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"More compactly Coxeter also writes 2{n/2}, like 2{3} for a hexagram as compound as alternations of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation.","segments":[{"text":"More compactly Coxeter also writes 2{n/2}, like 2{3} for a hexagram as compound as alternations of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"c24877323f1dbf3ad1c43f114f6668c4eaebbaa32ecab79f0b7b946f150917b2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #9179fe13","item":"In-text #9179fe13","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bc29e6799c8c41bf00a4157c32060737859a18b4c2ac2b2648487c35f2a852f9","prominence":"supporting","quote":{"exact":"They take the /2 to indicate moving two places around the {6}"},"quote_capped":true,"section":["Regular star polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"They take the /2 to indicate moving two places around the {6} at each step, obtaining a \"double-wound\" triangle that has two vertices superimposed at each corner point and two edges along each line segment.","segments":[{"text":"They take the /2 to indicate moving two places around the {6} at each step, obtaining a \"double-wound\" triangle that has two vertices superimposed at each corner point and two edges along each line segment."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"153994c1abe5d5cc002a99b2116040c0386bb2f0c2c6e3bd4fd6837a9fa4a1ea"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #ed3fd6c2","item":"In-text #ed3fd6c2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e578cdb421b8fb2e2cea169a6c475d0d0b7bac130b17ed6f625921e578cce3e1","prominence":"central","quote":{"exact":"All regular polygons are self-dual to congruency"},"quote_capped":false,"section":["Duality of regular polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"after":{"layer":", and for odd n they are self-dual to identity.","segments":[{"text":", and for odd n they are self-dual to identity."}]},"layer":"All regular polygons are self-dual to congruency","segments":[{"text":"All regular polygons are self-dual to congruency"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"891fb8f21d2ed1006a94b13c5408208766fdfacb3b1acafce51a5dabd5052749"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #6d836012","item":"In-text #6d836012","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0cbb08321d9e95137cd3ae5d2da762925f5bdedd92ac088b45480323e0ba5ef9","prominence":"supporting","quote":{"exact":"for odd n they are self-dual to identity."},"quote_capped":false,"section":["Duality of regular polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"before":{"layer":"All regular polygons are self-dual to congruency, and ","segments":[{"text":"All regular polygons are self-dual to congruency, and "}]},"layer":"for odd n they are self-dual to identity.","segments":[{"text":"for odd n they are self-dual to identity."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"12fb5835003538e6fad221d3920df71e635e516e9487ffdbd787a2bf63d45684"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #cfc05cb8","item":"In-text #cfc05cb8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3535fab12ff9a31f18d7436c5382ddc86daf48a9dbf4c7fd9f83f14a028de04c","prominence":"supporting","quote":{"exact":"In addition, the regular star figures (compounds), being composed of regular polygons,"},"quote_capped":true,"section":["Duality of regular polygons"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"In addition, the regular star figures (compounds), being composed of regular polygons, are also self-dual.","segments":[{"text":"In addition, the regular star figures (compounds), being composed of regular polygons, are also self-dual."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"147e67a7934ac0d185185fcd354d35c37ef8f0775bf131df8cf2051c1fde0685"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #6b4b8d97","item":"In-text #6b4b8d97","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8ff13955c6957798d2aaa8705427886e5e98d74db2b05c034dbf86759242b8d9","prominence":"central","quote":{"exact":"A uniform polyhedron has regular polygons as faces, such that for every"},"quote_capped":true,"section":["Regular polygons as faces of polyhedra"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A uniform polyhedron has regular polygons as faces, such that for every two vertices there is an isometry mapping one into the other (just as there is for a regular polygon).","segments":[{"text":"A uniform polyhedron has regular polygons as faces, such that for every two vertices there is an isometry mapping one into the other (just as there is for a regular polygon)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"e477a1ea8b98f5bf57074b2dbbcaef94d0a2c6e86d183cc291685919b301d0a0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #48233a09","item":"In-text #48233a09","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b4d61340d28bc20b8213cd0aff71984b9790dee9f19673d3181421d84b9a9b5a","prominence":"central","quote":{"exact":"A quasiregular polyhedron is a uniform polyhedron which has just two kinds"},"quote_capped":true,"section":["Regular polygons as faces of polyhedra"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A quasiregular polyhedron is a uniform polyhedron which has just two kinds of face alternating around each vertex.","segments":[{"text":"A quasiregular polyhedron is a uniform polyhedron which has just two kinds of face alternating around each vertex."}]},"unresolved":null},{"absence":null,"basis":"08048f53074a6a84271fbc4a0bb8a1be043dafaf69b7bc1750370a682b467616","coverage":null,"id":"enwiki-333306-1379891336::In-text #517d3763","item":"In-text #517d3763","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular","library":"atlas","line":118,"location_key":"08048f53074a6a84271fbc4a0bb8a1be043dafaf69b7bc1750370a682b467616","module":"WantedExt.Geometry.PlatonicClassificationWanted","note":"Convexity is assumed here, so the non-convex uniform polyhedra that the passage's wording admits are left out, and the criterion is flag-transitivity of the symmetry group rather than one kind of face.","pair_key":"091ec9a49e3ca3eded82fd1a3ea2d1de8a344f023e1c8c6837ef1b821048c8c8","path":"WantedExt/Geometry/PlatonicClassificationWanted.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope.IsRegular {n : ℕ} : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope n → Prop"},"statement":true},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.regularPolytopes","library":"atlas","line":133,"location_key":"066995e68b5e50e7a6dd752e1cd907fe09f313acef27584eeba0dddf95091a71","module":"WantedExt.Geometry.PlatonicClassificationWanted","note":"This packages the same predicate as a set, and like it assumes convexity, so star uniform solids are excluded from what it collects.","pair_key":"6ba47757a6603dac668eb44fec74c7e74560f6a52f115b75a578c40a36d5f34b","path":"WantedExt/Geometry/PlatonicClassificationWanted.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.regularPolytopes (d : ℕ) : Set (MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.ConvexPolytope d)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"99a8c8999cf37ca84b0e974d6998bcfc7c375aa0883c99e89025f39a485f98b2","prominence":"central","quote":{"exact":"A regular polyhedron is a uniform polyhedron which has just one kind"},"quote_capped":true,"section":["Regular polygons as faces of polyhedra"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A regular polyhedron is a uniform polyhedron which has just one kind of face.","segments":[{"text":"A regular polyhedron is a uniform polyhedron which has just one kind of face."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"ba28b370f4c7e58f904f84c240aaa407a44e73c0ea1781f5dbe26e97bbd4f255"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #b3111614","item":"In-text #b3111614","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"dfcffcd13bb2276fb42f4e044cb8cc1efb28cbf0e8b8f89ae7d20c4f0e652261","prominence":"central","quote":{"exact":"The remaining (non-uniform) convex polyhedra with regular faces are known as the"},"quote_capped":true,"section":["Regular polygons as faces of polyhedra"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"The remaining (non-uniform) convex polyhedra with regular faces are known as the Johnson solids.","segments":[{"text":"The remaining (non-uniform) convex polyhedra with regular faces are known as the Johnson solids."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"558ac37842dbc7fa02a7d8da36163b63e76ba2353953b8349174128d95f5789c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-333306-1379891336::In-text #c45a33e4","item":"In-text #c45a33e4","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"19f2ff24994073c24e02d8c46d75f749a851d223c8189e097014eb7617774101","prominence":"central","quote":{"exact":"A polyhedron having regular triangles as faces is called a deltahedron."},"quote_capped":false,"section":["Regular polygons as faces of polyhedra"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=333306&oldid=1379891336","text":{"layer":"A polyhedron having regular triangles as faces is called a deltahedron.","segments":[{"text":"A polyhedron having regular triangles as faces is called a deltahedron."}]},"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":317793,"images":[{"author":"Tomruen","file":"12-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"14-gon-dissection-star.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"16-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"18-gon-dissection-star.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"20-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"24-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"30-gon-dissection-star.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"40-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"50-gon-dissection-star.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"6-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"8-gon_rhombic_dissection.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Cmglee","file":"Annuli_with_same_area_around_unit_regular_polygons.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Cyp","file":"Antiprism17.jpg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"User:Tomruen","file":"CDel_dq.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"User:Tomruen","file":"CDel_n.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"User:Tomruen","file":"CDel_node.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"User:Tomruen","file":"CDel_node_1.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"User:Tomruen","file":"CDel_p.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"User:Tomruen","file":"CDel_rat.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Krishnavedala","file":"Cube_petrie_polygon_sideview.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"raster original by Tomruen vectorization by B. Jankuloski","file":"Doubly_wound_hexagon.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","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":"User:Mountain","file":"Parthenon_from_west.jpg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Д.Ильин: vectorization","file":"Petrie_polygons.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"DVdm","file":"PolygonParameters.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":null,"file":"Polygons_comparison.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"László Németh","file":"Regular_polygon_10_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_11_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_12_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_13_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_14_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_3_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_4_annotated.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"László Németh","file":"Regular_polygon_5_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_6_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_7_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_8_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"László Németh","file":"Regular_polygon_9_annotated.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Cmglee","file":"Regular_polygon_side_count_graph.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"Regular_star_figure_2(3,1).svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"Regular_star_polygon_5-2.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Tomruen","file":"Regular_star_polygon_7-2.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Tomruen","file":"Regular_star_polygon_7-3.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Cmglee","file":"Regular_star_polygons.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"Tomruen","file":"Sun_decagon.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"}],"marks":490,"passages":75,"sha256":"b81f116116dbe4a1b454e510955cf56dda81a063bce42fd5d8534dbea6e728af","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"13d524ad1647e06b5401e6b1ff35375a52e04674870ea0861b1c4bb8710c6b1f","revision":1379891336,"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":"3d2cce29f02ece1812f1d0f3063c133b6ee439890f05e771e8c1a589d45f9860","layer_sha256":"6597ed064b1251b4b462ec67dd9531fc9b5827373db4efd14a8eddad35d2c0d6","renderer":"web-html/3"},"source_id":"enwiki-333306-1379891336","summary":{"by_library":{"atlas":{"complete":6,"incomplete":3,"locations":9,"passages":7,"related":8},"formal-conjectures":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":8},"mathlib":{"complete":3,"incomplete":0,"locations":3,"passages":3,"related":10},"tauceti":{"complete":0,"incomplete":0,"locations":0,"passages":0,"related":6}},"by_prominence":{"central":{"by_status":{"formalized":1,"not_formalized":26,"partial":4,"statement_only":3,"unresolved":0},"passages":34},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":1,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":0,"not_formalized":38,"partial":2,"statement_only":0,"unresolved":0},"passages":40}},"by_proof_status":{"definition":19,"proved":20,"statement_only":1,"wanted":6},"by_relation":{"broadMatch":2,"closeMatch":1,"exactMatch":1,"hasPart":1,"narrowMatch":9,"relatedMatch":32},"by_status":{"formalized":1,"not_formalized":64,"partial":7,"statement_only":3,"unresolved":0},"locations":14,"passages":75,"related":32},"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":"Regular polygon","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q714886"}
