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

Xpow mul coeff

ArkLib.Lattices.CyclotomicModulus.Xpow_mul_coeff

Plain-language statement

Coefficient of an X^e-shift of a reduced element. For e < d, p < d and any x : R_q, the p-th coefficient of x·X^e is the (p-e)-th coefficient of x (no wrap, e ≤ p), or minus the (p+d-e)-th coefficient (one wrap past X^d = -1, p < e). This is the only place the proof needs the ring's multiplication; everything downstream is coef...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Xpow mul conj Exp

ArkLib.Lattices.CyclotomicModulus.Xpow_mul_conjExp

Plain-language statement

Conjugation negates a square-root-of--1 monomial: if X^{2j} = -1 then σ_{-1}(X^j) = X^{j·conjExp} = -X^j. The exponent j·conjExp ≡ -j, so X^{j·conjExp} is the inverse of X^j; and X^j·(-X^j) = -(X^j)² = -X^{2j} = 1, so the inverse is -X^j.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Xpow nat Degree

ArkLib.Lattices.CyclotomicModulus.Xpow_natDegree

Plain-language statement

The key relation X^{2^α} = -1 (X^d = -1), proven via the quotient: X^d + 1 is the modulus, so it vanishes in the quotient.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Xpow sub one is Unit

ArkLib.Lattices.CyclotomicModulus.Xpow_sub_one_isUnit

Plain-language statement

X^c - 1 is a unit whenever some X^{c·2^t} = -1. Then (∑_{j<2^t} (X^c)^j)·(X^c - 1) = (X^c)^{2^t} - 1 = -2, a unit (isUnit_two), so X^c - 1 is a unit. This is the crux of the trace-of-monomial vanishing (Hachi [NOZ26, §3, Claim 2]): it makes the geometric sum collapse without a domain.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Eval Split eq eval

ArkLib.Lattices.Hachi.evalSplit_eq_eval

Plain-language statement

The split. Evaluating a multilinear polynomial equals the vector–matrix–vector product of its reshaped coefficient matrix with the monomial bases of the low and high evaluation points (Hachi [NOZ26, §4]).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Eval Split Eval eq eval

ArkLib.Lattices.Hachi.evalSplitEval_eq_eval

Plain-language statement

The split (Lagrange representation). Evaluating a multilinear polynomial given by its hypercube values equals the vector–matrix–vector product of its reshaped value matrix with the Lagrange bases of the low and high evaluation points.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record