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

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

Four pow mod period

ArkLib.Lattices.CyclotomicModulus.four_pow_mod_period

Plain-language statement

The power gⁿ mod 2^{α+1} depends only on n mod 2^{α-κ-1} (period = order of g).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Two pow dvd four pow sub one iff

ArkLib.Lattices.CyclotomicModulus.two_pow_dvd_four_pow_sub_one_iff

Plain-language statement

Divisibility characterization: 2^{α+1} ∣ gⁿ − 1 ↔ 2^{α-κ-1} ∣ n for g = 4·2^κ+1, when κ + 1 ≤ α (so α - κ - 1 is the genuine order d/(2k)).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record