Two-difference Motzkin density

What Lean checks

The exact compact-group character formula, exhaustive relation-basis trichotomy, all-modulus cyclic formulas, gcd scaling, odd-cycle criterion, and stated example are checked. The literal fixed character window and rational interval unions attain the stated bounds. The exact floor-sum evaluator, Hermite independence number, attaining character, and explicit arithmetic-operation and integer-size bounds are checked and registered.

Collection · Catalogue · Verification · Lean status

Result

The exact character formula for any pair in any compact abelian group, including noncyclic finite subgroups. The cyclic maximum-independent-set problem has a prior 2026 solution.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/two-difference-motzkin/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

Motzkin.compact_two_difference_theorem proves the general compact-group character formula. Its definitions use actual Borel avoiding sets and actual continuous circle characters. The group is any compact Hausdorff abelian group with Borel measurable space and a given invariant probability measure. The statement includes zero differences and imposes no generation, rank, closed-subgroup, or second-countability condition.

The complete 34-module closure passed strict source checking, a 664-theorem standard-axiom audit, and independent kernel replay in the hosted job. The exact receipt records the unchanged sources, gate inputs, and completed checks.

The finite theorem also supplies both an attaining independent set and an attaining circle character. The formulas for explicitly stated relation bases and Borel attainment under two independent finite relations are now checked; their 39-module closure passed a 729-theorem audit and independent replay. See the relation receipt. The cyclic formulas for all positive moduli, gcd scaling, generated-case Hermite basis, odd-cycle sharpness criterion, and stated example are now checked. Rational-circle density and abstract Borel attainment are included. The 48-module closure passed strict sources, an 812-theorem axiom audit, and independent replay; see the cyclic receipt.

The literal fixed character-window witness is now checked. Its unshifted half-open preimage has exactly the minimum of the two character distances as its measure and avoids both differences, including finite-image and zero-score cases. The exact five-module closure passed strict sources, a 53-theorem axiom audit, and independent kernel replay; see the character-window receipt.

The exact floor-sum evaluator, attaining character, Hermite independence number, cyclic gcd conversion, and explicit arithmetic complexity bounds are checked and registered. For positive normalized Hermite inputs, the formal algorithm uses at most 256*((m*k).log2+1)^2 metered arithmetic operations, and its recorded integers have at most 6*((m*k).log2+1) bits. The 65-module closure passed strict sources, a 1,212-theorem audit, and independent replay; see the evaluator receipt.

Literal half-open rational interval unions now provide explicit maximizing sets with proved measure and avoidance. Their 46-module closure passed strict sources, a 795-theorem audit, and independent replay; see the rational-interval receipt.

The exhaustive relation-basis theorem and the resulting compact-density trichotomy are now checked and registered. Every integer relation subgroup has either no nonzero relation, one nonzero generator, or a constructed normalized Hermite basis. No basis-existence premise remains. The final 41-module closure passed strict sources, a 743-theorem standard-axiom audit, and independent replay; see the relation-basis receipt.

This completes the stated result, including the evaluator and explicit witnesses. Exact formalized scope.

Supporting files