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

1 topic

573 results

Clear filters
Project-declaredLean 4.31.0

Rq l1Norm one

ArkLib.Lattices.CyclotomicModulus.Rq.l1Norm_one

Plain-language statement

The centered ℓ₁ norm of 1 : Rq Φ is 1 (when 1 ≤ deg φ): the trivial challenge c = 1 used by the honest committer is nonzero and ℓ₁-short.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rq l2Norm Sq le nat Degree mul l Infty Norm sq

ArkLib.Lattices.CyclotomicModulus.Rq.l2NormSq_le_natDegree_mul_lInftyNorm_sq

Plain-language statement

ℓ∞ → ℓ₂² bridge (ring element): ‖x‖₂² ≤ deg φ · ‖x‖∞² , each of the deg φ centered coefficients contributes at most ‖x‖∞².

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rq l2Norm Sq mul le

ArkLib.Lattices.CyclotomicModulus.Rq.l2NormSq_mul_le

Plain-language statement

Per-entry product norm bound (Micciancio/Young, cf. [Mic07, ineqs. (2.6)–(2.7)]). Over the negacyclic ring X^{2^α}+1, ‖d·w‖₂² ≤ ‖d‖₁²·‖w‖₂².

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rq l2Norm Sq sub le

ArkLib.Lattices.CyclotomicModulus.Rq.l2NormSq_sub_le

Plain-language statement

Per-element subtraction bound: ‖a - b‖₂² ≤ 2·(‖a‖₂² + ‖b‖₂²).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rq l Infty Norm sub le

ArkLib.Lattices.CyclotomicModulus.Rq.lInftyNorm_sub_le

Plain-language statement

Per-element ℓ∞ triangle inequality: ‖a - b‖∞ ≤ ‖a‖∞ + ‖b‖∞.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Scalar Vec Mul mul l2Norm Sq le

ArkLib.Lattices.CyclotomicModulus.scalarVecMul_mul_l2NormSq_le

Plain-language statement

Micciancio/Young product bound. Over the power-of-two cyclotomic modulus powTwoCyclotomic α (φ = X^{2^α}+1), scaling an already-c-scaled vector by a further ring element d of bounded centered ℓ₁ norm grows the squared ℓ₂ norm by at most κ² (the honest Young/Micciancio inequality ‖(c·d)·v‖₂² ≤ ‖d‖₁² · ‖c·v‖₂² over the negacyclic convolu...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record