All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Neg one not Mem powers q

ArkLib.Lattices.CyclotomicModulus.neg_one_notMem_powers_q

Plain-language statement

(Phase 1) −1 ∉ ⟨q⟩ in (Z/2^{α+1})ˣ, stated as: no power of q equals −1. For q ≡ 5 (mod 8), every power of q is ≡ 1 (mod 4) (since q ≡ 1 (mod 4)), while −1 ≡ 3 (mod 4) (as α ≥ 1, so 4 ∣ 2^{α+1}); projecting to ZMod 4 separates them. This is the precise sense in which q ≡ 5 (mod 8) forces σ_{-1} to swap the two CRT factors.

Exact Lean statement

theorem neg_one_notMem_powers_q (hq5 : q % 8 = 5) {α : ℕ} (hα : 1 ≤ α) :
    ∀ n : ℕ, (q : ZMod (2 ^ (α + 1))) ^ n ≠ -1

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem neg_one_notMem_powers_q (hq5 : q % 8 = 5) {α : } (hα : 1  α) :     n : , (q : ZMod (2 ^+ 1))) ^ n  -1 := by  intro n hn  have hdvd : (4 : ) ∣ 2 ^+ 1) := by    rw [show (4 : ) = 2 ^ 2 from rfl]; exact pow_dvd_pow 2 (by omega)  have hq4 : (q : ZMod 4) = 1 := by    have h := (ZMod.natCast_eq_natCast_iff q 1 4).mpr (by rw [Nat.ModEq]; omega)    simpa using h  have hcast := congrArg (ZMod.castHom hdvd (ZMod 4)) hn  rw [map_pow, map_neg, map_one, map_natCast, hq4, one_pow] at hcast  exact absurd hcast (by decide)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/Subfield/Factorization.lean:74-84

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