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

1 topic

13 results

Clear filters
Project-declaredLean 4.32.0

Eπ classical Bound to numerical Bound

Eπ.classicalBound.to_numericalBound

Plain-language statement

Let Eπ(x)=π(x)Li(x)/(x/logx)E_\pi(x)=|\pi(x)-\operatorname{Li}(x)|/(x/\log x). If EπE_\pi obeys the classical bound Eπ(x)A(logxR)Bexp ⁣(ClogxR)E_\pi(x)\le A\left(\frac{\log x}{R}\right)^B\exp\!\left(-C\sqrt{\frac{\log x}{R}}\right) for every xx0x\ge x_0, with A,B,C,R>0A,B,C,R>0, then beyond any x1max{x0,exp(R(2B/C)2)}x_1\ge\max\{x_0,\exp(R(2B/C)^2)\} it obeys the uniform numerical bound obtained by evaluating that expression at x1x_1.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Eψ classical Bound to numerical Bound

Eψ.classicalBound.to_numericalBound

Plain-language statement

Let Eψ(x)=ψ(x)x/xE_\psi(x)=|\psi(x)-x|/x. If EψE_\psi obeys the classical bound Eψ(x)A(logxR)Bexp ⁣(ClogxR)E_\psi(x)\le A\left(\frac{\log x}{R}\right)^B\exp\!\left(-C\sqrt{\frac{\log x}{R}}\right) for every xx0x\ge x_0, with A,B,C,R>0A,B,C,R>0, then beyond any x1max{x0,exp(R(2B/C)2)}x_1\ge\max\{x_0,\exp(R(2B/C)^2)\} it obeys the uniform numerical bound obtained by evaluating that expression at x1x_1.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Simulate Q build Merkle Tree

InductiveMerkleTree.simulateQ_buildMerkleTree

Plain-language statement

Running the monadic version of buildMerkleTree with an oracle function f is equivalent to running the functional version of buildMerkleTreeWithHash with the same oracle function.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Simulate Q get Putative Batch Root

InductiveMerkleTree.simulateQ_getPutativeBatchRoot

Plain-language statement

Running the monadic getPutativeBatchRoot with an oracle function f is the same as running the functional getPutativeBatchRootWithHash with the corresponding hash function.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

D Lp Norm pow

MeasureTheory.dLpNorm_pow

Plain-language statement

For nonzero natural exponents pp and qq, taking a pointwise qq-th power rescales the discrete normalized norm by fqp=fpqq\|f^q\|_p=\|f\|_{pq}^{q}.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Neg weight implies neg value

QuadraticForm.neg_weight_implies_neg_value

Plain-language statement

When a quadratic form is equivalent to a weighted sum of squares, negative weights correspond to vectors where the form takes negative values. This is a concrete realization of a 1-dimensional negative definite subspace, contributing to O'Neill's index ν (Definition 18, p. 47).

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record