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

1 topic

423 results

Clear filters
Project-declaredLean 4.31.0

Multilinear Combine recursive form

multilinearCombine_recursive_form

Plain-language statement

[⊗_{i=0}^{ϑ-1}(1-r_i, r_i)] · [ - u₀ -; ...; - u_{2^ϑ-1} - ] - [⊗_{i=0}^{ϑ-2}(1-r_i, r_i)] · ([(1-r_{ϑ-1}) · U₀] + [r_{ϑ-1} · U₁])

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Degree Of aeval le

MvPolynomial.degreeOf_aeval_le

Plain-language statement

For a multilinear t (each variable has degreeOf ≤ 1), substituting t into a univariate Q : L[X] via Polynomial.aeval yields a multivariate polynomial whose degree in each variable is bounded by Q.natDegree. Used by the structured sumcheck to bound the degree of Q(witness) in the round polynomial H = P · Q(t).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Fix First Variables Of MQP degree Var LE

MvPolynomial.fixFirstVariablesOfMQP_degreeVarLE

Project documentation

The per-variable / prismalinear degree-survival lemma: if a polynomial respects a per-variable degree bound b : Fin ℓ → ℕ, then fixing the first v variables to scalars produces a polynomial whose surviving Fin (ℓ-v) variables respect b restricted to their original suffix indices. Needed for SWIRL-style sumchecks where the multiplier has degree `|D...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rename equiv mem restrict Degree Var

MvPolynomial.rename_equiv_mem_restrictDegreeVar

Plain-language statement

Renaming by an equivalence e : σ ≃ τ transports a per-variable degree bound b to the pulled-back bound b ∘ e.symm on the target.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Sum Alg Equiv mem restrict Degree Var

MvPolynomial.sumAlgEquiv_mem_restrictDegreeVar

Plain-language statement

Currying via sumAlgEquiv preserves the per-variable bound on the outer (S₁) coordinates restricted to Sum.inl.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

PMF map uniform Of Fintype of fiber const

PMF.map_uniformOfFintype_of_fiber_const

Plain-language statement

Pushforward of PMF.uniformOfFintype α under a map f : α → β whose fibers over the image all have the same cardinality k > 0 is the uniform distribution on the image of f. Useful when f is an affine-linear surjection: every fiber is a translate of the kernel and hence has constant cardinality. The proximity-gap proofs use this to bridge the coeff...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record