All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257

Fst map run simulate Q

enforceOracle.fst_map_run_simulateQ

Plain-language statement

When the computation is within its query bound, enforcement is transparent: the output distribution is identical to running without enforcement.

Exact Lean statement

theorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}
    (h : IsPerIndexQueryBound oa qb) :
    Prod.fst <$> (simulateQ enforceOracle oa).run qb = oa

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι  }    (h : IsPerIndexQueryBound oa qb) :    Prod.fst <$> (simulateQ enforceOracle oa).run qb = oa := by  induction oa using OracleComp.inductionOn generalizing qb with  | pure _ => simp  | query_bind t mx ih =>    rw [isPerIndexQueryBound_query_bind_iff] at h    obtain hpos, hcont := h    simp only [simulateQ_query_bind]    change Prod.fst <$> ((spec.enforceOracle t).run qb >>=      fun p => (simulateQ enforceOracle (mx p.1)).run p.2) = liftM (query t) >>= mx    rw [run_apply, if_pos hpos]    simp only [monad_norm, Function.comp]    exact bind_congr fun u => by      simpa only [map_eq_bind_pure_comp] using ih u (hcont u)
Project
VCVio
License
Apache-2.0
Commit
2ceb2d825ee3
Source
VCVio/OracleComp/QueryTracking/Enforcement.lean:58-72

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