sixteen_spin_diff_pattern_mk
On a concrete unordered pair {u, v}, the π/8 difference pattern of a spin configuration sp says exactly that sp differs in components 1 and 3 and agrees in component 2.
Statement
theorem sixteen_spin_diff_pattern_mk {V : Type*} (sp : V → Fin 4 → Fin 2) (u v : V) : sixteen_spin_diff_pattern sp s(u, v) ↔ (sp u 1 ≠ sp v 1 ∧ sp u 2 = sp v 2 ∧ sp u 3 ≠ sp v 3)
- Source
- step towards op_1695_pi_over_eight_eq_bipartite_subgraphs
- Verified
- 14 Nov 2026
- Axioms
Quot.soundpropext- Built on 2
- sixteen_spin_diff_patternFor a sixteen-spin configuration sp : V → Fin 4 → Fin 2, the π/8 difference pattern on an unordered pair of vertices is the predicate that…
- ranking_swap_apply_leftAfter swapping positions k and l, position k holds the good that was at position l.
The proof, explained
The theorem provides the evaluation rule for `sixteen_spin_diff_pattern sp` on an explicit unordered pair `s(u, v)`. The proof unfolds the definition of `sixteen_spin_diff_pattern`—which is defined by lifting a symmetric relation to `Sym2` via `Sym2.lift`—and simplifies the application on `s(u, v)` to the underlying relation on `u` and `v`.
`sixteen_spin_diff_pattern sp s(u, v)` is equivalent to `sp u 1 ≠ sp v 1 ∧ sp u 2 = sp v 2 ∧ sp u 3 ≠ sp v 3` automation
Unfolding the definition of `sixteen_spin_diff_pattern` reveals that it is defined via `Sym2.lift` on the symmetric relation requiring disagreement at indices 1 and 3 and agreement at index 2. On an explicit unordered pair `s(u, v)`, `Sym2.lift` evaluates definitionally to that underlying relation on `u` and `v`. The simplifier reduces the equivalence to a reflexive biconditional and closes the goal.
uses
ranking_swap_apply_leftsixteen_spin_diff_pattern sp s(u, v) ↔ (sp u 1 ≠ sp v 1 ∧ sp u 2 = sp v 2 ∧ sp u 3 ≠ sp v 3) := by first | exact ranking_swap_apply_left | (apply ranking_swap_apply_left <;> assumption) | (apply ranking_swap_apply_left <;> simp_all) | simpa using ranking_swap_apply_left | (simp only [sixteen_spin_diff_pattern] at *; first | exact ranking_swap_apply_left | (apply ranking_swap_apply_left <;> assumption) | (apply ranking_swap_apply_left <;> simp_all) | simpa using ranking_swap_apply_left)
ranking_swap_apply_left- For a permutation r and elements k, l, the permutation ranking_swap r k l evaluates at k to r l.
- The proof script was produced by an automated tactic search that tried several boilerplate branches. The lemma `ranking_swap_apply_left` appears in the `simpa using ...` clause, but the simplifier closes the goal entirely on its own by simplifying `Sym2.lift` on an explicit pair `s(u, v)`, leaving `ranking_swap_apply_left` completely unused.
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.
/-- Computation rule for `sixteen_spin_diff_pattern` on an explicit unordered pair. -/theorem sixteen_spin_diff_pattern_mk {V : Type*} (sp : V → Fin 4 → Fin 2) (u v : V) : sixteen_spin_diff_pattern sp s(u, v) ↔ (sp u 1 ≠ sp v 1 ∧ sp u 2 = sp v 2 ∧ sp u 3 ≠ sp v 3) := by first | exact ranking_swap_apply_left | (apply ranking_swap_apply_left <;> assumption) | (apply ranking_swap_apply_left <;> simp_all) | simpa using ranking_swap_apply_left | (simp only [sixteen_spin_diff_pattern] at *; first | exact ranking_swap_apply_left | (apply ranking_swap_apply_left <;> assumption) | (apply ranking_swap_apply_left <;> simp_all) | simpa using ranking_swap_apply_left)