All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Trace H psi mul conj

ArkLib.Lattices.CyclotomicModulus.traceH_psi_mul_conj

Plain-language statement

Hachi [NOZ26, §3, Theorem 2]: Tr_H(ψ(a)·σ_{-1}(ψ(b))) = (d/k)·⟨a,b⟩, where ⟨a,b⟩ = Σ_i a_i b_i is the inner product over R_q^H. Expand the product as a double sum, pull the R_q^H-coefficients out of Tr_H (traceH_smul_fixed), evaluate the monomial kernel (traceH_kernel, which is (d/k)·[p=q]), and collapse the diagonal.

Exact Lean statement

theorem traceH_psi_mul_conj (α k : ℕ) (h2 : (2 : R) ≠ 0) (hk2pow : ∃ κ, k = 2 ^ κ)
    (hk : 2 * k ∣ 2 ^ α)
    (a b : Fin (2 ^ α / k) → fixedSubring (R := R) α k) :
    traceH α k (psi α k a * conjAut α (psi α k b))
      = (2 ^ α / k) • ((∑ i, a i * b i : fixedSubring (R := R) α k) :
          Rq (powTwoCyclotomic (R := R) α))

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem traceH_psi_mul_conj (α k : ) (h2 : (2 : R)  0) (hk2pow :  κ, k = 2 ^ κ)    (hk : 2 * k ∣ 2 ^ α)    (a b : Fin (2 ^ α / k)  fixedSubring (R := R) α k) :    traceH α k (psi α k a * conjAut α (psi α k b))      = (2 ^ α / k) • ((∑ i, a i * b i : fixedSubring (R := R) α k) :          Rq (powTwoCyclotomic (R := R) α)) := by  obtain κ, rfl := hk2pow  have hκ : κ + 1  α := succ_le_of_two_mul_two_pow_dvd hk  -- `σ_{-1}(ψ(b)) = Σ_q ↑(b q)·X^{e_q·σ_{-1}}` (`σ_{-1}` fixes `b q ∈ R_q^H`)  have hconjpsi : conjAut α (psi α (2 ^ κ) b)      = ∑ q, (b q : Rq (powTwoCyclotomic α))          * Xpow (powTwoCyclotomic α) (packExp α (2 ^ κ) q.val * conjExp α) := by    unfold psi    rw [map_sum]    refine Finset.sum_congr rfl (fun q _ => ?_)    rw [map_mul, ((mem_fixedSubring_iff α (2 ^ κ) _).mp (b q).2).1, conjAut, galoisRingHom_apply,      galoisAut_Xpow' α (conjExp α) _ (conjExp_odd α)]  -- Rewrite each summand in place via `Finset.sum_congr`; the coefficient `↑(a p)·↑(b q)` arises  -- from `mul_mem`/`traceH_smul_fixed`, so it is never written as a `coe * coe` product (which  -- mis-resolves to the subring's `*`).  rw [hconjpsi]  unfold psi  rw [Finset.sum_mul_sum]  simp only [traceH_sum]  rw [Finset.sum_congr rfl (fun p _ => Finset.sum_congr rfl (fun q _ => by    rw [mul_mul_mul_comm,  Xpow_add, traceH_smul_fixed α (2 ^ κ) (mul_mem (a p).2 (b q).2),      traceH_kernel α κ h2 hκ p q]))]  simp only [mul_ite, mul_zero, Finset.sum_ite_eq, Finset.mem_univ, if_true, mul_smul_comm,    mul_one]  rw [ Finset.smul_sum]  congr 1  rw [AddSubmonoidClass.coe_finsetSum]  simp only [MulMemClass.coe_mul]
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/Subfield/TraceInnerProduct.lean:229-261

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