All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Galois Aut fixed of mem

ArkLib.Lattices.CyclotomicModulus.galoisAut_fixed_of_mem

Plain-language statement

Every σ_m with m ∈ Hexp fixes R_q^H: modulo 2d, m is ±(4k+1)^a, and the two generators σ_{4k+1}, σ_{-1} fix R_q^H (so does any composite).

Exact Lean statement

theorem galoisAut_fixed_of_mem (α k : ℕ) {c : Rq (powTwoCyclotomic (R := R) α)}
    (hc : c ∈ fixedSubring α k) :
    ∀ m ∈ Hexp α k, galoisAut (powTwoCyclotomic α) m c = c

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem galoisAut_fixed_of_mem (α k : ) {c : Rq (powTwoCyclotomic (R := R) α)}    (hc : c  fixedSubring α k) :     m  Hexp α k, galoisAut (powTwoCyclotomic α) m c = c := by  obtain hconjc, hgenc := (mem_fixedSubring_iff α k c).mp hc  have hodd1 : Odd (4 * k + 1) := 2 * k, by ring  have hgen' : galoisAut (powTwoCyclotomic α) (4 * k + 1) c = c := by    rw [genAut, galoisRingHom_apply] at hgenc; exact hgenc  have hconj' : galoisAut (powTwoCyclotomic α) (conjExp α) c = c := by    rw [conjAut, galoisRingHom_apply] at hconjc; exact hconjc  have hgen_pow :  a, galoisAut (powTwoCyclotomic α) ((4 * k + 1) ^ a) c = c := by    intro a    induction a with    | zero => rw [pow_zero, galoisAut_one_eq]    | succ a ih =>      rw [pow_succ',  galoisAut_comp α (4 * k + 1) ((4 * k + 1) ^ a) hodd1 hodd1.pow, ih, hgen']  have hmpos : 0 < 2 ^+ 1) := by positivity  have h2d : (2 : ) ∣ 2 ^+ 1) := dvd_pow_self 2 (Nat.succ_ne_zero α)  intro m hm  rw [Hexp, Finset.mem_biUnion] at hm  obtain a, _, hma := hm  have hpa : (4 * k + 1) ^ a % 2 ^+ 1) < 2 ^+ 1) := Nat.mod_lt _ hmpos  have hpa_odd : Odd ((4 * k + 1) ^ a % 2 ^+ 1)) := by    rw [Nat.odd_iff, Nat.mod_mod_of_dvd _ h2d]; exact Nat.odd_iff.mp hodd1.pow  rw [Finset.mem_insert, Finset.mem_singleton] at hma  rcases hma with rfl | rfl  · rw [ galoisAut_periodic, hgen_pow]  · have hmodneg : (2 ^+ 1) - (4 * k + 1) ^ a % 2 ^+ 1)) % 2 ^+ 1)        = (conjExp α * ((4 * k + 1) ^ a % 2 ^+ 1))) % 2 ^+ 1) := by      have hc1 : conjExp α + 1 = 2 ^+ 1) := by        rw [conjExp]; have : 1  2 ^+ 1) := Nat.one_le_two_pow; omega      have hmodeq : conjExp α * ((4 * k + 1) ^ a % 2 ^+ 1))2 ^+ 1) - (4 * k + 1) ^ a % 2 ^+ 1) [MOD 2 ^+ 1)] := by        apply Nat.ModEq.add_right_cancel' ((4 * k + 1) ^ a % 2 ^+ 1))        rw [Nat.sub_add_cancel (le_of_lt hpa),          show conjExp α * ((4 * k + 1) ^ a % 2 ^+ 1)) + (4 * k + 1) ^ a % 2 ^+ 1)            = ((4 * k + 1) ^ a % 2 ^+ 1)) * 2 ^+ 1) from by            rw [conjExp, Nat.sub_mul, one_mul, mul_comm,              Nat.sub_add_cancel (Nat.le_mul_of_pos_right _ (by positivity))]]        exact (Nat.modEq_zero_iff_dvd.mpr (4 * k + 1) ^ a % 2 ^+ 1), mul_comm _ _).trans          (Nat.modEq_zero_iff_dvd.mpr 1, (mul_one _).symm).symm      exact hmodeq.symm    rw [hmodneg,  galoisAut_periodic,       galoisAut_comp α (conjExp α) ((4 * k + 1) ^ a % 2 ^+ 1)) (conjExp_odd α) hpa_odd,       galoisAut_periodic, hgen_pow, hconj']
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/Subfield/TraceInnerProduct.lean:45-88

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

Project-declaredLean 4.31.0

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...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

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.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record