Documentation

LeanPool.RegtsSevenster.Solution

The certification solution #

The theorems of Challenge.lean, each proved by the theorem of record of the same name. Comparator confirms at the kernel-export level that the statements match the challenge's, that the proofs use no axiom outside [propext, Classical.choice, Quot.sound], and that the kernel accepts them; see comparator-config.json and the CI workflow.

The converse: every mixed partition function is an edge-rank-bounded parameter, with base max 1 (k + 2ℓ).

The rank bound from a bounded mixed partition function.

The forward direction, with no hypothesis.

The quantitative forward direction, with no hypothesis: both dimensions at most ⌊2eR⌋.

The total-dimension forward direction: the representing model has k + 2 * ℓ ≤ R.

theorem Certified.regts_sevenster_characterisation (f : RS.ClosedFragment → ℂ) (hempty : f RS.emptyClosedFragment = 1) (hiso : ∀ (W₁ W₂ : RS.ClosedFragment) (a : RS.Fragment.Equiv W₁ W₂), f W₁ = f W₂) :

The characterisation: a fragment parameter has bounded edge rank exactly when it is a mixed partition function.

The quantitative round trip: edge rank R gives dimension ⌊2eR⌋, and dimension B gives edge rank base max 1 (2B).