Unnumbered p.9: systematic Toeplitz submodules satisfy Condition 1
ProvedQAlgorithms.Papers.Independent.Advance50.P23.systematic_toeplitz_condition1All classical alphabets are finite and nonempty and all quantum systems are finite dimensional. A cq channel has positive semidefinite outputs of trace one; every input law is nonnegative and sums to one. Logarithms are natural. Write for the paper's Petz information, for its Gallager information, for classical Rényi entropy, and for Holevo information. Matrix powers vanish on the kernel, including exponent zero. Write , , for the number of distinct eigenvalues of , and for that of . The supported spectral spread is and .
Over a finite field of size , let and sample independent uniform Toeplitz diagonal seeds for an matrix . In , set . Then
Thus this systematic ensemble satisfies Condition 1. Zero-height and zero-width matrices have their actual empty-entry law; no Condition 2 assertion is included.
This result supplies the corresponding finite-dimensional information or coding interface for the paper's security analysis.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P23
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P23
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal
open Filter
open QAlgorithms.Papers.Independent.Information100.P56
(IsLaw entropy average holevo uniform ProjectiveRep orbit productOutput)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (IsSupported relativeEntropy)
open QAlgorithms.Papers.Independent.Dependency50.P28 (pinch logNonnegativeExtended)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {X A Z B E : Type} [Fintype X] [Fintype A] [Fintype Z]
[Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- PDF p.9: the systematic Toeplitz image satisfies Condition 1. No assertion
about the printed invertible-top-block Condition 2 construction is made. -/
theorem systematic_toeplitz_condition1 {K : Type} [Field K] [Fintype K] (r l : ℕ) :
Condition1 (uniform : (Fin (r + l - 1) → K) → ℝ)
(systematicSubmodule (K := K) r l) ((Fintype.card K)^l) := by sorry
end QAlgorithms.Papers.Independent.Advance50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite field and all natural numbers , including zero, put , , and choose uniformly. Define the matrix
and its graph submodule
The uniform weights on are nonnegative and sum to , every has cardinality , and every nonzero satisfies
The subtractions in the seed length and matrix indices are natural-number subtractions truncated at zero. Empty coordinate sets and the unique empty seed are included when the corresponding lengths are zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.