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

1 topic

573 results

Clear filters
Project-declaredLean 4.32.0

With Query Log self log eq

OracleComp.withQueryLog_self_log_eq

Plain-language statement

Self-log fixed point. The two log layers produced by oa.withQueryLog.withQueryLog agree on every support point: simulating the logging oracle over oa.withQueryLog records exactly the queries that the inner withQueryLog already recorded, since withQueryLog does not add new queries to the underlying OracleComp.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Get Query Value? eq get At?

OracleSpec.QueryLog.getQueryValue?_eq_getAt?

Plain-language statement

Query-log lookup is the OracleSpec specialization of dependent lookup on PolyFun traces.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Unroll wrap

PFunctor.DynSystem.DynComputation.unroll_wrap

Plain-language statement

Fuelled unrolling commutes with interface transport along a lens: the unrolled query tree of the wrapped machine is the lens-translated unrolled tree. The syntactic (FreeM-level) content of interface wrapping, from which handler-level wrapping laws follow by FreeM.liftM naturality without touching machine states.

program verificationseparation logiccryptography

Source project: VCVio

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
Project-declaredLean 4.31.0

Degree X le degree X sub degree X

Polynomial.Bivariate.degreeX_le_degreeX_sub_degreeX

Project documentation

If a non-zero bivariate polynomial f divides a non-zero bivariate polynomial g, then all the coefficients of the quoetient are non-zero. -/ @[grind .] lemma coeff_ne_zero {f q : F[X][Y]} (hg : q * f ≠ 0) : q.coeff ≠ 0 := (ne_zero_iff_coeffs_ne_zero q).1 (quotient_nezero hg) /- If q * f ≠ 0, then the X-degree of q is bounded above by the differen...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Exists max index total Degree

Polynomial.Bivariate.exists_max_index_totalDegree

Plain-language statement

There exists a maximal Y-index achieving totalDegree. Above it, total-degree contributions are strictly smaller or the coefficient vanishes.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record