Appendix II: equality optimum is a one-sided optimum
ProvedQAlgorithms.Papers.Independent.Gap48.P46.section_value_one_sidedLet be a nonempty compact convex subset of a finite-dimensional real normed vector space, continuous and concave, and real linear. Write for the attained maxima of over , , and , respectively. For every ,
The choice of side may depend on , and both equalities may hold. The result identifies a one-sided constraint preserving each equality-section optimum.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF p.17, Appendix II: the one-sided choice is inside the quantifier over alpha. -/
theorem section_value_one_sided {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V]
[FiniteDimensional ℝ V] (S : Set V) (hS : S.Nonempty) (hcompact : IsCompact S)
(hconvex : Convex ℝ S) (F : V → ℝ) (hcontinuous : ContinuousOn F S)
(hconcave : ConcaveOn ℝ S F) (l : V →ₗ[ℝ] ℝ) :
∀ alpha ∈ sectionDomain S l (· = ·),
sectionValue S F l (· = ·) alpha = sectionValue S F l (· ≤ ·) alpha ∨
sectionValue S F l (· = ·) alpha = sectionValue S F l (· ≥ ·) alpha := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite-dimensional normed real vector space, let be nonempty, compact, and convex, let be continuous and concave on , and let be real linear. For every real for which is nonempty,
The disjunction is inclusive, and the choice of which equality holds may depend on . Zero-dimensional spaces and singleton sections are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.