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

Mk reverse eq galois Autₛ mul

ArkLib.Lattices.CyclotomicModulus.mk_reverse_eq_galoisAutₛ_mul

Plain-language statement

The reverse identity. In S = Z_q[X]/(X^{2^α}+1), the conjugation σ_{-1} (here the semantic automorphism galoisAutₛ of exponent conjExp = 2^{α+1}-1) and the polynomial reversal are related by mk(reverse p) = σ_{-1}(mk p) · (mk X)^{deg p}. This is the concrete handle behind "σ_{-1} swaps the two factors": since (mk X)^{deg p} is a unit, `σ...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Mk X pow conductor eq one

ArkLib.Lattices.CyclotomicModulus.mk_X_pow_conductor_eq_one

Plain-language statement

(C-1) X^{2^{α+1}} ≡ 1 in the quotient, since X^{2d} - 1 = (X^d - 1)(X^d + 1).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Mul conj Exp mod

ArkLib.Lattices.CyclotomicModulus.mul_conjExp_mod

Plain-language statement

The conjugate σ_{-1}(X^e) lands at position d - e (mod d), for 0 < e < d.

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

Order Of q mod two pow

ArkLib.Lattices.CyclotomicModulus.orderOf_q_mod_two_pow

Plain-language statement

The multiplicative order of q modulo 2^(α+1) is 2^(α-1), phrased to match ZMod.irreducible_of_dvd_cyclotomic_of_natDegree (K = ZMod q, n = 2^(α+1)).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Pack Exp lt

ArkLib.Lattices.CyclotomicModulus.packExp_lt

Plain-language statement

Packing exponents stay in range: for 2·2^κ ∣ 2^α, every packed exponent packExp α (2^κ) j lands below the ring dimension d = 2^α, for j ranging over the packed index set Fin (d/2^κ).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record