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

1 topic

187 results

Clear filters
Project-declaredLean 4.32.0

Adiabatic relation log

adiabatic_relation_log

Plain-language statement

Adiabatic relation in logarithmic form: If S(Ua,Va,N) = S(Ub,Vb,N) with N fixed, then c * log (Ua/Ub) + log (Va/Vb) = 0.

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Adiabatic relation Ua Ub Va Vb

adiabatic_relation_UaUbVaVb

Plain-language statement

Adiabatic relation in product form: If S(Ua,Va,N) = S(Ub,Vb,N) with N fixed, then (Ua/Ub)^c * (Va/Vb) = 1.

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

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

Quotient Hom reduce

ArkLib.Lattices.CyclotomicModulus.quotientHom_reduce

Plain-language statement

Reduction modulo φ is invisible in the quotient: reduce p ≡ p (mod φ). This is the cyclotomic analogue of the NegacyclicRingSemantics soundness data.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record