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

Gadget Decompose zmod vec L2Norm Sq le

ArkLib.Lattices.Ajtai.gadgetDecompose_zmod_vecL2NormSq_le

Plain-language statement

ℓ₂² shortness of G⁻¹. The full gadget decomposition has centered squared-ℓ₂ norm at most (rows·digits)·(deg φ)·(b-1)².

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Entry fin Prod Fin Equiv

ArkLib.Lattices.Ajtai.gadgetEntry_finProdFinEquiv

Plain-language statement

The gadget entry at the flattened index finProdFinEquiv (i', e) is constRq (base^e) on the diagonal block and 0 elsewhere.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Mul apply

ArkLib.Lattices.Ajtai.gadgetMul_apply

Plain-language statement

The gadget product, evaluated at row i, is the base-weighted sum of the digits slots of block i.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Mul zmod coeff nat Abs le

ArkLib.Lattices.Ajtai.gadgetMul_zmod_coeff_natAbs_le

Plain-language statement

Core recomposition coefficient bound. Each centered coefficient of an entry of the gadget product G_{b,rows} ·ᵥ v is at most (∑_{u<digits} bᵘ) · γ whenever ‖v‖∞ ≤ γ. The wraparound of the ZMod q powers bᵘ is immaterial: the integer ∑ₑ bᵉ·valMinAbs(vₑ.coeff k) is an explicit representative of the output coefficient, and the centered represe...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Mul zmod vec L2Norm Sq le

ArkLib.Lattices.Ajtai.gadgetMul_zmod_vecL2NormSq_le

Plain-language statement

The J-recomposition ℓ₂² chain. From the range check ‖ẑ‖∞ ≤ γ (Eq. (20)'s ẑ ∈ S_b, symmetric model), the recomposed z = J·ẑ satisfies ‖z‖₂² ≤ zRecomposeL2SqBound γ b τ (deg φ) rows , no primitive ‖z‖₂² verifier check is needed.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Build Witness mem rel In

ArkLib.Lattices.Ajtai.InnerOuter.buildWitness_mem_relIn

Plain-language statement

The witness assembler is correct , the hmk input to the generic assembly coordinateWiseSpecialSound_of_mkWitness (SingleRound.lean), and the mathematical content of Hachi Lemma 8's three-case split: at every star-shaped family of relOut-accepting branches, buildWitness lands in relIn.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record