Oracle Reduction completeness
CheckClaim.oracleReduction_completeness
Plain-language statement
Perfect completeness of the pure pass-through CheckClaim oracle reduction. Because the verifier no longer checks P at runtime (it is a pure pass-through, with P living in oracleRelOut), completeness needs the explicit hypothesis hP that every relIn input already satisfies P. Under hP, the prover forwards ⟨stmt, oStmt⟩ unchanged and t...
Exact Lean statement
@[simp]
theorem oracleReduction_completeness
(hP : ∀ stmt oStmt, (⟨⟨stmt, oStmt⟩, ()⟩ : (Statement × ∀ i, OStatement i) × Unit) ∈ relIn →
P stmt oStmt) :
(oracleReduction oSpec Statement OStatement).perfectCompleteness init impl
relIn (oracleRelOut P relIn)Formal artifact
Lean source
@[simp]theorem oracleReduction_completeness (hP : ∀ stmt oStmt, (⟨⟨stmt, oStmt⟩, ()⟩ : (Statement × ∀ i, OStatement i) × Unit) ∈ relIn → P stmt oStmt) : (oracleReduction oSpec Statement OStatement).perfectCompleteness init impl relIn (oracleRelOut P relIn) := by simp only [OracleReduction.perfectCompleteness, Reduction.perfectCompleteness, Reduction.completeness, ENNReal.coe_zero, tsub_zero] intro ⟨stmt, oStmt⟩ witIn hIn -- Reduce the run to a deterministic `pure` of the (unchanged) input. have hrun : (oracleReduction oSpec Statement OStatement).toReduction.run ⟨stmt, oStmt⟩ witIn = (pure ((default, ((stmt, oStmt), ())), (stmt, oStmt)) : 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 ∈ _root_.support (StateT.run' (simulateQ _ (pure (some ((default, ((stmt, oStmt), ())), (stmt, oStmt))) : OracleComp _ _)) s) at hmem rw [simulateQ_pure] at hmem change none ∈ _root_.support (Prod.fst <$> (pure (some ((default, ((stmt, oStmt), ())), (stmt, oStmt))) : 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 ∈ _root_.support (StateT.run' (simulateQ _ (pure (some ((default, ((stmt, oStmt), ())), (stmt, oStmt))) : OracleComp _ _)) s) at hx rw [simulateQ_pure] at hx change some x ∈ _root_.support (Prod.fst <$> (pure (some ((default, ((stmt, oStmt), ())), (stmt, oStmt))) : StateT σ ProbComp _).run s) at hx rw [StateT.run_pure] at hx simp [map_pure, support_pure] at hx cases hx exact ⟨⟨hIn, hP stmt oStmt hIn⟩, rfl⟩- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/ProofSystem/Component/CheckClaim.lean:256-303
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
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...
Source project: ArkLib
Person-level attribution pending.
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.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.