IV-source-region-properties: Applicable source regions are closed, convex, upward closed; Rq,Fe⊆Rq,Fbar⊆Ra,Fbar; Rq,Fbar=Rq,Dbar and Ra,Fbar=Ra,Dbar.
OpenQAlgorithms.Papers.Independent.Renew46.P43.multipleSourceRegionPropertiesFor a finite pure-letter iid multiple source, use actual separate CPTP quantum encoders and a joint CPTP decoder, with all component rates converging and the chosen error vanishing. Every defined rate region is closed, convex and upward closed. The Fe region is asserted only for fully quantum systems; the arbitrary-encoder regions and corresponding inclusions are asserted only for product-letter ensembles, whose joint law may still be correlated.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Unnumbered source-region properties, PDF p.46. The arbitrary part is restricted
to product-letter ensembles and Fe to full matrix systems. All equivalences/inclusions
in the printed diagram are retained. -/
theorem multipleSourceRegionProperties {s : ℕ} {L : Type*} [Fintype L]
(S : MultipleData s L) (hS : S.Valid) :
SourceRegionProperties (quantumSourceRegion S) ∧
SourceRegionProperties (quantumSourceRegion S true) ∧
quantumSourceRegion S = quantumSourceRegion S true ∧
(∀ hfull : ∀ i a b, (S.system i).block a = (S.system i).block b,
SourceRegionProperties (entanglementSourceRegion S hfull) ∧
entanglementSourceRegion S hfull ⊆ quantumSourceRegion S) ∧
(∀ P : ProductData s, P.Valid →
SourceRegionProperties (arbitrarySourceRegion P) ∧
SourceRegionProperties (arbitrarySourceRegion P true) ∧
arbitrarySourceRegion P = arbitrarySourceRegion P true ∧
quantumSourceRegion P.multiple ⊆ arbitrarySourceRegion P) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any natural number and any type equipped with a finite enumeration. For each party , let be a dimension and a block label function. Let consist of these systems, a probability mass function on , and complex matrices indexed by . Assume that every , including those with , has the form for some unit vector , that is injective, and that whenever for at least one party . The following definitions specify the regions in the conclusion. A density matrix is positive semidefinite with trace , and a channel here is a map having a finite Kraus representation with . Write , where is applied by continuous functional calculus, and write
For a word , set and define its matrix on the party registers by . A quantum code of length chooses positive integers , a channel from party ’s input registers to a dimensional register, and a channel from the combined compressed registers back to all party input registers. For every positive semidefinite compressed input , the decoder must satisfy if for some . Its combined map is , where the tensor product of maps is defined on matrix units by
Its party rates, average fidelity, and average distortion are respectively
Define to contain exactly the vectors for which there is a code at every positive integer length , with for every and as ; define by replacing the last convergence with . If all labels within each party’s system are equal, define using the same sequences of codes and rate limits, but require
where and ; the extension applies separately to each matrix block selected by the two reference indices. For any region , let the stated region property mean that is closed, convex over , and contains every vector coordinatewise above any of its elements. The theorem asserts that and both have this property and are equal; moreover, for every choice of the hypothesis that all labels within each party are equal, has this property and . It further asserts the following for every product source with parties: each party has a positive dimensional system with block labels, a positive finite alphabet, and an injective family of unit-vector density matrices whose entries vanish between different blocks, while the joint alphabet has an arbitrary probability mass function , with no independence assumption. Its joint letter is . An arbitrary encoder code for this source chooses, for each party and each local word , a density matrix on a positive dimensional register, and uses a decoder channel satisfying the same output block condition as above; its output on a joint word is . Define and by sequences of these codes at every positive length, rates , and respectively average fidelity tending to or average trace distance tending to , averaging joint words with weight against the target matrices . Then both arbitrary encoder regions are closed, convex, and upward closed, they are equal, and , where uses the joint letters just described and channel encoders. The quantification includes ; all code lengths used in these regions are positive, and the given probability mass function on excludes an empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.