Additive classical-failure probability
ProvedQAlgorithms.Papers.Independent.Intakenext100.P77.additive_classical_failureConsider a normalized finite probability experiment with a classical failure event and bad-security events for the ideal and faulty classical executions. Assume and agree outside . If and , then
This is the event comparison meant by adding classical transmission failure to the security failure probability. It introduces neither an unauthenticated-channel claim nor a composable replacement theorem.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P77
open scoped BigOperators ComplexConjugate ComplexOrder
open QAlgorithms
-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)
open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Appendix A, PDF p.12, and Appendix O, p.31: classical failure adds its
probability to P_luck. This is a common-experiment event comparison, with
agreement outside failure, rather than a composable protocol replacement. -/
theorem additive_classical_failure {Omega : Type} [Fintype Omega]
(p : Law Omega) (badIdeal badActual failed : Omega → Prop)
(hagrees : ∀ w, ¬ failed w → (badActual w ↔ badIdeal w))
(luck failure : ℝ)
(hluck : (∑ w, if badIdeal w then p.prob w else 0) ≤ luck)
(hfailure : (∑ w, if failed w then p.prob w else 0) ≤ failure) :
(∑ w, if badActual w then p.prob w else 0) ≤ luck + failure := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any finite type, and let satisfy for every and . Let be any three predicates on . Suppose that for every for which is false, holds if and only if holds. For any real numbers and satisfying
the conclusion is
The predicates may define empty events, and no restriction is imposed on or at points where holds. The normalization of rules out an empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.