Corollary 3.10
OpenQAlgorithms.Papers.Independent.Support50.P12.corollary_3_10Let be a Schwarz contraction on a nonzero concrete finite-dimensional algebra. Let be a complex-linear functional strictly positive on every nonzero positive element, and assume .
The fixed set is a nonzero finite-dimensional -algebra, possibly with its own unit, and restricts to a -morphism on . Moreover,
exists for every and is an -preserving conditional expectation onto . The draft expands this as a positive linear idempotent fixing , with range and the -bimodule property. This describes the ergodic fixed algebra.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P12
open Filter MeasureTheory Set
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Next46.P23 (Supports)
open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)
open QAlgorithms (spectralProjector)
open QAlgorithms.Learning (IsDistribution)
open QAlgorithms.Papers.Independent.Information100.P04 (absOp)
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
[Fintype K] [DecidableEq K]
/-- Corollary 3.10, PDF pp.14–15: the fixed algebra can have its OWN unit P.
The Cesàro limit is a positive contractive bimodule projection preserving alpha. -/
theorem corollary_3_10 [Nonempty I] (A : Alg I) (g : MatrixMap I I)
(hc : AlgebraExtension A A g) (hg : SchwarzBound A g 1) (alpha : Mat I →ₗ[ℂ] ℂ)
(ha : ∀ X ∈ A, X.PosSemidef → X ≠ 0 → 0 < (alpha X).re ∧ (alpha X).im = 0)
(hinv : ∀ X ∈ A, alpha (g X) = alpha X) :
let F := {X : Mat I | X ∈ A ∧ g X = X}
snorm A g = 1 ∧ pnorm g = 1 ∧
IsClosed F ∧ (0 : Mat I) ∈ F ∧
(∀ X ∈ F, ∀ Y ∈ F, X + Y ∈ F ∧ X * Y ∈ F) ∧
(∀ c : ℂ, ∀ X ∈ F, c • X ∈ F) ∧ (∀ X ∈ F, Xᴴ ∈ F) ∧
(∃ P ∈ F, P ≠ 0 ∧ ∀ X ∈ F, P * X = X ∧ X * P = X) ∧
(∀ X ∈ F, ∀ Y ∈ F, g (X * Y) = g X * g Y ∧ g (Xᴴ) = (g X)ᴴ) ∧
∃ E : MatrixMap I I, AlgebraExtension A A E ∧ PositiveOnConcreteAlgebra A E ∧
(∀ X ∈ A, Tendsto
(fun n : ℕ => (((n + 1 : ℕ) : ℂ)⁻¹) • ∑ k ∈ Finset.range (n + 1),
(g : Mat I → Mat I)^[k + 1] X) atTop (𝓝 (E X))) ∧
(∀ X ∈ A, E (E X) = E X ∧ alpha (E X) = alpha X ∧ E X ∈ F) ∧
(∀ X ∈ F, E X = X) ∧
(∀ X ∈ F, ∀ Y ∈ A, ∀ Z ∈ F, E (X * Y * Z) = X * E Y * Z) := by sorry
end QAlgorithms.Papers.Independent.Support50.P12
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty finite type with decidable equality, let be a unital complex subalgebra closed under conjugate transpose, let be complex linear, and let be complex linear. Assume that sends every matrix into , its adjoint sends every matrix into , is positive on positive semidefinite elements of , and
Assume also that and for every nonzero positive semidefinite , and that for every . Put , and define as the infimum in of over real for which is positive on and for all ; define
Then ; is closed, contains , and is closed under addition, multiplication, complex scalar multiplication, and conjugate transpose; there exists a nonzero with for every ; and for all , and . Furthermore, there exists a complex-linear map such that both and its adjoint send every matrix into , is positive on positive semidefinite elements of , and, for every ,
Also for every , and for every and . The averages start with , and is asserted to be an identity on , without an assertion that is the ambient identity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.