Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational expected oracle cost as phase occupancies

Proved
CountingLLL.ReciprocalTest.oracle_cost_expectation_eq_occupancy

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

formalizationprobability

For the operational ReciprocalTest program, the extended expected number of oracle calls is the sum, over all execution steps, of the probabilities that the program is in an oracle-query phase. This includes nonterminating executions, for which the defined oracle cost is infinite.

Preamble
import Definitions.Def_CountingLLL_ReciprocalEncodedLaw
open MeasureTheory CountingLLL.ReciprocalTest
open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.oracle_cost_expectation_eq_occupancy (B : ℝ≥0∞) :
    ∫⁻ ω, oracleCost ω ∂(entropyLaw B) = ∑' t, entropyLaw B {ω | ∃ k : Context, (run ω t).phase = .coinOracle k} := by sorry
Source
Liu, Wang, Yin, Zhang, Zhou, A Counting and Sampling Lovász Local Lemma, STOC submission #442, §6.2, Lemma 6.5. This is an operational occupancy identity used toward the expected oracle-call bound, not the bound itself.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me