All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257

Transcript count Q le of is Per Index Query Bound

OracleComp.transcript_countQ_le_of_isPerIndexQueryBound

Plain-language statement

Per-index query bound. If oa respects a per-index budget qb, then for every oracle index t the transcript contains at most qb t queries to t.

Exact Lean statement

theorem transcript_countQ_le_of_isPerIndexQueryBound (h : OracleHandler spec) [DecidableEq ι]
    (t : ι) :
    ∀ {oa : OracleComp spec α} {qb : ι → ℕ}, IsPerIndexQueryBound oa qb →
      (transcript h oa).countQ (· = t) ≤ qb t

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem transcript_countQ_le_of_isPerIndexQueryBound (h : OracleHandler spec) [DecidableEq ι]    (t : ι) :     {oa : OracleComp spec α} {qb : ι  }, IsPerIndexQueryBound oa qb       (transcript h oa).countQ (· = t)  qb t := by  intro oa  induction oa with  | pure x => intro qb _; exact Nat.zero_le (qb t)  | queryBind t' k ih =>      intro qb hb      obtain hpos, hrest := hb      have hle := ih (h t') (hrest (h t'))      simp only [] at hpos hle      rw [transcript_countQ_queryBind]      rcases eq_or_ne t' t with rfl | htt      · rw [Function.update_self] at hle        split_ifs <;> omega      · rw [Function.update_of_ne htt.symm] at hle        simp only [if_neg htt]; omega
Project
VCVio
License
Apache-2.0
Commit
2ceb2d825ee3
Source
VCVio/OracleComp/Coinductive/DynSystem.lean:627-644

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