All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Domain implies char ne 2

Domain.FftDomainClass.domain_implies_char_ne_2

Plain-language statement

The existence of a nontrivial smooth FFT domain rules out characteristic 2.

Exact Lean statement

lemma domain_implies_char_ne_2 [NeZero n] (ω : D) :
  ¬CharP F 2

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma domain_implies_char_ne_2 [NeZero n] (ω : D) :  ¬CharP F 2 := fun hchar  by  have hn : n  0 := NeZero.ne _  set k : Fin (2 ^ n) := 2 ^ (n - 1), pow_lt_pow_right₀ (by decide) (by omega)  have hk_ne_zero : k  0 := by simp [Fin.ext_iff, k]  have h_ne_val : ω k  ω 0 := fun h => hk_ne_zero (CosetFftDomainClass.injective ω h)  have h_ne_one : ω k  1 := by rwa [apply_zero_eq_one] at h_ne_val  have h_kk : k + k = 0 := by    ext    simp only [Fin.val_add, Fin.coe_ofNat_eq_mod, Nat.zero_mod, k]    rcases n with _ | n <;> simp_all    ring_nf    simp  have h_sq : (ω k) ^ 2 = 1 := by    rw [sq, apply_add_eq_mul, h_kk, apply_zero_eq_one]  have h_eq : ω k = 1  ω k = -1 := sq_eq_one_iff.mp h_sq  have h_neg_eq_pos : (-1 : F) = 1 := by    have : (2 : F) = 0 := CharP.cast_eq_zero F 2    conv_rhs =>      rw [show (1 : F) = 2 - 1 by norm_num, this]    simp  rcases h_eq with h | h  · exact h_ne_one h  · exact h_ne_one (by rwa [h_neg_eq_pos] at h)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Domain/FftDomain/Ops.lean:161-184

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