cycle_power_eight_globally_coupled_rank_mixture
For the explicit tight-class mixture, the displayed scenario maps are permutations and couple all three phases globally so that every dyadic-rank ownership equation holds in every scenario. Together with the previous mixture theorem, this shows that global rank consistency and averaged coverage and counts do not force equality of corrected counts.
Statement
theorem cycle_power_eight_globally_coupled_rank_mixture : let f : Fin 3 → Fin 3 → Fin 3 := fun p s => if p = 0 then s else if p = 1 then (![2,0,1] : Fin 3 → Fin 3) s else (![0,2,1] : Fin 3 → Fin 3) s (∀ p : Fin 3, Function.Injective (f p)) ∧ (∀ v j s : Fin 3, (Finset.univ : Finset (Fin 3)).sum (fun p => rt1_mixture_owner865 v j p (f p s)) = 1)
- Source
- Global coupling for the explicit period-three relaxation in RT-1, experiment 27158.
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- cycle_power_eight_pairwise_tight_mixture_counterexampleFor the displayed period-three family of three equally weighted Boolean classes per phase, every class has the required endpoints, parent…
The proof, explained
The theorem shows that an explicit family of scenario maps $f(p, \\cdot)$ on $\\text{Fin } 3$ consists of permutations and couples all three phases so that the dyadic-rank ownership sum is 1 in every scenario. After expanding the definition of $f$, the proof splits the conjunction into the injectivity condition and the ownership sum condition. Since both claims are finite, Lean proves them by direct computational exhaustion using `decide`.
The definition of the family of scenario maps $f$ is unfolded in both conjuncts of the theorem statement.
The tactic expands the local definition of $f$, replacing each application $f(p, s)$ with the explicit piecewise formula that returns $s$ when $p = 0$, the permutation $[2, 0, 1](s)$ when $p = 1$, and $[0, 2, 1](s)$ otherwise.
dsimpFor each phase $p \\in \\{0, 1, 2\\}$, the scenario map $f(p, \\cdot)$ is injective, and for every triple $(v, j, s) \\in \\{0, 1, 2\\}^3$, the ownership values sum to 1 over the three phases $p$. automation
The conjunction is split into two independent subgoals. The first requires checking injectivity for each of the three maps on $\\text{Fin } 3$, and the second requires verifying an equality of sums for each of the $3^3 = 27$ possible triples $(v, j, s)$. Because both statements quantify over finite domains and involve only computable operations, the decision procedure `decide` closes both goals by exhaustive evaluation.
constructor <;> decide
- Both the injectivity of the three permutations and the 27 instances of the ownership summation are verified purely by finite computational exhaustion via the `decide` tactic.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem cycle_power_eight_globally_coupled_rank_mixture : let f : Fin 3 → Fin 3 → Fin 3 := fun p s => if p = 0 then s else if p = 1 then (![2,0,1] : Fin 3 → Fin 3) s else (![0,2,1] : Fin 3 → Fin 3) s (∀ p : Fin 3, Function.Injective (f p)) ∧ (∀ v j s : Fin 3, (Finset.univ : Finset (Fin 3)).sum (fun p => rt1_mixture_owner865 v j p (f p s)) = 1) := by dsimp constructor <;> decide