Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 2,569 research declarations. Search 10,000 more complete Mathlib declarations.

All topics

2569 results

Project-declaredLean 4.31.0

Half Sum coeff eq zero

ArkLib.Lattices.CyclotomicModulus.halfSum_coeff_eq_zero

Plain-language statement

Linear independence of 1, ζ, …, ζ^{2^{α-1}-1} makes each collected coefficient vanish.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Hexp card

ArkLib.Lattices.CyclotomicModulus.Hexp_card

Plain-language statement

|H| = d/k = 2^α / k (Hachi [NOZ26, §3], from |⟨4k+1⟩| = d/(2k) and the ± factor). The hypotheses match Hachi [NOZ26, §3, Claim 1] / [LS18, Lem 2.4]: k is a power of two (hk2pow) and divides d/2, i.e. 2k ∣ d = 2^α (hk). Both are needed for 4k+1 to have order exactly d/(2k) in (Z/2^{α+1})ˣ; the weaker k ∣ 2^α (= k ∣ d) does not suf...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Hexp generator smul

ArkLib.Lattices.CyclotomicModulus.Hexp_generator_smul

Plain-language statement

Multiplication by a generator permutes Hexp (as a Finset), i.e. the image under i ↦ (g·i) mod 2^{α+1} is Hexp itself, for g a generator of H = ⟨σ_{-1}, σ_{4k+1}⟩. This is the group-translation fact g • H = H transported through the Hexp ↔ H bridge. Proof: the number-theoretic input (two_pow_dvd_four_pow_sub_one_iff ⟹ `(4k+1)^{2^{α-κ-1}}...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Hexp odd mem

ArkLib.Lattices.CyclotomicModulus.Hexp_odd_mem

Plain-language statement

Every exponent enumerated by Hexp is odd (so the corresponding σ_i is a genuine automorphism). The base 4k+1 is odd; reduction mod the even conductor 2^{α+1} and the (m − ·) reflection both preserve oddness.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Irreducible X pow sub C r

ArkLib.Lattices.CyclotomicModulus.irreducible_X_pow_sub_C_r

Plain-language statement

Irreducibility of the splitting factor. X^{2^{α-1}} - r is irreducible over ZMod q, given the order fact horder (supplied by orderOf_q_mod_two_pow). Uses ZMod.irreducible_of_dvd_cyclotomic_of_natDegree: the factor divides cyclotomic 2^{α+1} = X^{2^α}+1 and has degree 2^{α-1} = orderOf (q mod 2^{α+1}).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Is Unit mk of is Coprime

ArkLib.Lattices.CyclotomicModulus.isUnit_mk_of_isCoprime

Plain-language statement

If a is coprime to f then Ideal.Quotient.mk (span {f}) a is a unit.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record