six_circle_two_symbols_labeled_impossible
In the anonymous-slip puzzle for six sages seated in a circle with six labeled seats, there is no deterministic protocol c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2 using two symbols {0, 1} such that every sage can reconstruct the full seating permutation from their local view and the public multiset of written symbols: that is, there is no protocol c such that for all permutations π₁, π₂ of six sages and every seat i, if the local views (π₁ i, i, π₁ (i - 1), π₁ (i + 1)) and (π₂ i, i, π₂ (i - 1), π₂ (i + 1)) are equal and the total number of 1s written under c is equal, then π₁ = π₂.
Statement
theorem six_circle_two_symbols_labeled_impossible :
¬ ∃ c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2,
∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6),
(π₁ i, i, π₁ (i - 1), π₁ (i + 1)) = (π₂ i, i, π₂ (i - 1), π₂ (i + 1)) →
(∑ j : Fin 6, (c (π₁ j, j, π₁ (j - 1), π₁ (j + 1)) : ℕ)) =
(∑ j : Fin 6, (c (π₂ j, j, π₂ (j - 1), π₂ (j + 1)) : ℕ)) →
π₁ = π₂- Formalizes
- arXiv:2610.33032, Theorem 8
- Verified
- 28 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- six_circle_viewThe local view (x, i, L, R) of the sage sitting at seat i in a circular seating π of six labeled seats consists of the sage's identity x =…
Read back from the Lean
There does not exist a function $c : (\text{Fin } 6 \times \text{Fin } 6 \times \text{Fin } 6 \times \text{Fin } 6) \to \text{Fin } 2$ such that for all permutations $\pi_1, \pi_2$ of $\text{Fin } 6$ and every index $i \in \text{Fin } 6$, if: 1. $(\pi_1(i), i, \pi_1(i - 1), \pi_1(i + 1)) = (\pi_2(i), i, \pi_2(i - 1), \pi_2(i + 1))$ (where addition and subtraction are modulo 6 in $\text{Fin } 6$), and 2. $\sum_{j \in \text{Fin } 6} c(\pi_1(j), j, \pi_1(j - 1), \pi_1(j + 1)) = \sum_{j \in \text{Fin } 6} c(\pi_2(j), j, \pi_2(j - 1), \pi_2(j + 1))$ (with the values of $c$ in $\text{Fin } 2$ coerced to natural numbers $\mathbb{N}$), then $\pi_1 = \pi_2$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof proceeds by contradiction. Assuming such a protocol c exists, every local view fiber maps bijectively under the total slip sum to an interval of 6 consecutive integers containing both 1 and 2, which implies that the fibers with total slip sum 1 and 2 have identical sizes for every local view. Summing over all views shows that the total number of permutations with sum 1 equals the number with sum 2 (N₁ = N₂). Double counting the total number of 1s written across all sages and permutations then gives N₁ = 2 * N₂ = 2 * N₁, which contradicts N₁ > 0.
If f is injective on a finite set s and k ∈ f(s), the fiber {x ∈ s | f(x) = k} has cardinality 1.
Since k ∈ f(s), there is an x ∈ s with f(x) = k (via Finset.mem_image.mp). By injectivity of f on s (hinj), any y ∈ s with f(y) = f(x) must equal x, so the fiber is the singleton {x} (using Finset.mem_filter and Finset.mem_singleton). Its cardinality is 1 by Finset.card_singleton.
uses
Finset.mem_image.mp,Finset.mem_filter,Finset.mem_singleton,Finset.card_singletonrcases Finset.mem_image.mp hk with ⟨x, hx, rfl⟩ have : s.filter (fun y => f y = f x) = {x} := by ext y simp only [Finset.mem_filter, Finset.mem_singleton] constructor · rintro ⟨hy, heq⟩ exact hinj hy hx heq · rintro rfl exact ⟨hx, rfl⟩ rw [this, Finset.card_singleton]
Two permutations have identical views at seat i if and only if they agree at seats i, i - 1, and i + 1.
By definition of six_circle_view, the view at seat i is (π(i), i, π(i - 1), π(i + 1)). Equality of these 4-tuples reduces to equality of the sage indices at seats i, i - 1, and i + 1.
uses
six_circle_viewlemma six_circle_two_symbols_labeled_impossible_view_eq_iff (π π₀ : Equiv.Perm (Fin 6)) (i : Fin 6) : six_circle_view π i = six_circle_view π₀ i ↔ π i = π₀ i ∧ π (i - 1) = π₀ (i - 1) ∧ π (i + 1) = π₀ (i + 1) := by simp [six_circle_view]
For each seat i, the stabilizer in S₆ fixing seats i, i - 1, and i + 1 has cardinality 6. automation
Fixing 3 positions out of 6 leaves 3 elements to be permuted, so there are 3! = 6 such permutations. Lean verifies this for all seats i by exhaustive finite checking using decide.
lemma six_circle_two_symbols_labeled_impossible_card_fiber_view (π₀ : Equiv.Perm (Fin 6)) (i : Fin 6) : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i) Finset.univ).card = 6 := by have h_stab : (Finset.filter (fun (σ : Equiv.Perm (Fin 6)) => σ i = i ∧ σ (i - 1) = i - 1 ∧ σ (i + 1) = i + 1) Finset.univ).card = 6 := by revert i; decide
For any permutation π₀ and seat i, exactly 6 permutations have the same local view at seat i as π₀.
The map π ↦ π₀⁻¹ * π gives a bijection (Finset.card_bij') between the fiber of permutations sharing the view of π₀ at seat i and the stabilizer fixing {i, i - 1, i + 1}. By six_circle_two_symbols_labeled_impossible_view_eq_iff and Equiv.Perm.mul_apply, the forward and inverse maps preserve the respective conditions, showing the fiber has the same size 6 as the stabilizer.
uses
Finset.card_bij',Finset.mem_filter,Finset.mem_univ,true_and,six_circle_two_symbols_labeled_impossible_view_eq_iff,Equiv.Perm.mul_applyhave h_bij : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i) Finset.univ).card = (Finset.filter (fun (σ : Equiv.Perm (Fin 6)) => σ i = i ∧ σ (i - 1) = i - 1 ∧ σ (i + 1) = i + 1) Finset.univ).card := by apply Finset.card_bij' (fun π _ => π₀⁻¹ * π) (fun σ _ => π₀ * σ) · intro π hπ simp only [Finset.mem_filter, Finset.mem_univ, true_and] at hπ ⊢ rw [six_circle_two_symbols_labeled_impossible_view_eq_iff] at hπ refine ⟨?_, ?_, ?_⟩ · simp [Equiv.Perm.mul_apply, hπ.1] · simp [Equiv.Perm.mul_apply, hπ.2.1] · simp [Equiv.Perm.mul_apply, hπ.2.2] · intro σ hσ simp only [Finset.mem_filter, Finset.mem_univ, true_and] at hσ ⊢ rw [six_circle_two_symbols_labeled_impossible_view_eq_iff] refine ⟨?_, ?_, ?_⟩ · simp [Equiv.Perm.mul_apply, hσ.1] · simp [Equiv.Perm.mul_apply, hσ.2.1] · simp [Equiv.Perm.mul_apply, hσ.2.2] · intro π _; simp · intro σ _; simp rw [h_bij, h_stab]
The total slip sum can be split into the bit written at seat i plus the sum over the other 5 seats.
Unfolding six_circle_two_symbols_labeled_impossible_total, the sum over all seats Finset.univ is partitioned into the term at seat i and the sum over the erased set Finset.univ.erase i using Finset.add_sum_erase and Finset.mem_univ.
uses
six_circle_two_symbols_labeled_impossible_total,Finset.add_sum_erase,Finset.mem_univlemma six_circle_two_symbols_labeled_impossible_total_eq_add (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (π : Equiv.Perm (Fin 6)) (i : Fin 6) : six_circle_two_symbols_labeled_impossible_total c π = (c (six_circle_view π i) : ℕ) + ∑ j ∈ Finset.univ.erase i, (c (six_circle_view π j) : ℕ) := by dsimp [six_circle_two_symbols_labeled_impossible_total] rw [← Finset.add_sum_erase _ _ (Finset.mem_univ i)]
The sum of written bits over the remaining 5 seats is at most 5.
Because each protocol output c(...) takes values in Fin 2, its natural number value is at most 1. Summing at most 1 over the 5 remaining seats using Finset.sum_le_card_nsmul yields at most 5 * 1 = 5.
uses
Finset.sum_le_card_nsmullemma six_circle_two_symbols_labeled_impossible_sum_erase_le_five (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (π : Equiv.Perm (Fin 6)) (i : Fin 6) : ∑ j ∈ Finset.univ.erase i, (c (six_circle_view π j) : ℕ) ≤ 5 := by have h_le : ∀ j ∈ Finset.univ.erase i, (c (six_circle_view π j) : ℕ) ≤ 1 := by intro j _ obtain ⟨v, hv⟩ := c (six_circle_view π j) omega have h_sum := Finset.sum_le_card_nsmul (Finset.univ.erase i) (fun j => (c (six_circle_view π j) : ℕ)) 1 h_le have h_card : (Finset.univ.erase i).card = 5 := by simp rw [h_card] at h_sum simpa using h_sum
For any π₀, seat i, and k ∈ {1, 2}, exactly one permutation has the view of π₀ at seat i and total slip sum k.
The fiber s of permutations sharing the view of π₀ at seat i has size 6 (six_circle_two_symbols_labeled_impossible_card_fiber_view). On s, the total slip sum is injective by the protocol's assumption h, so its image has size 6 (Finset.card_image_of_injOn). With b = c(view(π₀, i)) ∈ {0, 1} fixed, the total slip sum on s always falls in [b, b + 5] (by six_circle_two_symbols_labeled_impossible_total_eq_add and six_circle_two_symbols_labeled_impossible_sum_erase_le_five). Since |[b, b + 5]| = 6, the image equals [b, b + 5] (Finset.eq_of_subset_of_card_le). As b ≤ 1, both k = 1 and k = 2 belong to [b, b + 5], so each fiber has size 1 by six_circle_two_symbols_labeled_impossible_card_filter_eq_one_of_injOn_of_mem_image.
uses
six_circle_two_symbols_labeled_impossible_card_fiber_view,Finset.mem_coe,Finset.mem_filter,Finset.mem_univ,true_and,Finset.card_image_of_injOn,Finset.mem_image.mp,Finset.mem_Icc,six_circle_two_symbols_labeled_impossible_total_eq_add,six_circle_two_symbols_labeled_impossible_sum_erase_le_five,Finset.eq_of_subset_of_card_le,six_circle_two_symbols_labeled_impossible_card_filter_eq_one_of_injOn_of_mem_imagelemma six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (h : ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), six_circle_view π₁ i = six_circle_view π₂ i → six_circle_two_symbols_labeled_impossible_total c π₁ = six_circle_two_symbols_labeled_impossible_total c π₂ → π₁ = π₂) (π₀ : Equiv.Perm (Fin 6)) (i : Fin 6) (k : ℕ) (hk : k = 1 ∨ k = 2) : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card = 1 := by let s := Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i) Finset.univ have hs_card : s.card = 6 := six_circle_two_symbols_labeled_impossible_card_fiber_view π₀ i have hinj : Set.InjOn (six_circle_two_symbols_labeled_impossible_total c) (s : Set (Equiv.Perm (Fin 6))) := by intro π₁ h1 π₂ h2 htot simp only [s, Finset.mem_coe, Finset.mem_filter, Finset.mem_univ, true_and] at h1 h2 exact h π₁ π₂ i (h1.trans h2.symm) htot have h_img_card : (s.image (six_circle_two_symbols_labeled_impossible_total c)).card = 6 := by rw [Finset.card_image_of_injOn hinj, hs_card] let b := (c (six_circle_view π₀ i) : ℕ) have hb_le : b ≤ 1 := by obtain ⟨bv, hbv⟩ := c (six_circle_view π₀ i) omega have h_sub : s.image (six_circle_two_symbols_labeled_impossible_total c) ⊆ Finset.Icc b (b + 5) := by intro t ht rcases Finset.mem_image.mp ht with ⟨π, hπ, rfl⟩ simp only [s, Finset.mem_filter, Finset.mem_univ, true_and] at hπ simp only [Finset.mem_Icc] rw [six_circle_two_symbols_labeled_impossible_total_eq_add c π i, hπ] refine ⟨by omega, ?_⟩ have := six_circle_two_symbols_labeled_impossible_sum_erase_le_five c π i omega have h_icc_card : (Finset.Icc b (b + 5)).card = 6 := by simp; omega have h_img_eq : s.image (six_circle_two_symbols_labeled_impossible_total c) = Finset.Icc b (b + 5) := Finset.eq_of_subset_of_card_le h_sub (by rw [h_img_card, h_icc_card]) have hk_in : k ∈ s.image (six_circle_two_symbols_labeled_impossible_total c) := by rw [h_img_eq, Finset.mem_Icc] rcases hk with rfl | rfl <;> omega have hk_card := six_circle_two_symbols_labeled_impossible_card_filter_eq_one_of_injOn_of_mem_image hinj hk_in have h_eq : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ) = s.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) := by ext π; simp [s, and_comm] rw [h_eq, hk_card]
For any seat i and view v, the number of permutations with view v and total 1 equals the number with view v and total 2.
We case split on whether any permutation achieves view v at seat i. If one does (π₀), both fibers have size 1 by six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one (with Or.inl and Or.inr). If none does, both fibers are empty (using Finset.notMem_empty and iff_false) and therefore have size 0.
uses
six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one,Or.inl,Or.inr,Finset.mem_filter,Finset.mem_univ,true_and,Finset.notMem_empty,iff_falselemma six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (h : ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), six_circle_view π₁ i = six_circle_view π₂ i → six_circle_two_symbols_labeled_impossible_total c π₁ = six_circle_two_symbols_labeled_impossible_total c π₂ → π₁ = π₂) (i : Fin 6) (v : Fin 6 × Fin 6 × Fin 6 × Fin 6) : (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card = (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ).card := by by_cases hne : ∃ π₀, six_circle_view π₀ i = v · rcases hne with ⟨π₀, rfl⟩ rw [six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one c h π₀ i 1 (Or.inl rfl), six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one c h π₀ i 2 (Or.inr rfl)] · have h1 : (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ) = ∅ := by ext π simp only [Finset.mem_filter, Finset.mem_univ, true_and, Finset.notMem_empty, iff_false] rintro ⟨hvi, _⟩ exact hne ⟨π, hvi⟩ have h2 : (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ) = ∅ := by ext π simp only [Finset.mem_filter, Finset.mem_univ, true_and, Finset.notMem_empty, iff_false] rintro ⟨hvi, _⟩ exact hne ⟨π, hvi⟩ rw [h1, h2]
The total number of permutations with slip total k equals the sum over all views v at seat i of the fiber sizes for view v and total k.
Expressing the cardinality as a sum of 1s (Finset.card_eq_sum_ones), we partition the sum fiberwise by the local view at seat i using Finset.sum_fiberwise. On each fiber, summing 1 over the fiber yields its cardinality via Finset.sum_const, smul_eq_mul, and mul_one.
uses
Finset.card_eq_sum_ones,Finset.sum_fiberwise,Finset.sum_congr,Finset.sum_const,smul_eq_mul,mul_onelemma six_circle_two_symbols_labeled_impossible_card_total_fiberwise (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (k : ℕ) (i : Fin 6) : (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card = ∑ v : Fin 6 × Fin 6 × Fin 6 × Fin 6, (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card := by let s := Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ rw [Finset.card_eq_sum_ones, ← Finset.sum_fiberwise s (fun π => six_circle_view π i) (fun _ => 1)] apply Finset.sum_congr rfl intro v _ have h_sub : (Finset.filter (fun π => six_circle_view π i = v) s).card = (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card := by congr 1; ext π; simp [s, and_comm] rw [Finset.sum_const, smul_eq_mul, mul_one, h_sub]
The sum of written bits at seat i over permutations with total k equals the sum over all views v of the fiber size times c(v).
Decomposing the sum fiberwise by the local view at seat i via Finset.sum_fiberwise, the summand c(view(π, i)) is constant on each fiber and equals c(v) (Finset.mem_filter). Summing this constant over each fiber gives the fiber cardinality times c(v) via Finset.sum_const and nsmul_eq_mul.
uses
Finset.sum_fiberwise,Finset.sum_congr,Finset.mem_filter,Finset.sum_const,nsmul_eq_mullemma six_circle_two_symbols_labeled_impossible_sum_view_fiberwise (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (k : ℕ) (i : Fin 6) : ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ, (c (six_circle_view π i) : ℕ) = ∑ v : Fin 6 × Fin 6 × Fin 6 × Fin 6, (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card * (c v : ℕ) := by let s := Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ rw [← Finset.sum_fiberwise s (fun π => six_circle_view π i) (fun π => (c (six_circle_view π i) : ℕ))] apply Finset.sum_congr rfl intro v _ have h_congr : ∀ π ∈ Finset.filter (fun π => six_circle_view π i = v) s, (c (six_circle_view π i) : ℕ) = (c v : ℕ) := by intro π hπ simp only [s, Finset.mem_filter] at hπ rw [hπ.2] have h_sub : (Finset.filter (fun π => six_circle_view π i = v) s).card = (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card := by congr 1; ext π; simp [s, and_comm] rw [Finset.sum_congr rfl h_congr, Finset.sum_const, nsmul_eq_mul, h_sub] rfl
Assume for contradiction that a valid deterministic protocol c exists.
Suppose there exists a protocol c such that any two permutations sharing a local view at some seat and having the same total number of 1s must be identical. We restate this hypothesis as h in terms of six_circle_view and six_circle_two_symbols_labeled_impossible_total.
theorem six_circle_two_symbols_labeled_impossible : ¬ ∃ c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2, ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), (π₁ i, i, π₁ (i - 1), π₁ (i + 1)) = (π₂ i, i, π₂ (i - 1), π₂ (i + 1)) → (∑ j : Fin 6, (c (π₁ j, j, π₁ (j - 1), π₁ (j + 1)) : ℕ)) = (∑ j : Fin 6, (c (π₂ j, j, π₂ (j - 1), π₂ (j + 1)) : ℕ)) → π₁ = π₂ := by rintro ⟨c, hc⟩ have h : ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), six_circle_view π₁ i = six_circle_view π₂ i → six_circle_two_symbols_labeled_impossible_total c π₁ = six_circle_two_symbols_labeled_impossible_total c π₂ → π₁ = π₂ := by intro π₁ π₂ i hview htot exact hc π₁ π₂ i hview htot
The total number of permutations yielding a sum of 1 equals the total number yielding a sum of 2.
Decomposing all permutations fiberwise by their local view at seat 0 using six_circle_two_symbols_labeled_impossible_card_total_fiberwise, the total count for sum 1 is ∑_v |Fiber(v, 1)| and for sum 2 is ∑_v |Fiber(v, 2)|. By six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq, |Fiber(v, 1)| = |Fiber(v, 2)| for every view v, so Finset.sum_congr yields that the two total counts are equal.
uses
six_circle_two_symbols_labeled_impossible_card_total_fiberwise,Finset.sum_congr,six_circle_two_symbols_labeled_impossible_card_filter_fiber_eqhave h_card_eq : (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card = (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ).card := by rw [six_circle_two_symbols_labeled_impossible_card_total_fiberwise c 1 0, six_circle_two_symbols_labeled_impossible_card_total_fiberwise c 2 0] apply Finset.sum_congr rfl intro v _ exact six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq c h 0 v
For every seat i, the sum of written bits at seat i over permutations with total 1 equals the sum over permutations with total 2.
Using six_circle_two_symbols_labeled_impossible_sum_view_fiberwise, the sum of c(view(π, i)) over permutations with total k decomposes as ∑_v |Fiber(v, k)| * c(v). Since |Fiber(v, 1)| = |Fiber(v, 2)| for every view v by six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq, Finset.sum_congr gives that the two sums are identical for each seat i.
uses
six_circle_two_symbols_labeled_impossible_sum_view_fiberwise,Finset.sum_congr,six_circle_two_symbols_labeled_impossible_card_filter_fiber_eqhave h_view_eq : ∀ i : Fin 6, ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, (c (six_circle_view π i) : ℕ) = ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, (c (six_circle_view π i) : ℕ) := by intro i rw [six_circle_two_symbols_labeled_impossible_sum_view_fiberwise c 1 i, six_circle_two_symbols_labeled_impossible_sum_view_fiberwise c 2 i] apply Finset.sum_congr rfl intro v _ rw [six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq c h i v]
Summing across all seats and swapping sums, the total bits written across all seats for permutations with total 1 equals that for permutations with total 2.
Summing the previous equality over all six seats i and using Finset.sum_comm to swap the summation order on both sides yields ∑_{π: total=1} ∑_{i} c(view(π, i)) = ∑_{π: total=2} ∑_{i} c(view(π, i)).
uses
Finset.sum_congr,Finset.sum_comm,Finset.univhave h_sum_all : ∑ i : Fin 6, ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, (c (six_circle_view π i) : ℕ) = ∑ i : Fin 6, ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, (c (six_circle_view π i) : ℕ) := by apply Finset.sum_congr rfl intro i _ exact h_view_eq i rw [Finset.sum_comm] at h_sum_all rw [Finset.sum_comm (s := Finset.univ)] at h_sum_all
The double sum for total 1 equals the number of permutations N₁, while for total 2 it equals 2 * N₂.
For any permutation x with total k, the sum ∑_y c(view(x, y)) is by definition k. Replacing the inner sum with the constant k via Finset.sum_congr, Finset.sum_const, nsmul_eq_mul, mul_one, and mul_comm evaluates the left side to 1 * N₁ = N₁ and the right side to 2 * N₂. Substituting these into the previous equality gives N₁ = 2 * N₂.
uses
Finset.mem_filter,Finset.sum_congr,Finset.sum_const,nsmul_eq_mul,mul_one,mul_commhave h1 : (∑ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, ∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card := by have : ∀ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, (∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = 1 := by intro x hx simp only [Finset.mem_filter] at hx exact hx.2 rw [Finset.sum_congr rfl this, Finset.sum_const, nsmul_eq_mul, mul_one] rfl have h2 : (∑ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, ∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = 2 * (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ).card := by have : ∀ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, (∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = 2 := by intro x hx simp only [Finset.mem_filter] at hx exact hx.2 rw [Finset.sum_congr rfl this, Finset.sum_const, nsmul_eq_mul, mul_comm] rfl rw [h1, h2] at h_sum_all
The number of permutations N₁ with total 1 is strictly positive.
The fiber of permutations sharing the view of the identity permutation at seat 0 with total 1 has cardinality 1 by six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one and Or.inl. Since this fiber is a subset of all permutations with total 1, Finset.card_le_card implies N₁ ≥ 1 > 0.
uses
Finset.mem_filter,Finset.card_le_card,six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one,Or.inlhave h_pos : 0 < (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card := by have h_sub : (Finset.filter (fun π => six_circle_view π 0 = six_circle_view 1 0 ∧ six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ) ⊆ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ := by intro π hπ simp only [Finset.mem_filter] at hπ ⊢ exact ⟨hπ.1, hπ.2.2⟩ have h_le := Finset.card_le_card h_sub have h_one := six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one c h 1 0 1 (Or.inl rfl) omega
Contradiction: N₁ = 2 * N₁ with N₁ > 0 has no solution in natural numbers. automation
We have N₁ = N₂, N₁ = 2 * N₂, and N₁ > 0, which implies N₁ = 2 * N₁ > 0, an arithmetic contradiction closed by omega.
omega
Equiv.Perm.mul_apply- Applying the composition/product of permutations f * g to x yields f(g(x)).
Finset.add_sum_erase- The sum of a function over a finite set s equals the value at an element a ∈ s plus the sum over s \ {a}.
Finset.card_bij'- If there are maps between two finite sets s and t that are mutually inverse on their domains, then s and t have equal cardinality.
Finset.card_eq_sum_ones- The cardinality of a finite set s equals the sum of 1 over all elements of s.
Finset.card_image_of_injOn- If a function f is injective on a finite set s, then its image f(s) has the same cardinality as s.
Finset.card_le_card- If a finite set s is a subset of t, then |s| ≤ |t|.
Finset.card_singleton- The cardinality of any singleton set is 1.
Finset.eq_of_subset_of_card_le- If a finite set s is a subset of t and |t| ≤ |s|, then s = t.
Finset.mem_filter- An element belongs to the filtered set {x ∈ s | p x} if and only if it belongs to s and satisfies p.
Finset.mem_Icc- An integer x belongs to the closed interval [a, b] if and only if a ≤ x ≤ b.
Finset.mem_image.mp- If y belongs to the image f(s), there exists x ∈ s such that f(x) = y.
Finset.mem_singleton- An element belongs to the singleton {a} if and only if it equals a.
Finset.mem_univ- Every element of a finite type belongs to the universal finset Finset.univ.
Finset.notMem_empty- No element belongs to the empty finset.
Finset.sum_comm- Double sums over two finite sets can be interchanged: ∑ x ∈ s, ∑ y ∈ t, f x y = ∑ y ∈ t, ∑ x ∈ s, f x y.
Finset.sum_congr- If two finite sets are equal and two functions agree pointwise on the set, their sums are equal.
Finset.sum_const- Summing a constant b over a finite set s yields |s| • b.
Finset.sum_fiberwise- A sum over a finite set s can be computed by partitioning s into fibers of a function g and summing the fiber sums.
Finset.sum_le_card_nsmul- If every term in a sum over s is at most n, then the sum is bounded by |s| • n.
Finset.univ- The universal finite set containing all elements of a finite type.
Finset.mem_coe- Coercion from finset to set preserves membership.
iff_false- An equivalence with False is equal to the negation of the proposition.
mul_comm- Multiplication in a commutative structure is commutative: a * b = b * a.
mul_one- Multiplying any element by 1 on the right leaves it unchanged: a * 1 = a.
nsmul_eq_mul- Scalar multiplication by a natural number n on a semiring is equal to multiplication by n.
Or.inl- The left injection into a disjunction: if A holds, then A ∨ B holds.
Or.inr- The right injection into a disjunction: if B holds, then A ∨ B holds.
six_circle_two_symbols_labeled_impossible_card_fiber_view- The fiber of permutations in S₆ having any given local view at seat i has cardinality exactly 6.
six_circle_two_symbols_labeled_impossible_card_filter_eq_one_of_injOn_of_mem_image- If f is injective on a finite set s and k ∈ f(s), the fiber {x ∈ s | f(x) = k} has cardinality 1.
six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq- For any seat i and view v, the number of permutations with view v at seat i and total 1 equals the number with view v at seat i and total 2.
six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one- For any permutation π₀, seat i, and total k ∈ {1, 2}, exactly one permutation shares the view of π₀ at seat i and has total k.
six_circle_two_symbols_labeled_impossible_card_total_fiberwise- The number of permutations with total slip sum k equals the sum over all local views v at seat i of the fiber sizes for view v and total k.
six_circle_two_symbols_labeled_impossible_sum_erase_le_five- The sum of bits written at the 5 seats other than seat i is at most 5.
six_circle_two_symbols_labeled_impossible_sum_view_fiberwise- The sum of bits written at seat i over permutations with total k equals the sum over views v of the fiber size times c(v).
six_circle_two_symbols_labeled_impossible_total- The total slip sum is defined as the sum over all 6 seats of the bit written by protocol c on each sage's local view.
six_circle_two_symbols_labeled_impossible_total_eq_add- The total slip sum equals the bit written at seat i plus the sum of bits written at the other five seats.
six_circle_view- The local view of the sage at seat i under permutation π, defined as the 4-tuple (π(i), i, π(i - 1), π(i + 1)).
six_circle_two_symbols_labeled_impossible_view_eq_iff- Two permutations have the same local view at seat i if and only if they agree at seats i, i - 1, and i + 1.
smul_eq_mul- Scalar multiplication in a multiplicative structure is equal to multiplication.
true_and- Conjunction with True is equivalent to the proposition itself.
- The cardinality of the three-point stabilizer (line 31) is verified by exhaustive computation over the finite type Fin 6 via decide.
- The final arithmetic contradiction (line 240) deriving False from N₁ = 2 * N₁ and N₁ > 0 over ℕ is discharged by the Presburger arithmetic solver omega.
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.
open BigOperatorsdef six_circle_two_symbols_labeled_impossible_total (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (π : Equiv.Perm (Fin 6)) : ℕ := ∑ j : Fin 6, (c (six_circle_view π j) : ℕ)lemma six_circle_two_symbols_labeled_impossible_card_filter_eq_one_of_injOn_of_mem_image {α β : Type*} [DecidableEq α] [DecidableEq β] {s : Finset α} {f : α → β} {k : β} (hinj : Set.InjOn f s) (hk : k ∈ s.image f) : (s.filter (fun x => f x = k)).card = 1 := by rcases Finset.mem_image.mp hk with ⟨x, hx, rfl⟩ have : s.filter (fun y => f y = f x) = {x} := by ext y simp only [Finset.mem_filter, Finset.mem_singleton] constructor · rintro ⟨hy, heq⟩ exact hinj hy hx heq · rintro rfl exact ⟨hx, rfl⟩ rw [this, Finset.card_singleton]lemma six_circle_two_symbols_labeled_impossible_view_eq_iff (π π₀ : Equiv.Perm (Fin 6)) (i : Fin 6) : six_circle_view π i = six_circle_view π₀ i ↔ π i = π₀ i ∧ π (i - 1) = π₀ (i - 1) ∧ π (i + 1) = π₀ (i + 1) := by simp [six_circle_view]lemma six_circle_two_symbols_labeled_impossible_card_fiber_view (π₀ : Equiv.Perm (Fin 6)) (i : Fin 6) : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i) Finset.univ).card = 6 := by have h_stab : (Finset.filter (fun (σ : Equiv.Perm (Fin 6)) => σ i = i ∧ σ (i - 1) = i - 1 ∧ σ (i + 1) = i + 1) Finset.univ).card = 6 := by revert i; decide have h_bij : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i) Finset.univ).card = (Finset.filter (fun (σ : Equiv.Perm (Fin 6)) => σ i = i ∧ σ (i - 1) = i - 1 ∧ σ (i + 1) = i + 1) Finset.univ).card := by apply Finset.card_bij' (fun π _ => π₀⁻¹ * π) (fun σ _ => π₀ * σ) · intro π hπ simp only [Finset.mem_filter, Finset.mem_univ, true_and] at hπ ⊢ rw [six_circle_two_symbols_labeled_impossible_view_eq_iff] at hπ refine ⟨?_, ?_, ?_⟩ · simp [Equiv.Perm.mul_apply, hπ.1] · simp [Equiv.Perm.mul_apply, hπ.2.1] · simp [Equiv.Perm.mul_apply, hπ.2.2] · intro σ hσ simp only [Finset.mem_filter, Finset.mem_univ, true_and] at hσ ⊢ rw [six_circle_two_symbols_labeled_impossible_view_eq_iff] refine ⟨?_, ?_, ?_⟩ · simp [Equiv.Perm.mul_apply, hσ.1] · simp [Equiv.Perm.mul_apply, hσ.2.1] · simp [Equiv.Perm.mul_apply, hσ.2.2] · intro π _; simp · intro σ _; simp rw [h_bij, h_stab]lemma six_circle_two_symbols_labeled_impossible_total_eq_add (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (π : Equiv.Perm (Fin 6)) (i : Fin 6) : six_circle_two_symbols_labeled_impossible_total c π = (c (six_circle_view π i) : ℕ) + ∑ j ∈ Finset.univ.erase i, (c (six_circle_view π j) : ℕ) := by dsimp [six_circle_two_symbols_labeled_impossible_total] rw [← Finset.add_sum_erase _ _ (Finset.mem_univ i)]lemma six_circle_two_symbols_labeled_impossible_sum_erase_le_five (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (π : Equiv.Perm (Fin 6)) (i : Fin 6) : ∑ j ∈ Finset.univ.erase i, (c (six_circle_view π j) : ℕ) ≤ 5 := by have h_le : ∀ j ∈ Finset.univ.erase i, (c (six_circle_view π j) : ℕ) ≤ 1 := by intro j _ obtain ⟨v, hv⟩ := c (six_circle_view π j) omega have h_sum := Finset.sum_le_card_nsmul (Finset.univ.erase i) (fun j => (c (six_circle_view π j) : ℕ)) 1 h_le have h_card : (Finset.univ.erase i).card = 5 := by simp rw [h_card] at h_sum simpa using h_sumlemma six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (h : ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), six_circle_view π₁ i = six_circle_view π₂ i → six_circle_two_symbols_labeled_impossible_total c π₁ = six_circle_two_symbols_labeled_impossible_total c π₂ → π₁ = π₂) (π₀ : Equiv.Perm (Fin 6)) (i : Fin 6) (k : ℕ) (hk : k = 1 ∨ k = 2) : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card = 1 := by let s := Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i) Finset.univ have hs_card : s.card = 6 := six_circle_two_symbols_labeled_impossible_card_fiber_view π₀ i have hinj : Set.InjOn (six_circle_two_symbols_labeled_impossible_total c) (s : Set (Equiv.Perm (Fin 6))) := by intro π₁ h1 π₂ h2 htot simp only [s, Finset.mem_coe, Finset.mem_filter, Finset.mem_univ, true_and] at h1 h2 exact h π₁ π₂ i (h1.trans h2.symm) htot have h_img_card : (s.image (six_circle_two_symbols_labeled_impossible_total c)).card = 6 := by rw [Finset.card_image_of_injOn hinj, hs_card] let b := (c (six_circle_view π₀ i) : ℕ) have hb_le : b ≤ 1 := by obtain ⟨bv, hbv⟩ := c (six_circle_view π₀ i) omega have h_sub : s.image (six_circle_two_symbols_labeled_impossible_total c) ⊆ Finset.Icc b (b + 5) := by intro t ht rcases Finset.mem_image.mp ht with ⟨π, hπ, rfl⟩ simp only [s, Finset.mem_filter, Finset.mem_univ, true_and] at hπ simp only [Finset.mem_Icc] rw [six_circle_two_symbols_labeled_impossible_total_eq_add c π i, hπ] refine ⟨by omega, ?_⟩ have := six_circle_two_symbols_labeled_impossible_sum_erase_le_five c π i omega have h_icc_card : (Finset.Icc b (b + 5)).card = 6 := by simp; omega have h_img_eq : s.image (six_circle_two_symbols_labeled_impossible_total c) = Finset.Icc b (b + 5) := Finset.eq_of_subset_of_card_le h_sub (by rw [h_img_card, h_icc_card]) have hk_in : k ∈ s.image (six_circle_two_symbols_labeled_impossible_total c) := by rw [h_img_eq, Finset.mem_Icc] rcases hk with rfl | rfl <;> omega have hk_card := six_circle_two_symbols_labeled_impossible_card_filter_eq_one_of_injOn_of_mem_image hinj hk_in have h_eq : (Finset.filter (fun π => six_circle_view π i = six_circle_view π₀ i ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ) = s.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) := by ext π; simp [s, and_comm] rw [h_eq, hk_card]lemma six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (h : ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), six_circle_view π₁ i = six_circle_view π₂ i → six_circle_two_symbols_labeled_impossible_total c π₁ = six_circle_two_symbols_labeled_impossible_total c π₂ → π₁ = π₂) (i : Fin 6) (v : Fin 6 × Fin 6 × Fin 6 × Fin 6) : (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card = (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ).card := by by_cases hne : ∃ π₀, six_circle_view π₀ i = v · rcases hne with ⟨π₀, rfl⟩ rw [six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one c h π₀ i 1 (Or.inl rfl), six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one c h π₀ i 2 (Or.inr rfl)] · have h1 : (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ) = ∅ := by ext π simp only [Finset.mem_filter, Finset.mem_univ, true_and, Finset.notMem_empty, iff_false] rintro ⟨hvi, _⟩ exact hne ⟨π, hvi⟩ have h2 : (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ) = ∅ := by ext π simp only [Finset.mem_filter, Finset.mem_univ, true_and, Finset.notMem_empty, iff_false] rintro ⟨hvi, _⟩ exact hne ⟨π, hvi⟩ rw [h1, h2]lemma six_circle_two_symbols_labeled_impossible_card_total_fiberwise (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (k : ℕ) (i : Fin 6) : (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card = ∑ v : Fin 6 × Fin 6 × Fin 6 × Fin 6, (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card := by let s := Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ rw [Finset.card_eq_sum_ones, ← Finset.sum_fiberwise s (fun π => six_circle_view π i) (fun _ => 1)] apply Finset.sum_congr rfl intro v _ have h_sub : (Finset.filter (fun π => six_circle_view π i = v) s).card = (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card := by congr 1; ext π; simp [s, and_comm] rw [Finset.sum_const, smul_eq_mul, mul_one, h_sub]lemma six_circle_two_symbols_labeled_impossible_sum_view_fiberwise (c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2) (k : ℕ) (i : Fin 6) : ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ, (c (six_circle_view π i) : ℕ) = ∑ v : Fin 6 × Fin 6 × Fin 6 × Fin 6, (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card * (c v : ℕ) := by let s := Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ rw [← Finset.sum_fiberwise s (fun π => six_circle_view π i) (fun π => (c (six_circle_view π i) : ℕ))] apply Finset.sum_congr rfl intro v _ have h_congr : ∀ π ∈ Finset.filter (fun π => six_circle_view π i = v) s, (c (six_circle_view π i) : ℕ) = (c v : ℕ) := by intro π hπ simp only [s, Finset.mem_filter] at hπ rw [hπ.2] have h_sub : (Finset.filter (fun π => six_circle_view π i = v) s).card = (Finset.filter (fun π => six_circle_view π i = v ∧ six_circle_two_symbols_labeled_impossible_total c π = k) Finset.univ).card := by congr 1; ext π; simp [s, and_comm] rw [Finset.sum_congr rfl h_congr, Finset.sum_const, nsmul_eq_mul, h_sub] rfl/-- Theorem 8 (arXiv:2610.33032): The 6C2L anonymous-slip puzzle has no deterministic solution. -/theorem six_circle_two_symbols_labeled_impossible : ¬ ∃ c : (Fin 6 × Fin 6 × Fin 6 × Fin 6) → Fin 2, ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), (π₁ i, i, π₁ (i - 1), π₁ (i + 1)) = (π₂ i, i, π₂ (i - 1), π₂ (i + 1)) → (∑ j : Fin 6, (c (π₁ j, j, π₁ (j - 1), π₁ (j + 1)) : ℕ)) = (∑ j : Fin 6, (c (π₂ j, j, π₂ (j - 1), π₂ (j + 1)) : ℕ)) → π₁ = π₂ := by rintro ⟨c, hc⟩ have h : ∀ (π₁ π₂ : Equiv.Perm (Fin 6)) (i : Fin 6), six_circle_view π₁ i = six_circle_view π₂ i → six_circle_two_symbols_labeled_impossible_total c π₁ = six_circle_two_symbols_labeled_impossible_total c π₂ → π₁ = π₂ := by intro π₁ π₂ i hview htot exact hc π₁ π₂ i hview htot have h_card_eq : (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card = (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ).card := by rw [six_circle_two_symbols_labeled_impossible_card_total_fiberwise c 1 0, six_circle_two_symbols_labeled_impossible_card_total_fiberwise c 2 0] apply Finset.sum_congr rfl intro v _ exact six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq c h 0 v have h_view_eq : ∀ i : Fin 6, ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, (c (six_circle_view π i) : ℕ) = ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, (c (six_circle_view π i) : ℕ) := by intro i rw [six_circle_two_symbols_labeled_impossible_sum_view_fiberwise c 1 i, six_circle_two_symbols_labeled_impossible_sum_view_fiberwise c 2 i] apply Finset.sum_congr rfl intro v _ rw [six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq c h i v] have h_sum_all : ∑ i : Fin 6, ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, (c (six_circle_view π i) : ℕ) = ∑ i : Fin 6, ∑ π ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, (c (six_circle_view π i) : ℕ) := by apply Finset.sum_congr rfl intro i _ exact h_view_eq i rw [Finset.sum_comm] at h_sum_all rw [Finset.sum_comm (s := Finset.univ)] at h_sum_all have h1 : (∑ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, ∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card := by have : ∀ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ, (∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = 1 := by intro x hx simp only [Finset.mem_filter] at hx exact hx.2 rw [Finset.sum_congr rfl this, Finset.sum_const, nsmul_eq_mul, mul_one] rfl have h2 : (∑ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, ∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = 2 * (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ).card := by have : ∀ x ∈ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 2) Finset.univ, (∑ y : Fin 6, (c (six_circle_view x y) : ℕ)) = 2 := by intro x hx simp only [Finset.mem_filter] at hx exact hx.2 rw [Finset.sum_congr rfl this, Finset.sum_const, nsmul_eq_mul, mul_comm] rfl rw [h1, h2] at h_sum_all have h_pos : 0 < (Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ).card := by have h_sub : (Finset.filter (fun π => six_circle_view π 0 = six_circle_view 1 0 ∧ six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ) ⊆ Finset.filter (fun π => six_circle_two_symbols_labeled_impossible_total c π = 1) Finset.univ := by intro π hπ simp only [Finset.mem_filter] at hπ ⊢ exact ⟨hπ.1, hπ.2.2⟩ have h_le := Finset.card_le_card h_sub have h_one := six_circle_two_symbols_labeled_impossible_card_filter_fiber_eq_one c h 1 0 1 (Or.inl rfl) omega omega