dual_melas_shift_equiv_refl
Shift equivalence modulo the product of minimal polynomials of α and α⁻¹ is reflexive.
Statement
theorem dual_melas_shift_equiv_refl {F : Type*} [Field F] [Algebra (ZMod 2) F] (α : F) (f : Polynomial (ZMod 2)) : dual_melas_shift_equiv α f f
- Source
- arXiv:2610.38017 Definition 3
- Verified
- 01 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- dual_melas_shift_equivTwo binary polynomials f and g are shift-equivalent modulo the product of the minimal polynomials of α and α⁻¹ over 𝔽₂ if there exists a…
Read back from the Lean
For any field $F$ with an algebra structure over $\mathbb{Z}/2\mathbb{Z}$, any element $\alpha \in F$, and any polynomial $f \in (\mathbb{Z}/2\mathbb{Z})[X]$, the relation dual_melas_shift_equiv α f f holds.
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
Dual Melas shift equivalence between two polynomials requires that their difference after a shift $X^j$ is divisible by the product of the minimal polynomials of $\alpha$ and $\alpha^{-1}$. To prove reflexivity, we choose the shift $j = 0$. The difference $f - X^0 f$ then reduces to $f - f = 0$, which is trivially divisible by any polynomial.
$f$ is shift-equivalent to $f$. automation
By definition, two polynomials $f$ and $g$ are shift-equivalent if there is some shift $j \in \mathbb{N}$ such that $\operatorname{minpoly}(\alpha) \cdot \operatorname{minpoly}(\alpha^{-1})$ divides $f - X^j g$. We provide $j = 0$ as the witness. The simplifier reduces $X^0 \cdot f$ to $f$, computes $f - f = 0$, and solves the divisibility goal since every element divides zero.
dual_melas_shift_equiv α f f := ⟨0, by simp⟩
- The simplification tactic `simp` automatically applies algebraic identities: $X^0 = 1$, $1 \cdot f = f$, $f - f = 0$, and the lemma that any polynomial divides $0$.
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.
/-- Shift equivalence is reflexive. -/theorem dual_melas_shift_equiv_refl {F : Type*} [Field F] [Algebra (ZMod 2) F] (α : F) (f : Polynomial (ZMod 2)) : dual_melas_shift_equiv α f f := ⟨0, by simp⟩