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

1 topic

2 results

Clear filters
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

Neg one not Mem powers q

ArkLib.Lattices.CyclotomicModulus.neg_one_notMem_powers_q

Plain-language statement

(Phase 1) −1 ∉ ⟨q⟩ in (Z/2^{α+1})ˣ, stated as: no power of q equals −1. For q ≡ 5 (mod 8), every power of q is ≡ 1 (mod 4) (since q ≡ 1 (mod 4)), while −1 ≡ 3 (mod 4) (as α ≥ 1, so 4 ∣ 2^{α+1}); projecting to ZMod 4 separates them. This is the precise sense in which q ≡ 5 (mod 8) forces σ_{-1} to swap the two CRT factors.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record