Sufficiency, Conditional Expectations, and Petz Recovery
Equality in data processing certifies exact recoverability only after the channel, the reference state, its support, and the family of states to be recovered have been fixed. For an inclusion , a faithful normal reference state admits a state-preserving conditional expectation precisely when is invariant under its modular flow. Under those hypotheses the expectation and the Petz transpose channel express the same sufficiency mechanism.
Required background. Araki relative entropy and data processing provide the equality to be analyzed; normal completely positive maps fix the channel category. Helpful background. Split inclusions give the worked type-I factor, and modular automorphisms state the invariance criterion. Connections include conditional mutual information, approximate Markov recovery, Petz and rotated recovery, covariant recovery, and information–disturbance bounds.
Conditional expectations and modular invariance
Section titled “Conditional expectations and modular invariance”A normal conditional expectation is a normal unital completely positive projection satisfying the bimodule identity
Let be a faithful normal state on . Takesaki’s theorem states that a -preserving normal conditional expectation exists if and only if
When it exists, it is unique and commutes with the modular flow Takesaki 1972, Theorems 1–2, pp. 309–315. Thus “project onto the subalgebra” is not a construction: positivity, the bimodule property, normality, and modular invariance are substantive requirements.
The proof mechanism uses the GNS vector . Modular invariance makes the closed subspace stable under the modular operator and conjugation. The orthogonal projection then satisfies
and modular theory proves that the right-hand side defines a normal positive bimodule projection. Without invariance, the orthogonal projection need not send left multiplication by to an element of .
Sufficiency and the Petz map
Section titled “Sufficiency and the Petz map”Let be a normal unital completely positive map in the Heisenberg direction, and let be normal states on , with faithful or with all objects reduced to its support. Data processing gives
The channel is sufficient for the pair if there is a normal unital completely positive such that
Under the stated faithfulness and normality hypotheses, equality in data processing is equivalent to sufficiency; the recovery is the transpose map determined by . For modular-analytic elements define the KMS inner product
The transpose map is the KMS adjoint,
first on an analytic core and then by normal extension. In matrix algebras its Schrödinger predual becomes the familiar formula
with generalized inverses on supports and with picture conventions made explicit. Petz proved the von Neumann-algebra sufficiency/equality theorem using relative modular operators Petz 1986, Theorems 4–5, pp. 126–129.
One direction needs no formula. If a recovery fixes both states, apply data processing first to and then to :
Both inequalities must be equalities. The converse—from equality to construction of a normal completely positive recovery—is the genuinely modular part of Petz’s theorem and is where faithfulness and support reduction enter.
Exact equality for one pair does not recover every state. Nor does small entropy loss by itself imply exact recovery; approximate conclusions require an additional quantitative theorem and often a rotated or universal recovery map.
Split inclusion as an exact model
Section titled “Split inclusion as an exact model”Suppose two separated local algebras admit a split representation
Choose faithful normal states and the product reference . The map
extends normally to a -preserving conditional expectation onto . Its modular flow factorizes, , so the target algebra is invariant, independently verifying Takesaki’s criterion.
For every state in the declared family, discarding the second factor and restoring is exact recovery. Relative entropy factorization gives
so data processing is saturated. This realizes the Petz recovery construction without assuming that the original sharp local algebras are type I.
Now perturb the reference to a faithful correlated state whose modular group does not preserve . The same slice formula may still be a normal conditional expectation for a chosen , but it is not reference-state preserving, and it is not the Petz map for the perturbed reference. This adversarial test separates algebraic projection from statistical sufficiency.
Exercises
Section titled “Exercises”1. Verify the bimodule law. Prove that is an bimodule map and preserves .
Solution
For elementary tensors, multiply on the left and right by and . The slice gives , which is exactly . Moreover ; normality extends both identities.
2. Equality is family-dependent. Let be correlated but have marginal . Explain why discarding factor 2 cannot generally be recovered by adjoining the fixed state .
Solution
The recovered state is , which has no correlations. It equals only when the latter already has that product form. Hence exact recovery for the product family does not imply sufficiency for all normal states.