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 423 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

423 results

Clear filters
Project-declaredLean 4.31.0

Four pow i geom zero

ArkLib.Lattices.CyclotomicModulus.four_pow_i_geom_zero

Plain-language statement

The geometric sum ∑_{j<d/2k} (X^{4ki})^j = 0 when d/2k ∤ i. The ratio r = X^{4ki} satisfies r^{d/2k} = X^{2di} = 1, and r - 1 is a unit (Xpow_sub_one_isUnit, since X^{4ki·2^t} = -1 for a suitable t extracted from the 2-adic valuation of i).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Four pow i reindex

ArkLib.Lattices.CyclotomicModulus.four_pow_i_reindex

Plain-language statement

Claim 1 reindex: ∑_{a<n} X^{i·((4k+1)^a mod 2d)} = X^i·∑_{j<n} (X^{4ki})^j. The subgroup ⟨4k+1⟩ = {(4k+1)^a mod 2d} equals the arithmetic progression {4k·j+1 : j<n} (both have n distinct elements, and (4k+1)^a ≡ 1 mod 4k), which linearizes the exponent and exposes the geometric series.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Four pow mod period

ArkLib.Lattices.CyclotomicModulus.four_pow_mod_period

Plain-language statement

The power gⁿ mod 2^{α+1} depends only on n mod 2^{α-κ-1} (period = order of g).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Galois Aut comp

ArkLib.Lattices.CyclotomicModulus.galoisAut_comp

Plain-language statement

Composition law σ_i ∘ σ_j = σ_{ij} (for i, j odd, so the maps are genuine automorphisms). Proven on the semantic aeval side via the soundness bridge galoisAut_toQuotient and aeval_X_pow_aeval_X_pow.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

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

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Galois Aut map one

ArkLib.Lattices.CyclotomicModulus.galoisAut_map_one

Plain-language statement

σ_i fixes 1, since only the constant term contributes (so in particular σ_1 fixes it).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record