Reduction all Verdicts eq map all Outputs fst
Reduction.allVerdicts_eq_map_allOutputs_fst
Plain-language statement
allVerdicts has the same distribution as allOutputs with a projection retaining the verifier output as the first component; it differs only by a pure post-map.
Exact Lean statement
lemma Reduction.allVerdicts_eq_map_allOutputs_fst {L : ℕ} {β : Type}
(extract : ((FullTranscript pSpec × StmtOut × WitOut) × StmtOut) → β)
(stmts : Fin L → StmtIn) (wits : Fin L → WitIn)
(reduction : Reduction oSpec StmtIn WitIn StmtOut WitOut pSpec) :
reduction.allVerdicts stmts wits =
(Option.map (fun resultOf => fun i => (resultOf i).1)) <$>
reduction.allOutputs (fun result => (result.2, extract result)) stmts witsFormal artifact
Lean source
lemma Reduction.allVerdicts_eq_map_allOutputs_fst {L : ℕ} {β : Type} (extract : ((FullTranscript pSpec × StmtOut × WitOut) × StmtOut) → β) (stmts : Fin L → StmtIn) (wits : Fin L → WitIn) (reduction : Reduction oSpec StmtIn WitIn StmtOut WitOut pSpec) : reduction.allVerdicts stmts wits = (Option.map (fun resultOf => fun i => (resultOf i).1)) <$> reduction.allOutputs (fun result => (result.2, extract result)) stmts wits := by unfold Reduction.allVerdicts Reduction.allOutputs Reduction.allRuns simp only [map_eq_bind_pure_comp, bind_assoc, pure_bind, Function.comp_apply] rw [Vector.mapM_bind_map_eq (v := Vector.ofFn (id : Fin L → Fin L)) (f₁ := fun i => (reduction.verdict (stmts i) (wits i)).run) (f₂ := fun i => (reduction.run (stmts i) (wits i)).run) (g := Option.map (fun result : (FullTranscript pSpec × StmtOut × WitOut) × StmtOut => result.2)) (post₁ := fun results => pure ((results.mapM id).map fun v => fun i => v[i])) (post₂ := fun results => pure (Option.map (fun resultOf => fun i => (resultOf i).1) (Option.map (fun resultOf => fun i => ((resultOf i).2, extract (resultOf i))) (Option.map (fun v => fun i => v[i]) (results.mapM id)))))] · intro i exact Reduction.verdict_run_eq_map_run reduction (stmts i) (wits i) · intro results congr 1 rw [Vector.mapM_id_option_map_comm] cases h : results.mapM id with | none => simp | some v => simp only [Option.map_some, Option.some.injEq] funext i simp- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/OracleReduction/Execution.lean:279-310
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.