All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Reduction completeness

CheckClaim.reduction_completeness

Plain-language statement

The CheckClaim reduction satisfies perfect completeness with respect to the predicate as the input relation, and the output relation being always true.

Exact Lean statement

@[simp]
theorem reduction_completeness [Nonempty σ] [DecidableEq Statement] :
    (reduction oSpec Statement pred).perfectCompleteness init impl
    (relIn Statement pred) (relOut Statement)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
@[simp]theorem reduction_completeness [Nonempty σ] [DecidableEq Statement] :    (reduction oSpec Statement pred).perfectCompleteness init impl    (relIn Statement pred) (relOut Statement) := by  simp only [Reduction.perfectCompleteness, Reduction.completeness, ENNReal.coe_zero, tsub_zero]  intro stmt () valid  simp only [relIn, Set.mem_setOf_eq] at valid  -- valid : pred stmt  -- First simplify the reduction run  have hrun : (reduction oSpec Statement pred).run stmt () =      (pure ((default, stmt, ()), stmt) :        OptionT (OracleComp _) _) := by    simp [reduction, Reduction.run, prover, verifier, Prover.run, Verifier.run,          Prover.runToRound, guard, if_pos valid]; rfl  simp only [hrun]  -- Now identical to id_perfectCompleteness pattern  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    -- Unfold OptionT.run on pure, then simulateQ_pure, then StateT    change none  _root_.support      (StateT.run' (simulateQ _ (pure (some ((default, stmt, ()), stmt)) :        OracleComp _ _)) s) at hmem    rw [simulateQ_pure] at hmem    change none  _root_.support      (Prod.fst <$> (pure (some ((default, stmt, ()), stmt)) :        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, ()), stmt)) :        OracleComp _ _)) s) at hx    rw [simulateQ_pure] at hx    change some x  _root_.support      (Prod.fst <$> (pure (some ((default, stmt, ()), stmt)) :        StateT σ ProbComp _).run s) at hx    rw [StateT.run_pure] at hx    simp [map_pure, support_pure] at hx    cases hx    simp [relOut]
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/ProofSystem/Component/CheckClaim.lean:86-133

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