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

Coeff psi abs le two vec CInf Norm

ArkLib.Lattices.CyclotomicModulus.coeff_psi_abs_le_two_vecCInfNorm

Project documentation

Main combinatorial bound (at most two contributions per position). For p < d, the p-th coefficient of ψ(a) is ± c₁ ± c₂ where c₁, c₂ are coefficients of the (at most two) entries of a whose index matches p's residue class mod d/2k (j₁ := p mod d/2k from the first half, j₂ := d/2k + p mod d/2k from the second); all other summands...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Conj Aut Xpow eq neg

ArkLib.Lattices.CyclotomicModulus.conjAut_Xpow_eq_neg

Plain-language statement

σ_{-1}(X^e) = -X^{d-e} for 0 < e < d: the conjugate of a sub-d/2 monomial is minus the complementary monomial. The only nonzero coefficient of σ_{-1}(X^e) sits at d - e, with sign -1: from e·conjExp ≡ 2^{α+1} - e (mod 2^{α+1}) we get σ_{-1}(X^e) = X^{d + (d-e)} = -X^{d-e}.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Conj Fixed Subring is Field

ArkLib.Lattices.CyclotomicModulus.conjFixedSubring_isField

Plain-language statement

R_q^{σ_{-1}} is a field (blueprint Theorem, Phase 5). For q ≡ 5 (mod 8), every nonzero σ_{-1}-fixed element is a unit: if p₁ ∣ g then the reverse identity plus the swap p₁.reverse ~ p₂ force p₂ ∣ g too, so X^{2^α}+1 ∣ g and the element vanishes. Proven (modulo no_selfReciprocal_factor): transport to S = Z_q[X]/(X^{2^α}+1) via `Rq.equ...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Cyclotomic card normalized Factors

ArkLib.Lattices.CyclotomicModulus.cyclotomic_card_normalizedFactors

Plain-language statement

(Phase 2) Φ_{2^{α+1}} over Z_q has exactly two distinct monic irreducible factors, each of degree 2^{α-1} = d/2, for q ≡ 5 (mod 8). From Mathlib's normalizedFactors_cyclotomic_card (count = φ(2^{α+1}) / ord = 2^α / 2^{α-1} = 2) and natDegree_of_mem_normalizedFactors_cyclotomic (degree = ord = 2^{α-1}), using orderOf_q_eq.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Dvd cyclotomic factor

ArkLib.Lattices.CyclotomicModulus.dvd_cyclotomic_factor

Plain-language statement

X^(2^(α-1)) - C r divides X^(2^α)+1 when r^2 = -1 and α ≥ 1.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Emultiplicity four pow sub one

ArkLib.Lattices.CyclotomicModulus.emultiplicity_four_pow_sub_one

Plain-language statement

2-adic LTE for g = 4·2^κ + 1: v₂(gⁿ − 1) = (κ+2) + v₂(n).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record