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

1 topic

3 results

Clear filters
Project-declaredLean 4.31.0

Eq or eq of mod eq

ArkLib.Lattices.CyclotomicModulus.eq_or_eq_of_mod_eq

Plain-language statement

At most two packed indices share a residue class mod d/2k. Given a residue r with j ≡ r (mod d/2k = 2^{α-κ-1}), the index j : Fin (d/2^κ) is either the first-half witness (value r) or the second-half witness (value d/2k + r). Combined with packExp_mod_eq, this pins down exactly which (at most two) packed summands can contribute to a give...

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

Pack Exp mod eq

ArkLib.Lattices.CyclotomicModulus.packExp_mod_eq

Plain-language statement

Alignment of the second half after the X^{d/2} shift: packExp α (2^κ) j is congruent to j modulo d/2k = 2^{α-κ-1}, on both halves of the index range. On the first half this is rfl (no shift); on the second half the shift 2^{α-1} = 2^κ·2^{α-κ-1} is a multiple of 2^{α-κ-1}, so it vanishes mod 2^{α-κ-1}. This is what lets a single output...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record