All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257

Is Query Bound P lift Comp sub Spec

OracleComp.IsQueryBoundP.liftComp_subSpec

Plain-language statement

Predicate-targeted query bounds are preserved by lifting along a SubSpec when the target predicate agrees with the source predicate on lifted queries. No LawfulSubSpec assumption is needed: query bounds only inspect query indices, not the distribution of responses.

Exact Lean statement

theorem IsQueryBoundP.liftComp_subSpec
    [h : spec ⊂ₒ superSpec]
    {oa : OracleComp spec α}
    {p : spec.Domain → Prop} [DecidablePred p]
    {q : superSpec.Domain → Prop} [DecidablePred q]
    {n : ℕ}
    (hpq : ∀ t, p t ↔ q (h.onQuery t))
    (hoa : oa.IsQueryBoundP p n) :
    (liftComp oa superSpec).IsQueryBoundP q n

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem IsQueryBoundP.liftComp_subSpec    [h : spec ₒ superSpec]    {oa : OracleComp spec α}    {p : spec.Domain  Prop} [DecidablePred p]    {q : superSpec.Domain  Prop} [DecidablePred q]    {n : }    (hpq :  t, p t  q (h.onQuery t))    (hoa : oa.IsQueryBoundP p n) :    (liftComp oa superSpec).IsQueryBoundP q n := by  induction oa using OracleComp.inductionOn generalizing n with  | pure x => simp  | query_bind t mx ih =>      rw [isQueryBoundP_query_bind_iff] at hoa      rw [liftComp_bind, liftComp_query]      change IsQueryBoundP        ((liftM (spec.query t) : OracleComp superSpec (spec.Range t)) >>=          fun u => liftComp (mx u) superSpec) q n      rw [show          (liftM (spec.query t) : OracleComp superSpec (spec.Range t)) =            liftM (superSpec.query (h.onQuery t)) >>= fun u =>              pure (h.onResponse t u) by        change ((liftM (spec.query t) : OracleQuery superSpec (spec.Range t)) :            OracleComp superSpec (spec.Range t)) =          (liftM (superSpec.query (h.onQuery t)) >>= fun u =>            pure (h.onResponse t u))        rw [show            (liftM (spec.query t) : OracleQuery superSpec (spec.Range t)) =              h.onQuery t, h.onResponse t from h.liftM_eq_lift _]        rfl]      rw [bind_assoc, isQueryBoundP_query_bind_iff]      refine by simpa [ hpq t] using hoa.1, fun u => ?_      rw [pure_bind]      have hcont := ih (h.onResponse t u) (hoa.2 (h.onResponse t u))      by_cases hp : p t      · simpa [hp, (hpq t).1 hp] using hcont      · simpa [hp, mt (hpq t).2 hp] using hcont
Project
VCVio
License
Apache-2.0
Commit
2ceb2d825ee3
Source
VCVio/OracleComp/QueryTracking/SubSpec.lean:31-66

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.32.0

Expected Cost Nat eq sum tail probs of pathwise Cost At Most

AddWriterT.expectedCostNat_eq_sum_tail_probs_of_pathwiseCostAtMost

Plain-language statement

Finite tail-sum formula for natural-valued writer cost under a pathwise upper bound. If every execution path of oa incurs cost at most n, then the tail probabilities vanish above n, so the infinite tail sum truncates to Finset.range n.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

IND CPA advantage to Real le sum step signed Advantage Real abs

AsymmEncAlg.IND_CPA_advantage_toReal_le_sum_step_signedAdvantageReal_abs

Plain-language statement

Planned generic one-time-to-many-time lift: bounded multi-query IND-CPA advantage is at most the sum of the extracted one-time signed advantages over the first q fresh LR queries.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record