Skip to content

feat: add Platonic classification eval problem#302

Merged
kim-em merged 1 commit into
mainfrom
eval/platonic-classification
May 25, 2026
Merged

feat: add Platonic classification eval problem#302
kim-em merged 1 commit into
mainfrom
eval/platonic-classification

Conversation

@kim-em
Copy link
Copy Markdown
Collaborator

@kim-em kim-em commented May 23, 2026

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_d of regular convex d-polytopes (Platonic polytopes) up to similarity is:

  • p_2 = ∞ — regular polygons (one for each n ≥ 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 = 3 for every d ≥ 5 — regular simplex, hypercube, cross-polytope

mathlib has convexHull, extremePoints, IsExposed, vectorSpan, AffineIsometryEquiv, and Set.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

§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>
@kim-em kim-em force-pushed the eval/platonic-classification branch from fa7219c to ff4ae7a Compare May 25, 2026 11:55
kim-em added a commit that referenced this pull request May 25, 2026
§42 of Knill's "Some Fundamental Theorems in Mathematics". Schläfli's
1852 dimension-by-dimension enumeration of the regular convex polytopes:
p_3 = 5 (Euclid XIII — the five Platonic solids), p_4 = 6 (Schläfli's
six regular 4-polytopes), and p_d = 3 for every d ≥ 5 (regular simplex,
hypercube, cross-polytope). Companion to the broader Platonic
classification problem #302, which additionally records p_2 = ∞.
Mathlib has convex-geometry primitives 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 <noreply@anthropic.com>
@kim-em kim-em merged commit 00a9c64 into main May 25, 2026
1 check passed
kim-em added a commit that referenced this pull request May 25, 2026
§42 of Knill's "Some Fundamental Theorems in Mathematics". Schläfli's
1852 dimension-by-dimension enumeration of the regular convex polytopes:
p_3 = 5 (Euclid XIII — the five Platonic solids), p_4 = 6 (Schläfli's
six regular 4-polytopes), and p_d = 3 for every d ≥ 5 (regular simplex,
hypercube, cross-polytope). Companion to the broader Platonic
classification problem #302, which additionally records p_2 = ∞.
Mathlib has convex-geometry primitives 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 <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant