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

1 topic

2 results

Clear filters
Project-declaredLean 4.32.0

Expected Cost le of support bound

expectedCost_le_of_support_bound

Plain-language statement

If val z.2 ≤ c for all z in the support of costDist, then expectedCost ≤ c. This is the key bridge from worst-case (support) bounds to expected bounds.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Is Per Index Query Bound to Worst Case Cost Bound unit sum

IsPerIndexQueryBound.toWorstCaseCostBound_unit_sum

Plain-language statement

If main makes at most qb i queries to each oracle i, then its total query count (under the unit cost model) is at most ∑ i, qb i on every execution path.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record