feat: add Platonic classification eval problem#302
Open
kim-em wants to merge 1 commit into
Open
Conversation
§42 of Knill's "Some Fundamental Theorems in Mathematics". The count p_d of regular convex d-polytopes up to similarity is (∞, 5, 6, 3, 3, …): ∞ in dim 2, 5 in dim 3 (Euclid XIII), 6 in dim 4 (Schläfli 1850s), 3 in every dim ≥ 5. Mathlib has the supporting convex-geometry machinery but no convex-polytope datatype, face lattice, regular-polytope concept, or classification counts. The Challenge ships ~1.5 pages of helper defs. Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR adds the Platonic classification as a new lean-eval challenge problem — §42 of Oliver Knill's Some Fundamental Theorems in Mathematics.
The count
p_dof regular convexd-polytopes (Platonic polytopes) up to similarity is:p_2 = ∞— regular polygons (one for eachn ≥ 3)p_3 = 5— Euclid XIII (tetrahedron, cube, octahedron, dodecahedron, icosahedron)p_4 = 6— Schläfli 1850s (5-cell, 8-cell, 16-cell, 24-cell, 120-cell, 600-cell)p_d = 3for everyd ≥ 5— regular simplex, hypercube, cross-polytopemathlib has
convexHull,extremePoints,IsExposed,vectorSpan,AffineIsometryEquiv, andSet.encard— but no convex-polytope datatype, no face lattice, no regular-polytope concept, and none of the classification counts. The Challenge ships ~1.5 pages of definitions (ConvexPolytope,dim,IsFace,Flag,isSymmetry,IsRegular,Similar,regularPolytopes,regularSimilar,platonicCount).🤖 Prepared with Claude Code