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

1 topic

6 results

Clear filters
Project-declaredLean 4.31.0

Gadget Decompose coeff

ArkLib.Lattices.Ajtai.gadgetDecompose_coeff

Plain-language statement

The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose zmod l2Norm Sq le

ArkLib.Lattices.Ajtai.gadgetDecompose_zmod_l2NormSq_le

Plain-language statement

Each gadget-decomposition block is ℓ₂²-short: its centered squared-ℓ₂ norm is at most (deg φ)·(b-1)² (each of the deg φ coefficients contributes at most (b-1)²).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
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 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

Zmod Digit nat Abs le

ArkLib.Lattices.Ajtai.zmodDigit_natAbs_le

Plain-language statement

Core digit bound. Each base-b digit of zmodDigitDecomposition, viewed as a centered residue, has absolute value at most b - 1 , provided b - 1 ≤ q/2, so the digit (a natural number < b) does not wrap to a negative centered representative.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record