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

Sample advantage le module SIS

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.sample_advantage_le_moduleSIS

Plain-language statement

Pointwise weak-binding to Module-SIS bound for fixed samples (over 𝓜(q, α)).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Verified Opening of verify eq true

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.verifiedOpening_of_verify_eq_true

Plain-language statement

Extract reusable weak-opening facts from a successful verification (over 𝓜(q, α), where Lyubashevsky–Seiler invertibility applies).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Binding Advantage le module SIS of short Closure

ArkLib.Lattices.Ajtai.Simple.bindingAdvantage_le_moduleSIS_of_shortClosure

Plain-language statement

Binding reduces to Module-SIS for any commitment/Module-SIS shortness predicates closed under differences.

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

Card fixed Subring le

ArkLib.Lattices.CyclotomicModulus.card_fixedSubring_le

Plain-language statement

|R_q^H| ≤ q^k, from ψ : (R_q^H)^{d/k} ↪ R_q injective and |R_q| = q^{2^α}: |R_q^H|^{d/k} ≤ q^{2^α} = (q^k)^{d/k}.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

C Inf Norm psi le

ArkLib.Lattices.CyclotomicModulus.cInfNorm_psi_le

Plain-language statement

Hachi [NOZ26, §3, Lemma 6]: ‖ψ(a)‖∞ ≤ 2β. If every entry of the vector a : (R_q^H)^{d/k} has centered coefficient ℓ∞-norm at most β (i.e. ‖a‖∞ ≤ β in the mod± q convention of [NOZ26, §2.1]), then the packed ring element ψ(a) ∈ R_q satisfies ‖ψ(a)‖∞ ≤ 2β. The hypotheses are the standing assumptions of [NOZ26, §3]: k = 2^κ divides `d/2...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record