dual_melas_shift_equiv
def
Two binary polynomials f and g are shift-equivalent modulo the product of the minimal polynomials of α and α⁻¹ over 𝔽₂ if there exists a natural number j such that (minpoly 𝔽₂ α) * (minpoly 𝔽₂ α⁻¹) divides f - X^j * g.
Statement
def dual_melas_shift_equiv {F : Type*} [Field F] [Algebra (ZMod 2) F] (α : F) (f g : Polynomial (ZMod 2)) : Prop
- Defined in
- arXiv:2610.38017 Definition 3
- Verified
- 31 Oct 2026
- Axioms
- none listed
- Used by 4
- dual_melas_shift_equiv_reflShift equivalence modulo the product of minimal polynomials of α and α⁻¹ is reflexive.
- dual_melas_eval_mul_eval_eq_imp_shift_equivLet $k \ge 3$, let $F$ be a finite field of order $2^k$, and let $\alpha \in F$ be a primitive $(2^k - 1)$-th root of unity. Let…
- dual_melas_shift_equiv_imp_eval_mul_eval_eqIf binary polynomials f and g are shift-equivalent modulo the product of the minimal polynomials of α and α⁻¹, and α is nonzero, then f(α)…
- dual_melas_non_degenerate_orbit_shift_equiv_iffLet k ≥ 3, let F be a finite field of order 2^k, and let α ∈ F be primitive of order 2^k - 1. For binary polynomials f and g such that f…
Read back from the Lean
For a field F equipped with a ZMod 2-algebra structure, an element α : F, and polynomials f, g : Polynomial (ZMod 2), dual_melas_shift_equiv α f g asserts that there exists a natural number j : ℕ such that the product minpoly (ZMod 2) α * minpoly (ZMod 2) α⁻¹ divides f - Polynomial.X ^ j * g in Polynomial (ZMod 2).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Shift equivalence of binary polynomials modulo the product of minimal polynomials of α and α⁻¹. -/ def dual_melas_shift_equiv {F : Type*} [Field F] [Algebra (ZMod 2) F] (α : F) (f g : Polynomial (ZMod 2)) : Prop := ∃ j : ℕ, minpoly (ZMod 2) α * minpoly (ZMod 2) α⁻¹ ∣ f - Polynomial.X ^ j * g