OctoInformBeta

OpenAI preprint, September 2026 · Section 3. A common purification of effects

Section 3 (setting): Matrix definitions for the common purification of effects

A resolvent kernel and spectral entropy.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let ℋ\mathcal H be a finite-dimensional complex Hilbert space, and let II be its identity operator. The common purification of effects uses a matrix kernel with a real parameter and an operator defined by continuous functional calculus.

The resolvent RT(s)R_T(s) of a square complex matrix TT at a real parameter ss is the inverse matrix in (1): RT(s)=(T+sI)−1.R_T(s)=(T+sI)^{-1}.(1)✦

The Definition

Definition 1. Let TT be a square complex matrix. The purification kernel KTK_T of a square complex matrix TT is the matrix-valued function of a real parameter ss defined by KT(s)=TRT(s)=T(T+sI)−1.K_T(s)=T R_T(s)=T(T+sI)^{-1}.(2)✦ The spectral entropy operator ℰ(T)\mathcal E(T) of a square complex matrix TT is the operator given by the continuous functional calculus expression ℰ(T)=f(T),f(t)={tlog⁡|t|,t≠0,0,t=0,t∈ℝ.\mathcal E(T)=f(T), \qquad f(t)= \begin{cases} t\log|t|,&t\ne 0,\\ 0,&t=0, \end{cases} \qquad t\in\mathbb R.(3)✦ For a positive semidefinite TT, the notation for this operator is Tlog⁡TT\log T.

What Is Checked

The definitions (2) and (3) are stated for arbitrary finite square complex matrices, with an arbitrary real parameter in the resolvent and purification kernel.