Galois Aut map one
ArkLib.Lattices.CyclotomicModulus.galoisAut_map_one
Plain-language statement
σ_i fixes 1, since only the constant term contributes (so in particular σ_1 fixes it).
Exact Lean statement
theorem galoisAut_map_one (α i : ℕ) : galoisAut (powTwoCyclotomic (R := R) α) i 1 = 1
Formal artifact
Lean source
theorem galoisAut_map_one (α i : ℕ) : galoisAut (powTwoCyclotomic (R := R) α) i 1 = 1 := by have h2 : (0 : ℕ) < 2 ^ α := pow_pos (by norm_num) α have hpos : 0 < (powTwoCyclotomic (R := R) α).φ.natDegree := by rw [powTwoCyclotomic_natDegree]; exact h2 have hone : (1 : Rq (powTwoCyclotomic (R := R) α)).1 = (1 : CPolynomial R) := by change (powTwoCyclotomic (R := R) α).reduce 1 = 1 refine CyclotomicModulus.reduce_eq_self_of_degree_lt _ ?_ rw [CompPoly.CPolynomial.toPoly_one, Polynomial.degree_one, powTwoCyclotomic_toPoly, ← Polynomial.C_1, Polynomial.degree_X_pow_add_C h2 (1 : R)] exact_mod_cast h2 have hcoeff : ∀ k, (1 : Rq (powTwoCyclotomic (R := R) α)).1.coeff k = if k = 0 then (1 : R) else 0 := fun k => by rw [hone]; exact CompPoly.CPolynomial.coeff_one k have hm : (monomial 0 (1 : R) : CPolynomial R) = 1 := CompPoly.CPolynomial.eq_iff_coeff.mpr fun j => by rw [CompPoly.CPolynomial.coeff_monomial, CompPoly.CPolynomial.coeff_one] unfold galoisAut rw [Finset.sum_eq_single_of_mem 0 (Finset.mem_range.mpr hpos) (fun k _ hk => by rw [hcoeff, if_neg hk, monomial_eq_zero]), hcoeff, if_pos rfl, Nat.zero_mul, hm] rfl- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/Lattices/CyclotomicRing/Galois/Automorphism.lean:84-104
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Affine gaps lifted to interleaved codes
affine_gaps_lifted_to_interleaved_codes
Project documentation
This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose coeff
ArkLib.Lattices.Ajtai.gadgetDecompose_coeff
Plain-language statement
The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.