All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Oracle Reduction completeness

ReduceClaim.oracleReduction_completeness

Plain-language statement

The ReduceClaim oracle reduction satisfies perfect completeness for any relation. Proof strategy mirrors the non-oracle reduction_completeness: the prover deterministically returns the mapped output, the verifier deterministically computes mapStmt, and the positive-probability output is exactly the mapped element which lies in relOut by hRel.

Exact Lean statement

@[simp]
theorem oracleReduction_completeness --(h : init.neverFails)
    (hRel : ∀ stmtIn oStmtIn witIn,
      ((stmtIn, oStmtIn), witIn) ∈ relIn →
      ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn) ∈ relOut) :
    (oracleReduction oSpec mapStmt mapWit embedIdx hEq).perfectCompleteness init impl
      relIn relOut

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
@[simp]theorem oracleReduction_completeness --(h : init.neverFails)    (hRel :  stmtIn oStmtIn witIn,      ((stmtIn, oStmtIn), witIn)  relIn       ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn)  relOut) :    (oracleReduction oSpec mapStmt mapWit embedIdx hEq).perfectCompleteness init impl      relIn relOut := by  simp only [OracleReduction.perfectCompleteness, Reduction.perfectCompleteness,    Reduction.completeness, ENNReal.coe_zero, tsub_zero]  intro stmtIn, oStmtIn witIn hIn  -- Reduce the run to a deterministic `pure` of the expected output.  have hrun : (oracleReduction oSpec mapStmt mapWit embedIdx hEq).toReduction.run      stmtIn, oStmtIn witIn =      (pure ((default,          ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn)),          (mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn)) :        OptionT (OracleComp _) _) := by    simp only [oracleReduction, OracleReduction.toReduction, Reduction.run, oracleProver,      oracleVerifier, OracleVerifier.toVerifier, Prover.run, Verifier.run, Prover.runToRound]    rfl  rw [hrun]  rw [ge_iff_le, one_le_probEvent_iff, 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 _ hmem    change none  support      (StateT.run' (simulateQ _ (pure (some ((default,        ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn)),        (mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn))) : OracleComp _ _)) s) at hmem    rw [simulateQ_pure] at hmem    change none  support      (Prod.fst <$> (pure (some ((default,        ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn)),        (mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn))) :          StateT σ ProbComp _).run s) at hmem    rw [StateT.run_pure] at hmem    simp [map_pure] at hmem  · 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 _ (pure (some ((default,        ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn)),        (mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn))) : OracleComp _ _)) s) at hx    rw [simulateQ_pure] at hx    change some x  support      (Prod.fst <$> (pure (some ((default,        ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), mapWit stmtIn witIn)),        (mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn))) :          StateT σ ProbComp _).run s) at hx    rw [StateT.run_pure] at hx    simp [map_pure, support_pure] at hx    cases hx    exact hRel stmtIn oStmtIn witIn hIn, rfl
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/ProofSystem/Component/ReduceClaim.lean:250-307

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