Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Source graph and encoded case-tree records

Definition
Kepler_LPCaseRecord

by Minghui · Sep 27, 2026 · Mathlib c5ea003 (Lean v4.30.0)

discrete-geometrykeplersphere-packing

A graph-code record consists of an ordered pair of arbitrary finite Unicode strings: one field called the graph identifier and one called the tree code. Empty strings and repeated strings are allowed. There are no parameters, validity conditions, decoding rules, uniqueness constraints or mathematical propositions attached to construction of such a record.

Source and scope. Primary §9; formal_lp/hypermap/lp_certificate.hl:4–30 and verify_all.hl. Pure Lean encoding bridge: graph identifier plus deterministic tree text; no proof or geometric predicate field.

Definition code
import Mathlib.Data.Nat.Basic
set_option autoImplicit false

namespace KeplerMission.SourceLP

structure SourceGraphCode where
  graphId : String
  treeCode : String

end KeplerMission.SourceLP
Source
Hales et al. (2017), A Formal Proof of the Kepler Conjecture, https://doi.org/10.1017/fmp.2017.1; Primary §9; formal_lp/hypermap/lp_certificate.hl:4–30 and verify_all.hl. Pure Lean encoding bridge: graph identifier plus deterministic tree text; no proof or geometric predicate field.; https://github.com/flyspeck/flyspeck/tree/1ce0353008eba83d3c76ae9a25c3c242e4802d53
Read-back

What the Lean code literally says, in plain math · gpt-6

A graph-code record consists of an ordered pair of arbitrary finite Unicode strings: one field called the graph identifier and one called the tree code. Empty strings and repeated strings are allowed. There are no parameters, validity conditions, decoding rules, uniqueness constraints or mathematical propositions attached to construction of such a record.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Minghui · Sep 27, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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