All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Pure accepting of mem

Verifier.pure_accepting_of_mem

Plain-language statement

A deterministic verifier output that lies in a language is accepted with probability one.

Exact Lean statement

theorem pure_accepting_of_mem
    {n : ℕ} {pSpec : ProtocolSpec n} [∀ i, SampleableType (pSpec.Challenge i)]
    (V : Verifier oSpec Stmt₁ Stmt₂ pSpec)
    (stmt : Stmt₁) (tr : pSpec.FullTranscript)
    (lang : Set Stmt₂) (out : Stmt₂)
    (hV : V.verify stmt tr = pure out) (hout : out ∈ lang) :
      Pr[(· ∈ lang) |
        OptionT.mk do (simulateQ impl (V.run stmt tr)).run' (← init)] = 1

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem pure_accepting_of_mem    {n : } {pSpec : ProtocolSpec n} [ i, SampleableType (pSpec.Challenge i)]    (V : Verifier oSpec StmtStmt₂ pSpec)    (stmt : Stmt₁) (tr : pSpec.FullTranscript)    (lang : Set Stmt₂) (out : Stmt₂)    (hV : V.verify stmt tr = pure out) (hout : out  lang) :      Pr[(·  lang) |        OptionT.mk do (simulateQ impl (V.run stmt tr)).run' ( init)] = 1 := by  simp only [Verifier.run, hV]  rw [probEvent_eq_one_iff]  refine ?_, ?_  · rw [OptionT.probFailure_eq, OptionT.run_mk]    simp only [probFailure_eq_zero, zero_add]    apply probOutput_eq_zero_of_not_mem_support    simp only [support_bind, Set.mem_iUnion, not_exists]    intro s _    change none  support      (StateT.run' (simulateQ (r := StateT σ ProbComp) impl        (pure (some out) : OracleComp oSpec (Option Stmt₂))) s)  False    rw [simulateQ_pure]    change none  support      (Prod.fst <$> (pure (some out) : StateT σ ProbComp (Option Stmt₂)).run s)  False    rw [StateT.run_pure]    simp [map_pure]  · intro x hx    rw [OptionT.mem_support_iff] at hx    simp only [OptionT.run_mk, support_bind, Set.mem_iUnion] at hx    obtain s, _, hx := hx    change some x  support      (StateT.run' (simulateQ (r := StateT σ ProbComp) impl        (pure (some out) : OracleComp oSpec (Option Stmt₂))) s) at hx    rw [simulateQ_pure] at hx    change some x  support      (Prod.fst <$> (pure (some out) : StateT σ ProbComp (Option Stmt₂)).run s) at hx    rw [StateT.run_pure] at hx    simp only [map_pure, support_pure, Set.mem_singleton_iff, Option.some.injEq] at hx    subst x    exact hout
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/OracleReduction/Security/CoordinateWiseSpecialSoundness/Composition.lean:325-362

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.31.0

Affine gaps lifted to interleaved codes

affine_gaps_lifted_to_interleaved_codes

Project documentation

This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose coeff

ArkLib.Lattices.Ajtai.gadgetDecompose_coeff

Plain-language statement

The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record