Skip to content

Mathematical Open-System Models

Tracing out an environment determines a reduced trajectory once a joint initial state is given. A channel family additionally requires a consistent rule for varying the initial system state, and a semigroup requires an exact composition law. The canonical Reduced Dynamics article explains the physical construction. This page organizes its mathematical assumptions and derives an identity that measures the failure of reduced semigroup composition.

Required background. Partial Trace Revisited gives the normal-state reduction map. Hilbert Space Tensor Products supplies the composite space and local operator domains.

Reduced models begin with specified state and preparation spaces

Section titled “Reduced models begin with specified state and preparation spaces”

Take separable Hilbert spaces HS,HE\mathcal H_S,\mathcal H_E and normal joint states in S1(HS⊗HE)\mathcal S_1(\mathcal H_S\otimes\mathcal H_E). A self-adjoint joint Hamiltonian defines the strongly continuous unitary group UtU_t even if the Hamiltonian is unbounded. Write

Ct(X)=UtXUt†,M(X)=Tr⁡EX.C_t(X)=U_tXU_t^\dagger,\qquad M(X)=\operatorname{Tr}_E X.

For a fixed initial joint state X0X_0, the reduced trajectory MCt(X0)M C_t(X_0) is well defined. It is not yet a map on arbitrary initial system states. To obtain such a map one specifies an assignment AA from allowed system inputs to joint preparations.

The standard channel construction uses one fixed normal environment state τ\tau and

A(ρ)=ρ⊗τ,MA=id.A(\rho)=\rho\otimes\tau,\qquad MA=\mathrm{id}.

Both AA and MM are channels between the relevant trace-class spaces. Hence Φt=MCtA\Phi_t=M C_tA is a channel for every tt. The fixed environment state and its independence from ρ\rho belong to the model data.

For correlated preparation families, an assignment may instead be defined only on a compatibility domain. Existence, positivity, and extension of such assignments are separate questions, developed in Initial Correlations. A reduced trajectory that is valid for one joint preparation should not be promoted to a universal system-only channel without resolving them.

Strong continuity passes to the reduced family

Section titled “Strong continuity passes to the reduced family”

Joint unitary dynamics is strongly continuous on the trace class, by the finite-rank density argument in Strong Continuity. Since AA is isometric in trace norm and MM is contractive,

∥Φt(ρ)−Φs(ρ)∥1≤∥Ct(Aρ)−Cs(Aρ)∥1⟶0\|\Phi_t(\rho)-\Phi_s(\rho)\|_1 \le\|C_t(A\rho)-C_s(A\rho)\|_1\longrightarrow0

as t→st\to s. Thus normality and trace-norm continuity of the reduced channel family do not require a bounded joint Hamiltonian.

Differentiability is stronger. The joint generator must be defined on AρA\rho, or a separate reduced differentiability argument must apply, before one differentiates under the partial trace. A formal expression involving an unbounded commutator is not valid for every normal state merely because the finite-time channel exists.

The reduced composition defect is an exact projection identity

Section titled “The reduced composition defect is an exact projection identity”

Set P=AMP=AM. This is a bounded CP trace-preserving projection on joint trace-class operators:

P2=AMAM=AM=P.P^2=AMAM=AM=P.

It discards the environment, including its correlations with the system, and prepares τ\tau again. It need not be an orthogonal projection for a Hilbert-space inner product.

Using the joint group law Ct+s=CtCsC_{t+s}=C_tC_s, subtract the two reduced evolutions:

Φt+s−ΦtΦs=MCtCsA−MCtAMCsA=MCt(I−P)CsA.\begin{aligned} \Phi_{t+s}-\Phi_t\Phi_s &=M C_tC_sA-M C_tAM C_sA\\ &=M C_t(I-P)C_sA. \end{aligned}

This identity requires no weak-coupling or Markov approximation. The term (I−P)CsAρ(I-P)C_sA\rho contains precisely the joint information removed by resetting the environment at time ss. Subsequent joint evolution can make that information visible again in the reduced system.

A sufficient condition for a reduced semigroup is invariance of the assignment range: CsA=AΦsC_sA=A\Phi_s for all s≥0s\ge0. Then (I−P)CsA=0(I-P)C_sA=0 and the defect vanishes. This condition is not necessary: a nonzero discarded component might remain invisible after every relevant MCtM C_t. The exact requirement is vanishing of the displayed composition defect on all inputs.

Worked example: an environment that gives back the input

Section titled “Worked example: an environment that gives back the input”

Take a system qubit and environment qubit with τ=I/2\tau=I/2. Let WW be the swap unitary and choose joint dynamics Ut=e−itWU_t=e^{-itW}, measuring time in units of its coupling. Since W2=IW^2=I,

Uπ/2=−iW,Uπ=−I.U_{\pi/2}=-iW,\qquad U_\pi=-I.

At the first time, swapping ρ⊗τ\rho\otimes\tau gives τ⊗ρ\tau\otimes\rho. The system’s reduced output is therefore τ\tau, independent of ρ\rho, while the environment holds the input. At time π\pi, the actual joint evolution returns the original joint state, so the reduced output is ρ\rho.

Composing two reduced half-period maps instead gives τ\tau: it implicitly applies PP between intervals and erases the stored input. The difference between actual reuse and this reset protocol is exactly the projection term above.

Two swaps return the original system state; resetting the environment between swaps erases that return.

The upper path follows the same system and environment continuously. The lower path resets the environment after the first swap, as composition of the two reduced maps requires. Their different final system states demonstrate the failure of the semigroup law. The environment retains the input at t=π/2t=\pi/2 even though the joint state at that instant is uncorrelated.

This same model realizes the reset-family revival considered in The Mathematical Language of Markovianity. A finite-time dilation of each channel therefore does not supply a common memoryless environment realization for their whole family.

A mathematical claim should identify its level

Section titled “A mathematical claim should identify its level”

A reduced model can establish a trajectory for one preparation, a channel on a specified input space, a continuous family of such channels, or a semigroup with a defined generator. Each level adds assumptions or identities.

For a proposed differential equation, the practical mathematical questions are which norm defines its solutions, which operators form its generator domain, whether a CP evolution exists, and whether it is conservative. The bounded theorem answers these questions under its hypotheses. The unbounded-generator example shows why the same formal appearance is insufficient beyond them.

An uncoupled environment. Let Ut=Vt⊗WtU_t=V_t\otimes W_t, where both factors are unitary groups. Is the reduced family a semigroup if WtτWt†≠τW_t\tau W_t^\dagger\ne\tau?

Solution

Yes. Partial trace gives Φt(ρ)=VtρVt†\Phi_t(\rho)=V_t\rho V_t^\dagger, which has the group law. The assignment range need not be invariant because the environment state changes, but the discarded change never influences the system. This demonstrates why assignment-range invariance is sufficient rather than necessary.

Size of a composition defect. Bound the error for a state ρ\rho by the joint information removed at the intermediate time.

Solution

Channel contraction gives ∥(Φt+s−ΦtΦs)(ρ)∥1≤∥(I−P)CsAρ∥1\|(\Phi_{t+s}-\Phi_t\Phi_s)(\rho)\|_1 \le\|(I-P)C_sA\rho\|_1. This is an upper bound, not an equality: subsequent dynamics and partial trace can hide some or all of the discarded difference.

  • Engel, Klaus-Jochen, and Rainer Nagel. One-Parameter Semigroups for Linear Evolution Equations. Graduate Texts in Mathematics 194, Springer, 2000. doi:10.1007/b97696. Continuity, generators, and evolution on Banach spaces.
  • Holevo, Alexander S. Quantum Systems, Channels, Information: A Mathematical Introduction, 2nd ed. De Gruyter, 2019. doi:10.1515/9783110642490. Normal channels, dilation, and reduced dynamics.
  • Milz, Simon, M. S. Kim, Felix A. Pollock, and Kavan Modi. “Completely positive divisibility does not mean Markovianity.” Physical Review Letters 123, 040401 (2019). Preprint. Why one-time channel information does not settle multitime memory.