Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

OrbitIncidenceChecker

Abstract

Exact tree evaluation and finite Fourier identities support the exclusion of uniform mixing on the cycle with twenty-one vertices.

Theorem 1.1 (checked_inc).

Proof. Machine-checked in Lean as D5/S3/Quantum/Dynamics/CycleUniformMixing/OrbitIncidenceChecker.checked_inc (✓ std3). ∎

Source. Repository-derived.

Commentary.

Every accepted incidence tree evaluates to its total coefficient times the orbit sum of its representative. Node composition preserves this equality.

Definition 1.2 (certificateScalar).

Formalization. D5/S3/Quantum/Dynamics/CycleUniformMixing/OrbitIncidenceChecker.certificateScalar (✓ std3).

Source. Repository-derived.

Commentary.

The fixed natural scalar in the integer Laurent certificate has the displayed type. Its value is specified by the Lean definition.

Theorem 1.3 (identity).

Proof. Machine-checked in Lean as D5/S3/Quantum/Dynamics/CycleUniformMixing/OrbitIncidenceChecker.identity (✓ std3). ∎

Source. Repository-derived.

Commentary.

The displayed identity is used in the orbit-sum and spectral calculation.

References