Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.10

Open
QAlgorithms.Papers.Independent.Support50.P12.corollary_3_10

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let γ:A→A\gamma:\mathcal A\to\mathcal Aγ:A→A be a Schwarz contraction on a nonzero concrete finite-dimensional algebra. Let α\alphaα be a complex-linear functional strictly positive on every nonzero positive element, and assume α∘γ=α\alpha\circ\gamma=\alphaα∘γ=α.

The fixed set F=ker⁡(id−γ)F=\ker(\mathrm{id}-\gamma)F=ker(id−γ) is a nonzero finite-dimensional C∗C^*C∗-algebra, possibly with its own unit, and γ\gammaγ restricts to a C∗C^*C∗-morphism on FFF. Moreover,

∥γ∥S=∥γ∥=1,γ∞(X)=lim⁡n→∞1n∑k=1nγk(X)\|\gamma\|_S=\|\gamma\|=1,\qquad\gamma_\infty(X)=\lim_{n\to\infty}\frac1n\sum_{k=1}^n\gamma^k(X)∥γ∥S​=∥γ∥=1,γ∞​(X)=n→∞lim​n1​k=1∑n​γk(X)

exists for every X∈AX\in\mathcal AX∈A and is an α\alphaα-preserving conditional expectation onto FFF. The draft expands this as a positive linear idempotent fixing FFF, with range FFF and the FFF-bimodule property. This describes the ergodic fixed algebra.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
Formal statement
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
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 14, Corollary 3.10
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let III be a nonempty finite type with decidable equality, let A⊆MI(C)A\subseteq M_I(\mathbb C)A⊆MI​(C) be a unital complex subalgebra closed under conjugate transpose, let g:MI(C)→MI(C)g:M_I(\mathbb C)\to M_I(\mathbb C)g:MI​(C)→MI​(C) be complex linear, and let α:MI(C)→C\alpha:M_I(\mathbb C)\to\mathbb Cα:MI​(C)→C be complex linear. Assume that ggg sends every matrix into AAA, its adjoint g∗(Z)ij=∑k,lg(Eij)kl‾Zklg^\ast(Z)_{ij}=\sum_{k,l}\overline{g(E_{ij})_{kl}}Z_{kl}g∗(Z)ij​=∑k,l​g(Eij​)kl​​Zkl​ sends every matrix into AAA, ggg is positive on positive semidefinite elements of AAA, and

g(X)†g(X)⪯g(X†X)(X∈A).g(X)^\dagger g(X)\preceq g(X^\dagger X)\qquad(X\in A).g(X)†g(X)⪯g(X†X)(X∈A).

Assume also that Re⁡α(X)>0\operatorname{Re}\alpha(X)>0Reα(X)>0 and Im⁡α(X)=0\operatorname{Im}\alpha(X)=0Imα(X)=0 for every nonzero positive semidefinite X∈AX\in AX∈A, and that α(gX)=α(X)\alpha(gX)=\alpha(X)α(gX)=α(X) for every X∈AX\in AX∈A. Put F={X∈A:gX=X}F=\{X\in A:gX=X\}F={X∈A:gX=X}, and define sA(g)s_A(g)sA​(g) as the infimum in [0,∞][0,\infty][0,∞] of ofReal⁡(c)\operatorname{ofReal}(c)ofReal(c) over real c≥0c\ge0c≥0 for which ggg is positive on AAA and g(X)†g(X)⪯c g(X†X)g(X)^\dagger g(X)\preceq c\,g(X^\dagger X)g(X)†g(X)⪯cg(X†X) for all X∈AX\in AX∈A; define

p(g)=sup⁡∑i∣vi∣2=1Re⁡ ⁣(∑ivi‾(g(1)†g(1)v)i).p(g)=\sqrt{\sup_{\sum_i|v_i|^2=1} \operatorname{Re}\!\left(\sum_i\overline{v_i} \bigl(g(\mathbf1)^\dagger g(\mathbf1)v\bigr)_i\right)}.p(g)=∑i​∣vi​∣2=1sup​Re(i∑​vi​​(g(1)†g(1)v)i​)​.

Then sA(g)=p(g)=1s_A(g)=p(g)=1sA​(g)=p(g)=1; FFF is closed, contains 000, and is closed under addition, multiplication, complex scalar multiplication, and conjugate transpose; there exists a nonzero P∈FP\in FP∈F with PX=XP=XPX=XP=XPX=XP=X for every X∈FX\in FX∈F; and for all X,Y∈FX,Y\in FX,Y∈F, g(XY)=g(X)g(Y)g(XY)=g(X)g(Y)g(XY)=g(X)g(Y) and g(X†)=g(X)†g(X^\dagger)=g(X)^\daggerg(X†)=g(X)†. Furthermore, there exists a complex-linear map E:MI(C)→MI(C)E:M_I(\mathbb C)\to M_I(\mathbb C)E:MI​(C)→MI​(C) such that both EEE and its adjoint send every matrix into AAA, EEE is positive on positive semidefinite elements of AAA, and, for every X∈AX\in AX∈A,

1n+1∑k=0ng k+1(X)⟶E(X),E(E(X))=E(X),α(E(X))=α(X),E(X)∈F.\frac1{n+1}\sum_{k=0}^{n}g^{\,k+1}(X)\longrightarrow E(X),\qquad E(E(X))=E(X),\quad \alpha(E(X))=\alpha(X),\quad E(X)\in F.n+11​k=0∑n​gk+1(X)⟶E(X),E(E(X))=E(X),α(E(X))=α(X),E(X)∈F.

Also E(X)=XE(X)=XE(X)=X for every X∈FX\in FX∈F, and E(XYZ)=XE(Y)ZE(XYZ)=XE(Y)ZE(XYZ)=XE(Y)Z for every X,Z∈FX,Z\in FX,Z∈F and Y∈AY\in AY∈A. The averages start with g(X)g(X)g(X), and PPP is asserted to be an identity on FFF, without an assertion that PPP is the ambient identity.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me