Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Discrete Geometry

190 missions · 135 completed

Missions

Open55Completed135All190
🏆Completed
Captain: mikedeng1

Convex Polytopes XI: Effective enumeration of combinatorial typesTextbook

A basic classification question in polytope theory asks what combinatorial types can occur when the dimension and number of vertices are fixed. The question is not merely whether there are finitely many types. Effective enumeration asks for a uniform algorithm which produces the complete list, with no omissions and no repeated combinatorial type. This…

9 thms2 active usersReviewed
🏆Completed
Captain: mikedeng1

Convex Polytopes IX: Simplex sections through prescribed pointsTextbook

A polytope can be represented not only by vertices or supporting inequalities, but also as a section of a simplex in a higher-dimensional space. Perles's prescribed-point theorem strengthens this representation: the cutting flat can be required to pass through an interior point selected in advance. This is Theorem 5.1.10 in Branko Grünbaum's Convex Polytopes…

3 thms2 active usersReviewed
🏆Completed
Captain: mikedeng1

Convex Polytopes IX: Realization of cube skeletons by cubical polytopesTextbook

The face structure of a cube is unusually regular: its vertices, edges, and higher dimensional faces are indexed by choices of fixed and free coordinates. A natural realization question asks how much of this structure can survive in a polytope of lower dimension. In §4.9 of Convex Polytopes, Grünbaum reports the Joswig–Ziegler construction of neighborly…

8 thms2 active usersReviewed
🏆Completed
Captain: mikedeng1

Convex Polytopes VIII: Facet growth of binary polytopesTextbook

A polytope may be described by its vertices or by its facets. These descriptions can differ sharply in size even when every vertex has only binary coordinates. Grünbaum's account of 0/1-polytopes in §4.9 records a result of Bárány and Pór: the maximal number of facets grows superexponentially with dimension. The result is an existence statement about the…

4 thms2 active usersReviewed
🏆Completed
Captain: mikedeng1

Convex Polytopes I: Finite Convex RepresentationsTextbook

Convex hulls are often defined using arbitrary finite convex combinations. In finite dimensional geometry, Carathéodory's theorem gives a uniform bound on how many points are needed to represent any one point of the hull. This is the finite representation result stated in Branko Grünbaum's Convex Polytopes, second edition (2003), §2.3, Theorem 2.3.5,…

1 thm2 active usersReviewed
🏆Completed
Captain: marwahaha

OpenAI Ten Proofs 08: Ehrhart volume inequalityResearch Paper

Ehrhart volume inequality, from the OpenAI Ten Proofs formalization. The source already contains machine-checked proofs; this mission organizes its headline result and additional Comparator targets for reuse.

5 thms1 active userReviewed
🏆Completed
Complexity Theory·Captain: marwahaha

OpenAI Ten Proofs 07: Hardness of the closest vector problemResearch Paper

Hardness of the closest vector problem, from the OpenAI Ten Proofs formalization. The source already contains machine-checked proofs; this mission organizes its headline result and additional Comparator targets for reuse.

5 thms1 active userReviewed
🏆Completed
Captain: marwahaha

OpenAI Ten Proofs 01: High-dimensional sphere packingResearch Paper

High-dimensional sphere packing, from the OpenAI Ten Proofs formalization. The source already contains machine-checked proofs; this mission organizes its headline result and additional Comparator targets for reuse.

5 thms1 active userReviewed
🏆Completed
Algebraic Geometry·Captain: mysticflounder

Near enemies: spherical sets project to minimal-energy images in general positionOpen Problem

How few distinct distances can a planar point set determine? The near enemies of this mission are the closest competitors to the extremal configuration: points in no-three-collinear position (no line through three of them) and points lying on a common sphere — the lattice-sphere slice of Erdős–Füredi–Pach–Ruzsa is the motivating example. The bisector energy…

20 thms1 active userReviewed
🏆Completed
Algebraic Geometry·Captain: mysticflounder

Pach-de Zeeuw: finite Bezout bound for real plane curvesResearch Paper

The distinct-distances problem asks how few distinct distances a finite planar point set can determine. Guth and Katz proved the near-optimal bound Ω(n/log⁡n)\Omega(n / \log n)Ω(n/logn) in 2015. Their argument passes through incidence geometry: distances become incidences between points and curves, and the Elekes–Sharir framework converts the problem into an incidence bound…

40 thms1 active userReviewed
PreviousPage 6 of 6Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me