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

All topics

Showing 523 to 528 of 2,569 results.

Project-declaredLean 4.31.0

Compile well typed on wf expr

compile_well_typed_on_wf_expr

Mathematical statement

Compiling a well-typed expression should produce a term of the corresponding TermType, assuming that the expression is well-formed in the symbolic environment.

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.8.0

Completeness p

completeness_p

Mathematical statement

Completeness for any valid parameters

probabilitycomplexity theoryinteractive protocols

Source project: debate

Person-level attribution pending.

View proof record
Project-declaredLean 4.8.0

Completeness

completeness'

Mathematical statement

Alice wins the debate with good probability

probabilitycomplexity theoryinteractive protocols

Source project: debate

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Complex nhds has Basis square

Complex.nhds_hasBasis_square

Mathematical statement

At every point pCp\in\mathbb C, the axis-parallel closed squares centered at pp with positive half-width form a neighborhood basis. Equivalently, a set is a neighborhood of pp exactly when it contains one of these sufficiently small squares.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

To Poly div By Monic

CompPoly.CPolynomial.toPoly_divByMonic

Project documentation

Construct a canonical polynomial from a coefficient function Fin n → R. The coefficients are stored in an array (index i gives the coefficient of X^i) and then trimmed to remove trailing zeros. -/ def ofFn [Zero R] [BEq R] [LawfulBEq R] {n : ℕ} (f : Fin n → R) : CPolynomial R := ⟨(Raw.mk (Array.ofFn f)).trim, Raw.Trim.isCanonical_trim _⟩ section Div...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record