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

1 topic

423 results

Clear filters
Project-declaredLean 4.31.0

Trace H Xpow eq zero

ArkLib.Lattices.CyclotomicModulus.traceH_Xpow_eq_zero

Plain-language statement

(Claim 2) Tr_H(X^i) = 0 whenever d/2k ∤ i. Splitting H = ⟨σ_{-1}, σ_{4k+1}⟩ into the ⟨4k+1⟩-orbit {p_a} and its conjugate {q_a = -p_a}, the orbit sum is X^i·∑_{j}(X^{4ki})^j (four_pow_i_reindex), which vanishes (four_pow_i_geom_zero); the conjugate sum is its image under σ_{-1}, hence also 0.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Trace H Xpow neg one sq

ArkLib.Lattices.CyclotomicModulus.traceH_Xpow_neg_one_sq

Plain-language statement

Generalized Claim 3: Tr_H(X^j) = 0 for any j with X^{2j} = -1 (equivalently 2j ≡ d mod 2d, i.e. j an odd multiple of d/2). Proven by a fixed-point-free involution on H: conjugation m ↦ -m sends X^{j·m} to its negation, since (X^{j·m})² = (X^{2j})^m = (-1)^m = -1 (m odd) and conjugation inverts a square-root of -1.

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

Unit pow eq one iff

ArkLib.Lattices.CyclotomicModulus.unit_pow_eq_one_iff

Plain-language statement

Bridge: u^m = 1 in the unit group iff 2^(α+1) ∣ q^m - 1.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Val Min Abs nat Abs le

ArkLib.Lattices.CyclotomicModulus.valMinAbs_natAbs_le

Plain-language statement

The centered representative valMinAbs has the least absolute value among all integer representatives of a residue class.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Vec L2Norm Sq le card mul l Infty Norm sq

ArkLib.Lattices.CyclotomicModulus.vecL2NormSq_le_card_mul_lInftyNorm_sq

Plain-language statement

ℓ∞ → ℓ₂² bridge (vector): ‖v‖₂² ≤ cols · (deg φ · ‖v‖∞²).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record