All proofs
Project-declaredLean 4.28.0 · mathlib@8f9d9cff6bd7

Pos of lt one

OptimalHypothesisRate.pos_of_lt_one

Plain-language statement

When the allowed Type I error ε is less than 1 (so, we have some limit on our errors), and the kernel of the state ρ contains the kernel of some element in S, then the optimal hypothesis rate is positive - there is some lower bound on the type II errors we'll see. In other words, under these conditions, we cannot completely avoid type II errors.

Exact Lean statement

theorem pos_of_lt_one {ρ : MState d} (S : Set (MState d))
  (hρ : ∃ σ ∈ S, σ.M.ker ≤ ρ.M.ker)
  {ε : Prob} (hε : ε < 1) : 0 < β_ ε(ρ‖S)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem pos_of_lt_one {ρ : MState d} (S : Set (MState d))  (hρ :  σ  S, σ.M.ker  ρ.M.ker)  {ε : Prob} (hε : ε < 1) : 0 < β_ ε(ρ‖S) := by  obtain σ, hσ₁, hσ₂ :=  --Assume the converse: that the infimum is zero. The set of such T's is inhabited  --and closed, so there is some T that attains the value zero. This T has zero  --inner product with σ (`σ.exp_val T = 0`), and yet (by definition of T's type) we  --also have that `ρ.exp_val (1 - T) ≤ ε < 1`. So `T` lives entirely in σ's kernel,  --which (by `h_supp`) is contained in ρ's kernel. So  --`ρ.exp_val (1 - T) = ρ.exp_val 1 - ρ.exp_val T = ρ.trace - 0 = 1`, a contradiction.  by_contra h  obtain ⟨⟨T, hT₁, hT₂, hT₃, hT₄, hT₅ := exists_min ρ ε S  rw [ bot_eq_zero'', not_bot_lt_iff] at h  rw [h, iSup_eq_bot, bot_eq_zero''] at hT₄  specialize hT₄ σ  simp only [iSup_pos hσ₁, Subtype.ext_iff, Set.Icc.coe_zero, MState.exp_val] at hT₄  rw [HermitianMat.inner_zero_iff σ.nonneg hT₂] at hT₄  replace hT₁ : ρ.exp_val (1 - T)  1 := (lt_of_le_of_lt hT₁ hε).ne  absurd hT₁  rw [ρ.exp_val_eq_one_iff ?_, sub_sub_cancel]  · grw [ hT₄]    rwa [HermitianMat.ker, HermitianMat.ker, ContinuousLinearMap.ker_le_ker_iff_range_le_range] at hσ₂    · simp    · simp  · exact sub_le_self 1 hT₂
Project
quantumInfo
License
MIT
Commit
56e83a9288a3
Source
QuantumInfo/Finite/ResourceTheory/HypothesisTesting.lean:225-249

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.28.0

Conj Transpose isometry mul isometry le one

conjTranspose_isometry_mul_isometry_le_one

Project documentation

The operator norm of the conjugate transpose is equal to the operator norm. -/ theorem Matrix.opNorm_conjTranspose_eq_opNorm {m n : Type*} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] (A : Matrix m n 𝕜) : Matrix.opNorm Aᴴ = Matrix.opNorm A := by unfold Matrix.opNorm rw [← ContinuousLinearMap.adjoint.norm_map (toEuclideanLin A).toContinuousLine...

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Convex roof of pure

convex_roof_of_pure

Plain-language statement

The convex roof extension of g : KetUpToPhase d → ℝ≥0 applied to a pure state ψ is g (KetUpToPhase.mk ψ).

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Id achieves Rate log dim

CPTPMap.id_achievesRate_log_dim

Plain-language statement

The identity channel on D dimensional space achieves a rate of log2(D).

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record