Proposition 3 (A–B): approximation of concave functions
OpenQAlgorithms.Papers.Independent.Support50.P34.proposition3_concaveApproximationLet be concave, lower semicontinuous, and lower bounded. A state symmetry means an affine homeomorphism preserving rank strata. For every , the countable and integral rank roofs agree, are concave and lower semicontinuous, inherit every such symmetry of , and agree with on . Moreover,
If has a finite continuous restriction to every , all these roofs are finite continuous bounded functions. This is the symmetry-preserving approximation theorem; invariance under all unitaries is not imposed as an extra hypothesis.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P34
noncomputable section
open Filter MeasureTheory
open scoped ENNReal NNReal BigOperators
namespace QAlgorithms.Papers.Independent.Support50.P34
open QAlgorithms.Papers.Independent.Dependency50.P13
(State PositiveTraceClass traceNormValue stateTraceNormTopology traceNormTopology
operatorTrace IsPositive IsTraceClass stateEntropy relativeEntropy entropyWeight)
open QAlgorithms.Papers.Independent.Dependency50.P25 (extendedIntegral)
open QAlgorithms.Papers.Independent.Frontier18.P01 (binaryEntropy)
attribute [local instance] Classical.propDecidable Classical.decEq
section Operators
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable {I : Type*}
section Statements
variable [hsep : TopologicalSpace.SeparableSpace H] [hI : Countable I]
include hsep hI
/-- Proposition 3 A–B, arXiv:0904.1963v3, PDF p.14: all ranks, inherited symmetry,
agreement, monotonicity, pointwise limit, and the separate continuity implication. -/
theorem proposition3_concaveApproximation (b : HilbertBasis I ℂ H)
(f : QuantumState b → EReal) (hf : LowerSemicontinuous f) (hb : LowerBounded f)
(hc : StateConcaveOn b Set.univ f) :
(∀ k : ℕ, 0 < k → rankSigmaRoof b f k = rankMuRoof b f k ∧
StateConcaveOn b Set.univ (rankMuRoof b f k) ∧
LowerSemicontinuous (rankMuRoof b f k) ∧
(∀ rho ∈ rankStates b k, rankMuRoof b f k rho = f rho) ∧
(∀ S : StateSymmetry b, (∀ rho, f (S.map rho) = f rho) →
∀ rho, rankMuRoof b f k (S.map rho) = rankMuRoof b f k rho)) ∧
(∀ rho, Monotone (fun n : ℕ => rankMuRoof b f (n + 1) rho) ∧
Tendsto (fun n : ℕ => rankMuRoof b f (n + 1) rho) atTop (nhds (f rho))) ∧
((∀ k : ℕ, 0 < k → FiniteERealContinuousOn f (rankStates b k)) →
∀ k : ℕ, 0 < k → FiniteERealContinuousOn (rankMuRoof b f k) Set.univ ∧
LowerBounded (rankMuRoof b f k) ∧ UpperBounded (rankMuRoof b f k)) := by sorry
end Statements
end Operators
end QAlgorithms.Papers.Independent.Support50.P34
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complex Hilbert space with Hilbert basis . Here a trace-class operator admits with , and is the infimum of these sums. Let be the self-adjoint trace-class operators with nonnegative quadratic forms and basis trace , with the initial topology of all functions for trace-class . Write for states whose ranges lie in the span of some vectors. Suppose is lower semicontinuous, bounded below by a real constant, and concave in the following precise sense: the set of state operators is convex, and whenever with and , one has . Define as the supremum of over probability measures on with barycenter , where barycenter means integrability and equality of every matrix element; define by restricting to measures concentrated on countable sets. Then, for every natural , , is concave in the stated operator-mixture sense and lower semicontinuous, and for every . Also, if is a homeomorphism of that preserves every convex operator-mixture relation and preserves, in both directions, every condition of having range contained in the span of vectors for every natural , then invariance for all states implies for all states. For every , the sequence is nondecreasing and converges to in the extended-real topology. Finally, if, for every , is finite on and its real-valued version is continuous there, then each , , is finite and real-continuous on all states and has both a real lower bound and a real upper bound. The original hypotheses permit , and the approximation sequence begins at rank bound .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.