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

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
Project-declaredLean 4.31.0

Galois Aut mul

ArkLib.Lattices.CyclotomicModulus.galoisAut_mul

Plain-language statement

Multiplicativity of the computable automorphism, transported from galoisAutₛ (a RingHom) through the soundness bridge.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Galois Aut sum to Poly eq aeval

ArkLib.Lattices.CyclotomicModulus.galoisAut_sum_toPoly_eq_aeval

Plain-language statement

(S5) The core polynomial identity behind soundness: the monomial-remapped sum (before reduction) equals aeval (X^i) of the underlying polynomial. Both sides are ∑_{k<d} X^{ki}·a_k.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Galois Aut Xpow

ArkLib.Lattices.CyclotomicModulus.galoisAut_Xpow

Plain-language statement

σ_m (X^i) = X^{i·m} (reduced). For i < 2^α the monomial-remap defining galoisAut collapses to the single surviving term. This is the key input to the trace-of-monomial computation in TraceInnerProduct.lean.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Galois Autₛ fixed is Unit

ArkLib.Lattices.CyclotomicModulus.galoisAutₛ_fixed_isUnit

Project documentation

Core unit lemma. In S = Z_q[X]/(X^{2^α}+1), every nonzero σ_{-1}-fixed element is a unit. If b = mk g is not a unit then g shares a factor p_i with X^{2^α}+1 = p₁p₂; the reverse identity plus the swap p₁.reverse ~ p₂ force g to be divisible by both p₁ and p₂, hence by X^{2^α}+1, so b = 0.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record