Skip to main content

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 curated research declarations and 119,070 complete package declarations. Search 10,000 more complete Mathlib declarations.

All topics

Showing 1,351 to 1,356 of 2,569 results.

Project-declaredLean 4.33.0-rc1

I₃ eq

I₃_eq

Mathematical statement

A symmetry identity in the τ\tau-minimizer endgame. Let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2, and set U=X1+X2U=X_1+X_2, V=X1+X2V=X_1'+X_2, W=X1+X1W=X_1'+X_1, and S=X1+X2+X1+X2S=X_1+X_2+X_1'+X_2'. Then the conditional mutual informations agree: I[V:WS]=I[U:WS]I[V:W\mid S]=I[U:W\mid S].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Principal is maximal iff irred

Ideal.principal_is_maximal_iff_irred

Project documentation

A principal ideal is an ideal generated by a single element. -/ def principalIdeal {F : Type} [Semiring F] (f : F) : Ideal F := Ideal.span {f} /- A principal ideal in a polynomial ring is maximal if and only if its generator is an irreducble polynomial.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Partition Z eq

IdealGas.partitionZ_eq

Mathematical statement

The partition function Z for an ideal gas.

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Partition Z eq

IdealGas.PartitionZ_eq

Mathematical statement

The partition function Z for an ideal gas.

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Batch completeness

InductiveMerkleTree.batch_completeness

Project documentation

Batch completeness theorem for Merkle trees: building the tree honestly, generating the batch proof for any selector opening at least one leaf, and verifying it against the tree's root succeeds with probability 1 under the random oracle. The proof reduces to functional_batch_completeness through simulateQ, exactly as the single-index completeness...

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record