Remark 2: fixed-law superposition and successive-decoding regions differ
ProvedQAlgorithms.Papers.Independent.Support50.P26.fixed_law_regions_differFor a fixed finite channel and auxiliary law as in Theorem 1, let be the nonnegative region given by (9)–(11), and let instead satisfy
There is a channel and one fixed law for which is a proper subset of . Explicitly, take independent fair bits , input , and the channel . For this law,
Consequently , while the successive-decoding corner belongs to both regions.
This explicit witness states the fixed-distribution noncoincidence assertion. It makes no claim that the unions over distributions differ.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P26
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P26
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact primitives from pinned accepted modules, under the independent-paper override.
-- No coding theorem or other paper's channel model is reused.
open QAlgorithms.Papers.Independent.Information100.P22 (Op quantumMI)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks)
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
variable {X B1 B2 W U V A B : Type}
variable [Fintype X] [Fintype B1] [Fintype B2] [Fintype W] [Fintype U] [Fintype V]
variable [Fintype A] [Fintype B]
variable [DecidableEq X] [DecidableEq B1] [DecidableEq B2] [DecidableEq W]
variable [DecidableEq U] [DecidableEq V] [DecidableEq A] [DecidableEq B]
/-- Remark 2, PDF pp.7–8: a fixed-law proper inclusion, explicit separating pair,
computed information values (1,1,1,0), and the common successive-decoding corner.
No inequality of the unions over auxiliary laws is asserted. -/
theorem fixed_law_regions_differ :
let C := separatingChannel
let p := separatingLaw
superPrivate C p = 1 ∧ quantumMI (superWB2 C p) = 1 ∧ superTotal C p = 1 ∧
quantumMI (superWB1 C p) = 0 ∧
SuccessiveRegion C p ⊂ SuperRegion C p ∧
((1 / 2, 1 / 2) : ℝ × ℝ) ∈ SuperRegion C p ∧
((1 / 2, 1 / 2) : ℝ × ℝ) ∉ SuccessiveRegion C p ∧
successiveCorner C p ∈ SuccessiveRegion C p ∩ SuperRegion C p := by sorry
end QAlgorithms.Papers.Independent.Support50.P26
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Take Boolean inputs , the broadcast output , and the law when and otherwise. Put , , , and . Write , with applied through continuous functional calculus, and . The theorem asserts
It also asserts that the region specified by , , , and is a proper subset of the region specified by , , , and ; that belongs to the latter and not the former; and that the defined corner belongs to both regions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.