Preprint
Article

This version is not peer-reviewed.

Unified Evolution Equation

Submitted:

11 January 2026

Posted:

13 January 2026

You are already at the latest version

Abstract
The Unified Evolution Equation (UEE) provides a common analytical framework that unifies reversible quantum dynamics (unitary evolution), dissipative dynamics of open systems (GKLS), and transport effects induced by boundaries and resonances (zero-area resonance kernels) as a single notion of time evolution of states. The purpose of this paper (UEE_01) is to define the UEE as a mathematically consistent analytical foundation and to establish its well-posedness, including existence, uniqueness, and invariance of states.We formulate the theory by taking the observable algebra as a von Neumann algebra and the state space as its predual, and by characterizing physically admissible time evolutions as preduals of normal, unital, completely positive maps. The UEE is formally expressed as a sum of reversible, dissipative, and resonance-transport generators. Rigorously, solutions are defined in the mild sense as trajectories generated by a strongly continuous completely positive and trace-preserving (CPTP) semigroup.Given the analytical data of the UEE, we construct the reversible, dissipative, and resonance-transport components separately as CPTP group or semigroup evolutions. Using a Chernoff/Trotter-type product formula, we prove that the composite limit evolution exists, forms a CPTP semigroup, and that its generator coincides with the closure of the sum of the individual generators. As a consequence, invariance of the set of normal states and the well-posedness of the UEE are rigorously established.This work provides a solid analytical foundation for the unified GKLS+$R$ representation employed in subsequent papers, ensuring consistency between physical modeling and operator-theoretic dynamics.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

1.0. Proposal of the Unified Evolution Equation

(1)
Aim: What is the UEE?
The UEE series presents a common equation format for describing, as a single “time evolution of states (Schrödinger picture)”, the reversible dynamics of quantum systems (unitary evolution), dissipation as open systems (coarse-graining and measurement), and transport arising from boundaries and resonances (including the exact elimination of area terms). This time-evolution scheme is called the Unified Evolution Equation (UEE).
The standpoint of this paper is to first define the UEE without inconsistency as an analytical foundation. Accordingly, in this section we clarify the “proposal content” of the UEE with a minimal set of formulas, while detailed mathematical definitions (types of state spaces, CPTP properties, semigroups, generators, and closure under limits) are axiomatized step by step in the subsequent sections (§1.1–§1.4).
(2)
Abstract form in UEE_01 (as an analytical contract)
In UEE_01, the observable algebra is taken to be a von Neumann algebra M , and the state space its predual M * . The time evolution of a state ρ ( t ) M * is expressed in the following formal differential form:
ρ ˙ ( t ) = L tot [ ρ ( t ) ] , L tot : = L 0 + L Δ + R .
Here L 0 denotes the reversible (unitary) component, L Δ the dissipative component, and R the zero-area resonance (transport) component. In this paper, (1) is presented as the “central equation”; however, since generators generally come with domains, the precise meaning of (1) is given as a mild solution (semigroup action)
ρ ( t ) = T tot ( t ) [ ρ 0 ] ( t 0 )
generated by a strongly continuous CPTP (completely positive and trace-preserving) semigroup  { T tot ( t ) } t 0 (the definition is given in §1.2). By this “definition as a semigroup,” state requirements such as positivity and normalization (trace preservation) are structurally guaranteed not to be violated under time evolution.
(3)
Standard representation used from UEE_05 onward (density-matrix representation)
In subsequent papers (UEE_05 and later), it is common to adopt the standard representation M = B ( H ) and M * = T 1 ( H ) (where T 1 denotes the trace class), and to represent ρ ( t ) as a density operator (density matrix). In this case, (1) is typically written in the following common form:
ρ ˙ ( t ) = i [ H , ρ ( t ) ] + k L k ρ ( t ) L k 1 2 { L k L k , ρ ( t ) } + R [ ρ ( t ) ] .
That is, the reversible component is given by the commutator i [ H , · ] (a derivation), the dissipative component by a GKLS (Lindblad) generator, and R is placed alongside as a zero-area resonance generator. Moreover, in UEE_05 and later, a representation is frequently used in which, employing a family of measurement projections { Π n } , one sets V n = γ Π n (minimal-rank GKLS), and the dissipation is given by n V n ρ V n 1 2 { V n V n , ρ } . Furthermore, in UEE_05 and later, the minimal set of building blocks supporting this common form is treated collectively as D (reversible derivation), { Π n } (pointer projection family), { V n } (Kraus operators), Φ (normalization map), and R (zero-area resonance kernel) (the notation S5).
In the notation of this paper, the first term of (2) corresponds to L 0 , the entire second term to L Δ , and R is treated as the same component.
(4)
Standpoint of this paper: fixing the proposal as an analytical foundation
What this paper addresses is not the derivation of the UEE from “physical motivations,” but rather the fixing of the UEE as a minimal analytically tractable contract and the guarantee, under that contract, that the UEE is well posed (existence, uniqueness, and invariance of states). In the next section §1.1, we clarify the input contracts to be fixed and the properties to be guaranteed by this paper; in §1.2 we declare the analytical objects; in §1.3 we state the main results; and in §1.4 we provide a roadmap of the paper structure.

1.1. Role of This Paper

(1)
Contract as an analytical foundation: what this paper “fixes” and “guarantees”
The role of this paper is to define the Unified Evolution Equation (UEE) as a mathematically consistent “time evolution of states (Schrödinger picture)” and to clarify the minimal requirements that make it analytically interpretable. More concretely, when the UEE is given in the form
ρ ˙ ( t ) = L tot [ ρ ( t ) ] ,
this paper rigorously demonstrates, in a self-contained manner within the text, (i) on which space ρ ( t ) should be treated (the type of the state space), (ii) the minimal conditions that each component constituting the generator L tot must satisfy (input contracts), and (iii) that, under those conditions, the time evolution t ρ ( t ) is uniquely determined and that the requirements for states (positivity, normalization, trace preservation corresponding to information conservation, etc.) are not violated (well-posedness and invariance).
Since this paper is a “foundational analytical paper,” the following are clearly separated and excluded from its scope:
  • Derivation of equivalence between representations such as operator, variational, and field forms (in this paper, the operator form as the analytical input is fixed).
  • Concrete phenomenology, numerical fitting, and identification of physical constants (the focus is on establishing definitions and theorems as an analytical foundation).
  • Detailed geometric constructions (e.g., concrete flows on spacetime or measure-theoretic constructions); these are introduced only as abstract specifications when necessary and are formalized only to the extent required for the analytical claims.
(2)
Input of this paper: observable algebra, state space, and dynamical data (input contract)
This paper is based on the duality between observables (Heisenberg picture) and states (Schrödinger picture), and fixes the state space as the “predual of the algebra.” On this basis, the analytical input (data) of the UEE is defined uniquely.
Definition 1 (Observable algebra and state space (predual)).
Let M be a von Neumann algebra, and let its predual be denoted by M * . We write the unit of M as 1 .
1.
Positive functional: A functional ρ M * is said to be positive if ρ ( A ) 0 holds for any positive operator A M ( A 0 ).
2.
Normal state: A functional ρ M * is called a normal state if it is positive and satisfies ρ ( 1 ) = 1 . The set of all normal states is denoted by S ( M ) .
Hereafter, the time evolution of states is defined as a family of maps on M * , and the UEE is described as its generator.
Definition 2 (UEE analytical data (minimal form of the input contract)).
The UEE analytical data in this paper is the tuple
D : = ( M , M * , D , L Δ , R ) ,
which satisfies the following:
1.
D is self-adjoint data generating the reversible (unitary) component, and L 0 : = i [ D , · ] is defined (as a linear operator on M * under an appropriate domain).
2.
L Δ is the generator representing the dissipative component (measurement and coarse-graining), and generates, on M * , a completely positive and trace-preserving (CPTP, defined below) semigroup (details are axiomatized and constructed in subsequent sections of the text).
3.
R is the generator representing the resonance and transport component, and generates a CPTP semigroup on M * .
  • Remark (fixing of types)
In this paper, D is (typically) introduced as an operator on a Hilbert space, whereas L Δ and R are generators (superoperators) on M * . Accordingly, we do not add D and R as objects of the same type (e.g., we do not write D + R ). Addition is always performed only at the level of generators, as
L tot : = L 0 + L Δ + R .
(3)
Minimal definition of CPTP (completely positive and trace-preserving) and immediate consequences (with proofs)
In this paper, the condition that the time evolution of states is “physically admissible” is formalized as CPTP (completely positive and trace-preserving). Normality of maps on a von Neumann algebra is fixed in order to ensure the well-definedness of the predual maps.
Definition 3 (Normal, completely positive, unital maps and preduals).
Let α : M M be a linear map.
1.
Normality: The map α is said to be normal if, for any increasing bounded net of positive operators 0 A i A in M , one has α ( A i ) α ( A ) .
2.
Complete positivity: The map α is said to be completely positive (CP) if, for any n N , id M n α maps positive operators on M n ( C ) ¯ M to positive operators.
3.
Unitality: If α ( 1 ) = 1 holds, α is said to be unital.
4.
Predual map: If α is normal, its predual α * : M * M * is defined by
( α * ρ ) ( A ) : = ρ ( α ( A ) ) ( ρ M * , A M ) .
Lemma 1 (The predual of a unital CP map preserves states).
Let α : M M be normal, completely positive, and unital. Then its predual α * : M * M * preserves the set of normal states, and
α * S ( M ) S ( M )
holds.
Proof. 
Take an arbitrary ρ S ( M ) . What must be shown is (i) that α * ρ is positive, and (ii) that ( α * ρ ) ( 1 ) = 1 .
(i) Positivity: Let A M be arbitrary with A 0 . By complete positivity (in particular, positivity), we have α ( A ) 0 . Since ρ is a positive functional, ρ ( α ( A ) ) 0 holds. By the definition of the predual in Definition 3,
( α * ρ ) ( A ) = ρ ( α ( A ) ) .
Therefore ( α * ρ ) ( A ) 0 holds for all A 0 , and α * ρ is positive.
(ii) Normalization: By unitality, α ( 1 ) = 1 . Hence, by the definition of the predual,
( α * ρ ) ( 1 ) = ρ ( α ( 1 ) ) = ρ ( 1 ) = 1 .
Thus α * ρ S ( M ) follows. □
Lemma 2 
(Composition of normal unital CP maps belongs to the same class). Let α , β : M M both be normal, completely positive, and unital. Then their composition α β is also normal, completely positive, and unital. Moreover, for the preduals,
( α β ) * = β * α *
holds.
Proof. 
(i) Unitality:.
( α β ) ( 1 ) = α ( β ( 1 ) ) = α ( 1 ) = 1 .
(ii) Complete positivity: Take an arbitrary n N . On M n ( C ) ¯ M ,
id M n ( α β ) = id M n α id M n β
holds. Since id M n β maps positive operators to positive operators, and id M n α does likewise, their composition also maps positive operators to positive operators. Hence α β is completely positive.
(iii) Normality: Take an increasing bounded net of positive operators 0 A i A . Since β is normal, β ( A i ) β ( A ) . Since α is normal, α ( β ( A i ) ) α ( β ( A ) ) . Therefore ( α β ) ( A i ) ( α β ) ( A ) , and α β is normal.
(iv) Composition formula for the preduals: For arbitrary ρ M * and A M , by Definition 3,
( β * α * ) ρ ( A ) = ( α * ρ ) β ( A ) = ρ α ( β ( A ) ) = ρ ( α β ) ( A ) = ( α β ) * ρ ( A ) .
Hence they coincide as functionals, and ( α β ) * = β * α * follows. □
(4)
Destination of this paper (conclusion of this subsection) and connection to subsequent sections
From the above, this paper has formulated “physically admissible time evolution” as the predual of normal, unital CP maps on a von Neumann algebra, and has shown (within this subsection) that the state set S ( M ) is automatically invariant. In the subsequent sections, from each component of the UEE analytical data (Definition 2), we construct
L tot : = L 0 + L Δ + R ,
obtain a strongly continuous CPTP semigroup T ( t ) as the composite limit of component semigroups, and prove that ρ ( t ) = T ( t ) [ ρ 0 ] is the rigorous (mild) solution of the UEE.
Preprints 193851 i001

1.2. Declaration of Analytical Objects

(1)
Position of this subsection: fixing the “types” and “objects” on which all subsequent discussions rely
In this subsection, in order to treat the Unified Evolution Equation (UEE) as a mathematical object, we declare, in a way that prevents any confusion of types, (i) the stage (observable algebra and state space), (ii) the dynamics (a family of time-evolution maps), and (iii) the generator (the right-hand side of the differential equation). In particular, as a “foundational analytical paper,” this paper fixes the analytical objects of the UEE with minimal specifications so that the subsequent discussions of existence, uniqueness, and conservation laws do not break down due to ambiguity of definitions or mixing of operator types.
(2)
Definition of the UEE-Analytic Datum: fixing the input contract
The UEE is described by a generator (superoperator) L tot that gives the time evolution of a state ρ ( t ) . In this paper, the input required for the analysis of the UEE is defined as the following tuple.
Definition 4 
(UEE-Analytic Datum). The analytical datum of the UEE (UEE-Analytic Datum) is a tuple
D : = ( M , M * , D , L Δ , R ) ,
which satisfies the following:
1.
Observable algebra and state space:  M is a von Neumann algebra, and M * is its predual. The set of normal states is defined by
S ( M ) : = { ρ M * : ρ 0 , ρ ( 1 ) = 1 } .
2.
Reversible component:D is given (in the standard realization M = B ( H ) ) as a self-adjoint operator on a Hilbert space, and, via the unitary conjugation group defined later, yields a reversible (CPTP) time evolution on the state space.
3.
Dissipative component:  L Δ is a linear operator on the state space M * , and generates a completely positive and trace-preserving (CPTP) strongly continuous semigroup.
4.
Transport (resonance) component: R is a linear operator on the state space M * , and generates a CPTP strongly continuous semigroup.
  • Remark (prohibited type operations)
While D is given (in the standard realization) as an operator on a Hilbert space, L Δ and R are generators (superoperators) on the state space M * . Accordingly, in this paper we never add D and R as objects of the same type (e.g., we never write D + R ). Hereafter, addition is performed only among generators, and the total generator is defined by
L tot : = L 0 + L Δ + R L 0 will be given later .
(3)
Time-evolution family and generator of the UEE: formulation as an abstract Cauchy problem
This paper treats the UEE as an abstract Cauchy problem on the Banach space X : = M * . For this purpose, we define strongly continuous semigroups and their generators.
Definition 5 (Strongly continuous semigroup and generator).
Let X be a Banach space, and let { T ( t ) } t 0 be a family of linear operators on X.
1.
The family { T ( t ) } t 0 is called a  strongly continuous semigroup ( C 0 -semigroup) if
T ( 0 ) = I , T ( t + s ) = T ( t ) T ( s ) ( t , s 0 )
and for every x X ,
lim t 0 T ( t ) x x X = 0
holds.
2.
The generator A of { T ( t ) } t 0 is defined by taking as its domain Dom ( A ) the set of all x X for which the limit
A x : = lim t 0 T ( t ) x x t
exists.
  • Abstract form of the UEE
The UEE treated in this paper is (formally) given by
d d t ρ ( t ) = L tot [ ρ ( t ) ] ρ ( 0 ) = ρ 0 S ( M ) .
However, from the analytical standpoint of this paper, we allow that the domain of L tot does not, in general, coincide with the whole space, and we adopt as the basic notion that the solution is first given by a strongly continuous semigroup T ( t ) as
ρ ( t ) : = T ( t ) [ ρ 0 ]
(the so-called mild solution). With this criterion of “mild solution = semigroup action,” we can address the domain issue head-on without evading it.
(4)
Basic lemmas in the standard realization ( B ( H ) and trace class): CPTP property and strong continuity of the reversible component
In order to complete the proofs within the paper, we henceforth adopt, as the main stage, the standard realization
M = B ( H ) , M * = T 1 ( H )
(trace-class operators). Here the reversible component L 0 is determined by unitary conjugation generated by a self-adjoint operator D. We prove its properties (CPTP, isometry, and strong continuity) within this subsection, without depending on later sections.
First, we fix basic facts about the trace and the trace norm.
Lemma 3 (Cyclicity for products of a trace-class operator and a bounded operator).
Let H be a complex Hilbert space, and let A B ( H ) and B T 1 ( H ) . Then A B , B A T 1 ( H ) , and
Tr ( A B ) = Tr ( B A )
holds.
Proof. Step 1 (finite-rank case): 
Assume that B is a finite-rank operator. A finite-rank operator can be written as a finite sum
B = k = 1 n | ψ k ϕ k | ( ψ k , ϕ k H ) .
Then
A B = k = 1 n | A ψ k ϕ k | , B A = k = 1 n | ψ k A * ϕ k |
and both are trace class since they are finite rank. Moreover, for a rank-one operator | ψ ϕ | ,
Tr | ψ ϕ | = ϕ , ψ
holds (for an orthonormal basis { e j } , j e j , | ψ ϕ | e j = j e j , ψ ϕ , e j = ϕ , ψ ). Hence
Tr ( A B ) = k = 1 n Tr | A ψ k ϕ k | = k = 1 n ϕ k , A ψ k , Tr ( B A ) = k = 1 n Tr | ψ k A * ϕ k | = k = 1 n A * ϕ k , ψ k = k = 1 n ϕ k , A ψ k .
Therefore Tr ( A B ) = Tr ( B A ) holds for finite-rank B.
Step 2 (extension to general trace-class operators): In general, for B T 1 ( H ) , by singular-value decomposition (Schmidt decomposition),
B = k = 1 s k | ψ k ϕ k |
with { s k } satisfying s k 0 and k s k < (countability of the trace norm). The partial sums
B N : = k = 1 N s k | ψ k ϕ k |
are finite rank, and
B B N 1 = k > N s k 0 ( N ) .
For bounded A, by the ideal property of the trace norm,
A ( B B N ) 1 A B B N 1 0 , ( B B N ) A 1 A B B N 1 0 .
Hence A B N A B and B N A B A in trace norm. Since the trace is continuous with respect to the trace norm,
Tr ( A B ) = lim N Tr ( A B N ) , Tr ( B A ) = lim N Tr ( B N A ) .
By Step 1, Tr ( A B N ) = Tr ( B N A ) for each N, and taking limits yields Tr ( A B ) = Tr ( B A ) . Moreover, the above estimates imply that A B , B A are trace class. □
Next, we state explicitly the density of finite-rank operators (used in the proof of strong continuity).
Lemma 4 (Density of finite-rank operators).
The set of all finite-rank operators F ( H ) is dense in T 1 ( H ) . That is, for any B T 1 ( H ) and any ε > 0 , there exists B ε F ( H ) such that
B B ε 1 < ε .
Proof. 
Take an arbitrary B T 1 ( H ) . By singular-value decomposition,
B = k = 1 s k | ψ k ϕ k | , s k 0 , k = 1 s k = B 1 < .
The partial sums B N : = k = 1 N s k | ψ k ϕ k | are finite rank, and
B B N 1 = k > N s k 0 ( N ) .
Therefore, for a given ε > 0 , choosing sufficiently large N yields B B N 1 < ε . □
Using these, we show that the reversible component is proper as an “analytical object.”
Theorem 1 (CPTP property, isometry, and strong continuity of the unitary conjugation group).
Let D be a self-adjoint operator on H , and let U ( t ) : = e i t D ( t R ) be the unitary group given by Stone’s theorem. Define a family of maps { T 0 ( t ) } t R on X : = T 1 ( H ) by
T 0 ( t ) [ ρ ] : = U ( t ) ρ U ( t ) * ( ρ X ) .
Then the following hold:
1.
(CPTP) For each t, T 0 ( t ) is completely positive and trace-preserving.
2.
(Group property) T 0 ( t + s ) = T 0 ( t ) T 0 ( s ) , T 0 ( 0 ) = I , and T 0 ( t ) 1 = T 0 ( t ) .
3.
(Isometry) For each t, T 0 ( t ) [ ρ ] 1 = ρ 1 .
4.
(Strong continuity) For any ρ X , T 0 ( t ) [ ρ ] ρ 1 0 as t 0 .
Therefore, { T 0 ( t ) } t R is a strongly continuous isometric CPTP group on X, and in particular preserves the normal state set S ( B ( H ) ) .
Proof. (1) CPTP:
First we show that T 0 ( t ) is well-defined on X. Since U ( t ) B ( H ) is bounded and ρ T 1 ( H ) is trace class, both U ( t ) ρ and ( U ( t ) ρ ) U ( t ) * are trace class (the trace class is preserved under left and right multiplication by bounded operators). Hence T 0 ( t ) : X X is well-defined.
Next we show trace preservation. Applying Lemma 3 with A : = U ( t ) * and B : = U ( t ) ρ yields
Tr U ( t ) ρ U ( t ) * = Tr ρ U ( t ) * U ( t ) = Tr ( ρ ) .
Thus T 0 ( t ) is trace-preserving.
Next we show complete positivity. For any n N , on H n : = C n H , U ˜ ( t ) : = I n U ( t ) is unitary. Identifying M n ( C ) T 1 ( H ) with T 1 ( H n ) , id n T 0 ( t ) is given by
( id n T 0 ( t ) ) [ ρ ˜ ] = U ˜ ( t ) ρ ˜ U ˜ ( t ) * ( ρ ˜ T 1 ( H n ) ) .
If ρ ˜ 0 , then for any ξ H n ,
ξ , U ˜ ( t ) ρ ˜ U ˜ ( t ) * ξ = U ˜ ( t ) * ξ , ρ ˜ U ˜ ( t ) * ξ 0 ,
so U ˜ ( t ) ρ ˜ U ˜ ( t ) * 0 . Hence id n T 0 ( t ) preserves positivity, and T 0 ( t ) is completely positive. Therefore T 0 ( t ) is CPTP.
(2) Group property: By the unitary-group identities U ( t + s ) = U ( t ) U ( s ) and U ( 0 ) = I , for any ρ X ,
T 0 ( t + s ) [ ρ ] = U ( t + s ) ρ U ( t + s ) * = U ( t ) U ( s ) ρ U ( s ) * U ( t ) * = T 0 ( t ) T 0 ( s ) [ ρ ]
holds. Thus T 0 ( t + s ) = T 0 ( t ) T 0 ( s ) , and T 0 ( 0 ) = I . Moreover, since U ( t ) 1 = U ( t ) * = U ( t ) , we have T 0 ( t ) 1 = T 0 ( t ) .
(3) Isometry (trace-norm invariance): Take an arbitrary ρ X . The trace norm is defined by ρ 1 = Tr ( | ρ | ) . Let | A | : = ( A * A ) 1 / 2 . First,
T 0 ( t ) [ ρ ] * T 0 ( t ) [ ρ ] = ( U ρ U * ) * ( U ρ U * ) = U ρ * U * U ρ U * = U ( ρ * ρ ) U * = U ( | ρ | 2 ) U * ,
hence
T 0 ( t ) [ ρ ] = U | ρ | 2 U * 1 / 2 = U | ρ | U *
by uniqueness of the square root and unitarity of U. Therefore, using Lemma 3,
T 0 ( t ) [ ρ ] 1 = Tr | T 0 ( t ) [ ρ ] | = Tr ( U | ρ | U * ) = Tr ( | ρ | U * U ) = Tr ( | ρ | ) = ρ 1 .
(4) Strong continuity: Take arbitrary ρ X and ε > 0 . By Lemma 4, choose a finite-rank ρ ε such that
ρ ρ ε 1 < ε .
By isometry,
T 0 ( t ) [ ρ ] ρ 1 T 0 ( t ) [ ρ ρ ε ] 1 + T 0 ( t ) [ ρ ε ] ρ ε 1 + ρ ε ρ 1
= 2 ρ ρ ε 1 + T 0 ( t ) [ ρ ε ] ρ ε 1 < 2 ε + T 0 ( t ) [ ρ ε ] ρ ε 1 .
Hence it suffices to show that T 0 ( t ) [ ρ ε ] ρ ε 1 0 as t 0 .
A finite-rank ρ ε can be written as
ρ ε = k = 1 N | ψ k ϕ k | .
Thus
T 0 ( t ) [ ρ ε ] ρ ε = k = 1 N | U ( t ) ψ k U ( t ) ϕ k | | ψ k ϕ k | .
Each term can be decomposed as
| U ψ U ϕ | | ψ ϕ | = | U ψ | ψ U ϕ | + | ψ U ϕ | ϕ | ,
which is an identity obtained by adding and subtracting. Since the trace norm of a rank-one operator | η ξ | is | η ξ | 1 = η ξ , by the triangle inequality,
| U ψ U ϕ | | ψ ϕ | 1 U ( t ) ψ ψ U ( t ) ϕ + ψ U ( t ) ϕ ϕ .
By unitarity, U ( t ) ϕ = ϕ , so
| U ψ U ϕ | | ψ ϕ | 1 U ( t ) ψ ψ ϕ + ψ U ( t ) ϕ ϕ .
Since U ( t ) is strongly continuous on H (Stone’s theorem), U ( t ) ψ ψ 0 and U ( t ) ϕ ϕ 0 as t 0 . Therefore, for each k,
| U ( t ) ψ k U ( t ) ϕ k | | ψ k ϕ k | 1 0 ( t 0 ) .
Because the sum is finite, we can interchange limit and summation, obtaining
T 0 ( t ) [ ρ ε ] ρ ε 1 k = 1 N | U ( t ) ψ k U ( t ) ϕ k | | ψ k ϕ k | 1 0 ( t 0 ) .
Hence, for any ε > 0 , taking t sufficiently small yields T 0 ( t ) [ ρ ] ρ 1 < 3 ε , proving strong continuity.
Finally, invariance of S ( B ( H ) ) follows from the CPTP property. (Positivity and trace preservation were shown in (1).) □
(5)
Conclusion of this subsection: analytical objects (types, time evolution, generators) have been fixed
In this subsection, we declared the objects for treating the UEE analytically as (i) the observable algebra M and the state space M * , (ii) the analytical datum D = ( M , M * , D , L Δ , R ) , and (iii) the total generator L tot = L 0 + L Δ + R , and prohibited any confusion of types. Moreover, in the standard realization, we proved within the text that the reversible component is well-defined as a strongly continuous CPTP group by Theorem 1. In the subsequent sections, we establish the generation of semigroups by the dissipative component L Δ and the transport component R, and, by composing them, we establish the well-posedness of the UEE (existence, uniqueness, and invariance of states).
Preprints 193851 i002

1.3. Main Results

(1)
Aim of this subsection: explicitly stating the “minimal set” proved in this paper and fixing the dependency structure
In this subsection, we list the main results that this paper must establish as foundational analysis, in a form such that the proof structure of the subsequent sections can be reconstructed uniquely. The main results here are: (i) the reversible part, the dissipative part, and the transport (resonance) part each provide physically admissible time evolutions (CPTP), (ii) by their componentwise composition, the total generator
L tot : = L 0 + L Δ + R ( L 0 : = i [ D , · ] )
generates a strongly continuous CPTP semigroup, and the UEE solution (mild solution) exists uniquely, and (iii) the set of normal states is invariant for all times, in these three points.
The proofs concerning existence and identification of the generator in the main theorem are given in the subsequent sections (§3–§6) after preparing the required apparatus ( C 0 -semigroup theory, product formulas, common cores). On the other hand, in this subsection we completely prove, within the paper, the closure lemmas required for “CPTP is preserved under componentwise composition,” so that the subsequent proofs close without external references.
(2)
Re-declaration of the main objects: component semigroups and composite approximations
Hereafter, let the state space be a Banach space X (in the standard realization, X = T 1 ( H ) ), with norm · 1 . We write the component semigroups as
T 0 ( t ) : = e t L 0 , T Δ ( t ) : = e t L Δ , T R ( t ) : = e t R ( t 0 )
(the precise definitions, CPTP properties, and strong continuity of each are given in subsequent sections).
Define the basic map for the composite approximation by
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) ( t 0 ) ,
and define the approximating semigroup sequence for an n-partition by
T ( n ) ( t ) : = F ( t / n ) n ( t 0 , n N ) .
The main theorem (stated below) asserts that the strong limit
T ( t ) [ ρ ] : = lim n T ( n ) ( t ) ρ ( ρ X )
exists, that { T ( t ) } t 0 is a strongly continuous CPTP semigroup, and that its generator coincides with L tot ¯ .
(3)
Closure of CPTP: CPTP is not destroyed by composition or by pointwise strong limits (complete proofs)
The key point that must be established first in this subsection is the closure property: “the composition of CPTP maps is CPTP, and moreover the pointwise strong limit preserves CPTP.” This secures the CPTP property of the limit semigroup obtained by a product formula, independently of generator identification.
Lemma 5 (Closure under composition of CPTP maps).
Let X = T 1 ( H ) . If S , T : X X are CPTP, then the composition S T is also CPTP.
Proof. 
Trace preservation follows from linearity and Tr ( S [ T ( ρ ) ] ) = Tr ( T ( ρ ) ) = Tr ( ρ ) . For complete positivity, take an arbitrary n N and note that
id n ( S T ) = ( id n S ) ( id n T ) .
Since id n T preserves positivity and id n S also preserves positivity, their composition preserves positivity. Hence S T is completely positive. Therefore S T is CPTP. □
Lemma 6 (Closure of CPTP under pointwise strong limits).
Let X = T 1 ( H ) . Let { T n } n N be a sequence of linear maps such that each T n is CPTP, and suppose that for a linear map T : X X , for every ρ X ,
T n ( ρ ) T ( ρ ) 1 0 ( n )
holds. Then T is CPTP.
Proof. Step 1 (trace preservation): 
The trace functional is continuous with respect to · 1 , and concretely, for any A X ,
| Tr ( A ) | A 1
holds. Therefore, for any ρ X ,
Tr ( T ( ρ ) ) = lim n Tr ( T n ( ρ ) ) = lim n Tr ( ρ ) = Tr ( ρ ) ,
so T is trace-preserving.
Step 2 (complete positivity: amplification to matrix levels): Fix an arbitrary k N and set X k : = T 1 ( C k H ) . Since T n is CPTP, for each n,
T ˜ n : = id k T n : X k X k
preserves positivity.
Now, any Z X k can be written using the matrix units { E i j } i , j = 1 k as
Z = i , j = 1 k E i j Z i j ( Z i j X )
(a finite sum since k is finite). Then
T ˜ n ( Z ) T ˜ ( Z ) = i , j = 1 k E i j T n ( Z i j ) T ( Z i j ) , T ˜ : = id k T .
Using the triangle inequality and the basic estimate for the tensor product in the trace norm,
E i j A 1 = E i j 1 A 1 = A 1 ( A X ) ,
we obtain
T ˜ n ( Z ) T ˜ ( Z ) 1 i , j = 1 k T n ( Z i j ) T ( Z i j ) 1 0 ( n ) ,
since the assumed convergence holds for each Z i j and the sum is finite (so we may interchange limit and sum).
Step 3 (closedness of the positive cone): The positive cone of X k , X k , + : = { Z X k : Z 0 } , is closed with respect to · 1 . Indeed, if A n A 1 0 , then A n A A n A 1 0 implies convergence also in operator norm. Since the positive cone is closed in operator norm, A n 0 implies A 0 .
Step 4 (conclusion of complete positivity): Take an arbitrary Z X k , + . Then T ˜ n ( Z ) 0 holds for all n (positivity preservation of T ˜ n ). By Step 2, T ˜ n ( Z ) T ˜ ( Z ) 1 0 , so Step 3 (closedness) implies T ˜ ( Z ) 0 . Hence T ˜ = id k T preserves positivity. Since k was arbitrary, T is completely positive.
Together with Step 1, T is CPTP. □
(4)
Main theorem (existence of the component semigroups)
Theorem 2 (Existence of component semigroups (CPTP)).
Under the input contract (UEE analytic datum) of this paper, the following hold.
1.
The reversible component L 0 = i [ D , · ] yields a strongly continuous CPTP group { T 0 ( t ) } t R on X.
2.
The dissipative component L Δ yields a strongly continuous CPTP semigroup { T Δ ( t ) } t 0 on X.
3.
The transport (resonance) component R yields a strongly continuous CPTP semigroup { T R ( t ) } t 0 on X.
Proof. 
(1) has been established in §1.2 (CPTP property and strong continuity of unitary conjugation by a self-adjoint D). (2) and (3) are proved in subsequent sections based on the GKLS construction of the dissipative generator and the predual construction of the transport semigroup, respectively. In this subsection, we fix the claims as a list of the main results, and delegate the proofs to the subsequent sections (dissipative part: §4, transport part: §5). □
(5)
Main theorem (total generation: generation of L tot by CPTP componentwise composition)
Theorem 3 
(Total generation (generation of L tot by CPTP componentwise composition)). Using the component semigroups { T 0 ( t ) } , { T Δ ( t ) } , and { T R ( t ) } , define F ( t ) and T ( n ) ( t ) as in (2). If the common-core condition (tangency condition on a dense subspace) holds, then the following hold.
1.
For any t 0 and ρ X , the limit
T ( t ) [ ρ ] : = lim n T ( n ) ( t ) ρ
exists in · 1 , and { T ( t ) } t 0 is a strongly continuous semigroup.
2.
{ T ( t ) } t 0 is CPTP.
3.
The generator of this semigroup coincides with the closure L tot ¯ of L tot = L 0 + L Δ + R .
Proof. 
(1) and (3) are proved in subsequent sections using product formulas (Chernoff/Trotter type) and the common-core condition (existence and identification of the generator). In this subsection, we show that (2) (CPTP property) follows automatically from the closure lemmas alone.
Proof of (2) (CPTP property): For each t 0 and n N , T 0 ( t / n ) , T Δ ( t / n ) , and T R ( t / n ) are CPTP (Theorem 2). Hence, by Lemma 5, F ( t / n ) is CPTP, and furthermore T ( n ) ( t ) = ( F ( t / n ) ) n is also CPTP (finite composition of CPTP maps). By assumption, T ( n ) ( t ) ρ T ( t ) [ ρ ] holds for every ρ X , so applying Lemma 6 yields that T ( t ) is CPTP. This proves (2). □
(6)
Immediate corollaries: well-posedness of the UEE and invariance of the state set
Theorem 4 (Invariance of the state set (preservation of positivity and normalization)).
Under Theorem 3, for any initial state ρ 0 S ( M ) , if we set
ρ ( t ) : = T ( t ) [ ρ 0 ] ,
then ρ ( t ) S ( M ) holds for every t 0 . That is,
ρ ( t ) 0 , ρ ( t ) ( 1 ) = 1 ( in the standard realization , Tr ρ ( t ) = 1 )
is preserved for all times.
Proof. 
T ( t ) is CPTP (Theorem 3-(2)). Hence, by definition, if ρ 0 0 then T ( t ) [ ρ 0 ] 0 holds (positivity preservation). Moreover, by trace preservation (or preservation of ρ ( 1 ) ),
ρ ( t ) ( 1 ) = ( T ( t ) [ ρ 0 ] ) ( 1 ) = ρ 0 ( 1 ) = 1 .
Therefore ρ ( t ) S ( M ) . □
Preprints 193851 i003

1.4. Roadmap of the Paper Structure

(1)
Aim of this subsection: uniquely fixing the “flow of proofs” of the paper and excluding circular dependencies
In this subsection, we fix the structure of the main text as a one-way proof chain of “Definition → Lemma → Theorem → Main Theorem.” The requirements for a foundational analytical paper are summarized in the following two points:
1.
All symbols and objects used thereafter (spaces, maps, generators, and solution concepts) must be defined before they are used (priority of definitions).
2.
The dependency structure leading to the main theorem (well-posedness and state invariance) must not be circular (acyclicity of logical dependencies).
This subsection divides the main text so as to satisfy these requirements and makes explicit the role (responsibility) of each section.
(2)
Formalization of the responsibilities of each section (Section-Contract)
Hereafter, we take the core sections needed for the main part of this paper (the proof of the main theorem) to be § 2 through § 6 , and assign everything else to “organization and conclusion.” The responsibilities of each section are as follows.
Definition 6 (Paper structure (section responsibilities)).
The paper structure is given as a correspondence between a section number k and the “deliverables to be proved,”
C : { 2 , 3 , 4 , 5 , 6 , 7 } P ( Statements ) ,
and is required to satisfy the following.
  • § 2 (specification of common standards): Specify thetypesof the observable algebra M and the predual M * , the set of normal states S ( M ) , the definition of CPTP (including the Heisenberg/Schrödinger correspondence), and the UEE analytic datum D = ( M , M * , D , L Δ , R ) .
  • § 3 (semigroup-theoretic tools): Establish, as theorems within this paper, C 0 -semigroups and generators, definitions of mild/strong solutions, basic lemmas on contractivity and strong continuity, and product formulas (Chernoff/Trotter type).
  • § 4 (dissipative part L Δ ): Define L Δ in GKLS form (the specification of this paper), and prove that it generates a strongly continuous CPTP semigroup T Δ ( t ) = e t L Δ .
  • § 5 (transport/resonance part R): Define R as the generator of a CPTP semigroup T R ( t ) (e.g., construct it as the predual of a normal -*automorphism group), and prove that T R ( t ) is a strongly continuous CPTP semigroup.
  • § 6 (generation of the total generator: componentwise composition): Using
    F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) , T ( n ) ( t ) : = F ( t / n ) n ,
    after establishing a tangency condition on an appropriate common core D M * , prove that
    T ( t ) [ ρ ] : = lim n T ( n ) ( t ) ρ
    yields a strongly continuous CPTP semigroup whose generator coincides with L tot ¯ , and prove the well-posedness of the UEE (existence, uniqueness, and state invariance).
  • § 7 (conclusion): Conclude by clearly separating what has been established in this paper from what is not claimed (out of scope).
(3)
Formalization of logical dependencies: dependency graph and acyclicity
Assuming the section responsibilities are fulfilled, we formalize and show that the dependency structure of the main text is non-circular.
Definition 7 (Section dependency graph).
Let the vertex set be the set of section numbers V : = { 2 , 3 , 4 , 5 , 6 , 7 } . Define a directed edge ( i j ) to mean that “the proof in § j needs to refer to definitions, lemmas, or theorems in § i .” The resulting directed graph G : = ( V , E ) is called the section dependency graph.
Lemma 7 (Acyclicity of the section dependency graph (top-down order)).
Construct the paper according to Definition 6, and allow references only “from smaller section numbers to larger section numbers” (i.e., if ( i j ) E then i < j ). Then the section dependency graph G has no directed cycle (it is a DAG).
Proof. 
We argue by contradiction. Assume that G has a directed cycle, and let
v 1 v 2 v m v 1 ( m 1 )
be a directed cycle. By the assumption, for each edge v v + 1 (with v m + 1 : = v 1 ), we have v < v + 1 . Hence
v 1 < v 2 < < v m < v m + 1 = v 1 ,
which contains v 1 < v 1 , a contradiction. Therefore G has no directed cycle. □
(4)
The unique path to the main theorem: section responsibilities imply the main results (logical consequence)
The main results of this paper (the main theorem set listed in § 1 . 3 ) follow logically from the fact that each section satisfies the responsibilities in Definition 6. Here we fix, in the form of a proof, “what is needed where.”
Theorem 5 (Satisfying the roadmap implies the main results).
Assume that all responsibilities in Definition 6 are satisfied for § 2 through § 6 . Then all of the main results listed in this paper hold: (i) existence of the component semigroups (reversible, dissipative, transport), (ii) generation of the total semigroup by componentwise composition and identification of the generator, and (iii) invariance of the state set (preservation of positivity and normalization).
Proof. 
We derive the conclusion by using responsibilities (i)–(v) in order.
Step 1. 
(Fixing of objects) By responsibility (i), the state space M * , the state set S ( M ) , the definition of CPTP, and the UEE analytic datum D are fixed. Hence the stage and types of all subsequent discussions are determined.
Step 2. 
(Establishing the component semigroups) By responsibilities (iii) and (iv), T Δ ( t ) and T R ( t ) are constructed as strongly continuous CPTP semigroups. Moreover, by responsibility (ii) together with the reversible-part discussion established in § 1 . 2 , T 0 ( t ) is given as a strongly continuous CPTP group. Hence (i) existence of the component semigroups holds.
Step 3. 
(Setting up the composite approximation) By responsibility (v), F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) and T ( n ) ( t ) = ( F ( t / n ) ) n are defined, and a tangency condition on a common core D is established.
Step 4. 
(Existence of the limit semigroup and identification of the generator via a product formula) By responsibility (ii), a product formula (Chernoff/Trotter type) has been established as a theorem within this paper. Applying it to the tangency condition in Step 3 yields that the limit
T ( t ) [ ρ ] : = lim n T ( n ) ( t ) ρ
exists for every ρ M * , that { T ( t ) } t 0 forms a strongly continuous semigroup, and that its generator coincides with L tot ¯ . Hence (ii) total semigroup generation by componentwise composition and identification of the generator hold.
Step 5. 
(CPTP property and state invariance) Since each of T 0 ( t ) , T Δ ( t ) , and T R ( t ) is CPTP, T ( n ) ( t ) is CPTP for every n (by closure of CPTP under composition). Moreover, by the strong convergence in Step 4, T ( n ) ( t ) ρ T ( t ) [ ρ ] holds, so by closure of CPTP under strong limits, T ( t ) is also CPTP. Therefore, for any initial state ρ 0 S ( M ) , ρ ( t ) : = T ( t ) [ ρ 0 ] preserves positivity and normalization for all t 0 , and the state set is invariant. Hence (iii) holds.
This completes the proof. □
(5)
Conclusion of this subsection: the main text is assembled as an “acyclic proof chain”
By Definition 6, the responsibilities of each section have been made explicit, and by Lemma 7, circular dependencies have been excluded. Theorem 5 shows that, if this roadmap is satisfied, the main results follow logically. In the subsequent sections, we will construct concrete definitions, lemmas, and theorems along the roadmap of this subsection and complete the main results.
Preprints 193851 i004

2. Specification Freeze: Common Standards and Assumptions

2.1. Notation and Conventions

(1)
Aim of this subsection: declare the common “convention set” shared across all chapters, and follow it unless otherwise specified in each chapter/section
In this subsection, we explicitly declare, as a convention set, the notation and conventions on which all definitions, lemmas, and theorems of this paper rely, and, unless otherwise specified in each chapter/section, we follow the convention set of this subsection. The requirements for a foundational analytical paper are: (i) eliminating ambiguity of symbols (in particular, collisions of R), (ii) not leaving ambiguous the types of operators (which spaces they act on), and (iii) fixing within the paper, in a self-contained manner, the conventions for physics (spacetime, dimensions, signs) and for analysis (Banach spaces, duality, adjoints).
(2)
Definition of the convention set C (the “reference point” of this paper)
Definition 8 (Convention set C (Notation and Conventions)).
The convention set C used in this paper is the totality of the following items.
1.
Spacetime, metric, and signature: Fix the spacetime dimension d, the signature convention of the Lorentz metric g μ ν , and the relation between a local orthonormal basis (vierbein/tetrad) and the Minkowski metric η a b .
2.
Index conventions: Fix the kinds and ranges of indices (Greek indices for coordinate systems, Latin indices for tangent spaces, etc.), the meaning of upper/lower indices, and Einstein’s summation convention.
3.
Basic notations in differential geometry: Fix the symbols for the Levi–Civita connection μ , volume elements, hypersurface area elements, the Levi–Civita tensor, and the Hodge dual ★.
4.
Unit system: Adopt natural units and fix the notation for dimensional analysis (mass dimension).
5.
Operators, adjoints, and norms: Fix the Hilbert space H , bounded operators B ( H ) , trace class T 1 ( H ) , commutators [ · , · ] , anticommutators { · , · } , adjoints †, and the norms used. Furthermore, in this paper, the action of linear maps (superoperators) is in principle denoted by square brackets [ · ] (e.g., R [ ρ ] , T R ( t ) [ ρ ] , T R * ( t ) [ A ] ), and we do not confuse the adjoint † (operator adjoint on a Hilbert space) with the dual * (Banach dual / Heisenberg image).
6.
Pictures (Heisenberg/Schrödinger) and duality: Fix the notation for observable maps and state maps (preduals).
7.
Reserved symbols (collision avoidance): In this paper, the resonance kernel (generator) is denoted by R. Geometric curvature quantities such as the scalar curvature are written as R sc (or Riem , etc.) and are not confused with R. Moreover, Φ is reserved for themaster scalar, and other objects such as information-flux vectors are denoted by different symbols (e.g., J μ ).
(3)
Spacetime, metric, and indices: signature and raising/lowering conventions
Definition 9 (Coordinates, metric, and signature).
Let M be a smooth d-dimensional manifold (in physical applications, d = 4 ), and let g μ ν be a C Lorentz metric. Write local coordinates as x μ = ( x 0 , x 1 , , x d 1 ) . In this paper, unless otherwise specified in each chapter/section, we adopt as the metric signature
g μ ν = diag ( , + , , + ) ( mostly plus ) .
We write the inverse matrix as g μ ν , satisfying g μ α g α ν = δ μ ν .
Definition 10 (Types and ranges of indices).
1.
Greek indices μ , ν , ρ , are coordinate indices, with μ { 0 , 1 , , d 1 } .
2.
Latin indices a , b , c , are tangent-space (local orthonormal basis) indices, with a { 0 , 1 , , d 1 } .
3.
The Minkowski metric η a b is, unless otherwise specified in each chapter/section,
η a b = diag ( , + , , + ) ,
and the metric is defined by the vierbein (tetrad) e a μ as
g μ ν = e a μ e b ν η a b
(used only when necessary).
4.
Einstein summation convention: When the same symbol appears once as an upper index and once as a lower index, summation is taken over that index.
Lemma 8 (Consistency of raising and lowering conventions).
Under Definition 9, for a vector V μ , define V ν : = g ν μ V μ , and further V μ : = g μ ν V ν . Then
V μ = V μ
holds. Similarly, for a covector W μ , define W μ : = g μ ν W ν , and further W μ : = g μ ν W ν . Then W μ = W μ holds.
Proof. 
By Definition 9, g μ α g α ν = δ μ ν holds. Hence
V μ = g μ ν V ν = g μ ν g ν ρ V ρ = δ μ ρ V ρ = V μ .
Similarly,
W μ = g μ ν W ν = g μ ν g ν ρ W ρ = δ μ ρ W ρ = W μ .
Lemma 9 (Uniqueness of contraction (Einstein summation)).
When the same symbol appears as a paired upper and lower index, the contraction (summation) is uniquely determined and does not depend on the naming of dummy indices.
Proof. 
As an example, consider V μ W μ . By Definition 10,
V μ W μ : = μ = 0 d 1 V μ W μ .
Here the index μ is a dummy variable, so for any other symbol ν ,
μ = 0 d 1 V μ W μ = ν = 0 d 1 V ν W ν
holds (a mere change of variable name). Hence the contraction is unique. General multiple contractions are shown similarly by renaming dummy indices. □
(4)
Basic notations in differential geometry: connection, volume elements, and the Levi–Civita tensor
Definition 11 (Levi–Civita connection and covariant derivative).
We write by μ the Levi–Civita connection associated with g μ ν . That is, μ is the connection that is (in the standard sense) (i) torsion-free and (ii) metric-compatible, λ g μ ν = 0 .
Definition 12 (Volume element and hypersurface element).
Let g : = det ( g μ ν ) and set | g | : = | det ( g μ ν ) | .
1.
Define the d-dimensional volume element by
d V : = d d x | g | .
2.
Take a smooth codimension-1 hypersurface Σ M with local coordinates ξ i ( i = 1 , , d 1 ) , and let the induced metric be h i j with determinant h : = det ( h i j ) . Then define the area element by
d Σ : = d d 1 ξ h .
Definition 13 
(Levi–Civita tensor and Hodge dual).
1.
Define the totally antisymmetric tensor density ε μ 1 μ d by
ε 0 1 d 1 : = + | g | ,
and perform raising/lowering of indices by g μ ν , g μ ν according to Definition 9.
2.
The Hodge dual : Λ p ( M ) Λ d p ( M ) is defined in the usual way by ε μ 1 μ d and g μ ν .
(5)
Unit system and notation of dimensional analysis (natural units)
Definition 14 
(Natural units and mass dimension). In this paper we adopt natural units and set
= c = 1
(and when temperature is treated, we also use k B = 1 as needed). We write the mass dimension of a physical quantity X as [ X ] R , and interpret
[ X ] = m X has dimension of ( mass ) m .
Lemma 10 (Basic dimensions in natural units).
Under Definition 14, the mass dimensions of the coordinate x μ and the differential operator μ are
[ x μ ] = 1 , [ μ ] = + 1 .
Moreover, time and length have the same dimension.
Proof. 
First, since c = 1 , the dimension [ c ] = [ length ] / [ time ] becomes dimensionless, hence
[ length ] = [ time ] .
Next, since = 1 , the dimension [ ] = [ energy ] · [ time ] becomes dimensionless. In natural units, energy and mass have the same dimension ( c = 1 ), so we may set [ energy ] = [ mass ] = + 1 . Therefore,
[ time ] = [ energy ] = 1 .
Hence [ length ] = [ time ] = 1 . Since the coordinate x μ has the dimension of time or length, [ x μ ] = 1 . Finally, since μ = / x μ ,
[ μ ] = [ x μ ] = + 1
follows. □
(6)
Operators, adjoints, and norms: basic notations used in analysis
This paper mainly uses the standard realization M = B ( H ) and M * = T 1 ( H ) . Here we declare the notations required for analysis.
Definition 15 (Operator notations (commutator, anticommutator, adjoint)).
Let H be a complex Hilbert space.
1.
We write the set of all bounded operators as B ( H ) , and denote the adjoint by A (or A * ).
2.
We write the set of all trace-class operators as T 1 ( H ) , and denote the trace by Tr .
3.
We define the commutator and anticommutator by
[ A , B ] : = A B B A , { A , B } : = A B + B A .
4.
We denote the operator norm of a bounded operator by A , and the trace norm by ρ 1 : = Tr ( | ρ | ) .
Lemma 11  (Basic estimate for trace duality).
For A B ( H ) and ρ T 1 ( H ) ,
| Tr ( ρ A ) | ρ 1 A
holds. Hence the map
ρ , A : = Tr ( ρ A )
is a continuous bilinear form on T 1 ( H ) × B ( H ) .
Proof. 
By singular-value decomposition of ρ ,
ρ = k = 1 s k | ψ k ϕ k | ( s k 0 , k = 1 s k = ρ 1 )
(with { ψ k } , { ϕ k } orthonormal systems). Then
Tr ( ρ A ) = k = 1 s k Tr | ψ k ϕ k | A = k = 1 s k ϕ k , A ψ k .
By Cauchy–Schwarz and boundedness, | ϕ k , A ψ k | A ϕ k ψ k = A . Therefore, by the triangle inequality,
| Tr ( ρ A ) | k = 1 s k | ϕ k , A ψ k | k = 1 s k A = A ρ 1 .
(7)
Pictures and duality: observable maps and state maps (preduals)
Definition 16 (Correspondence between observables (Heisenberg) and states (Schrödinger)).
Let M be a von Neumann algebra and M * its predual.
1.
Observable map: Let α : M M be (at least) a normal linear map.
2.
State map (predual): Define α * by
( α * ρ ) ( A ) : = ρ ( α ( A ) ) ( ρ M * , A M ) .
We regard this as the time-evolution map in the Schrödinger picture.
3.
Time evolution: For an observable-side semigroup (or group) { α t } , write the state-side semigroup as { T ( t ) } and set
T ( t ) : = ( α t ) * .
(8)
Conclusion of this subsection: the convention set C has been declared
In this subsection, we collectively declared spacetime, metric, indices, differential geometry, unit system, operator notations, and picture duality by Definition 8, and explicitly stated that, unless otherwise specified in each chapter/section, we follow the convention set of this subsection. In particular, we adopted the mostly-plus signature as the default convention (Definition 9), and clarified reserved-symbol conventions to avoid collisions between geometric curvature (such as scalar curvature) and the resonance kernel R. We also proved within the paper the consistency of raising/lowering (Lemma 8), uniqueness of Einstein summation (Lemma 9), dimensional relations in natural units (Lemma 10), and the basic estimate for trace duality (Lemma 11), thereby eliminating the need for external references in subsequent proofs.
Preprints 193851 i005

2.2. Operator Algebra and State Space

(1)
Aim of this subsection: fixing observables (operator algebra) and states (predual) within a single type system
In this subsection, we fix the “observables” and “states” treated in this paper so that no type confusion occurs in subsequent sections. Unless otherwise specified in each chapter/section, we follow the type system fixed in this subsection. As a foundational analytical paper, this paper treats states as “positive elements of the predual M * of a von Neumann algebra M ,” and, when adopting the standard realization M = B ( H ) , concretizes M * as T 1 ( H ) (trace class). Within this framework,
observables : A M , states : ρ M * , expectation : ρ ( A )
are defined as a single dual pairing, and the time evolution of the UEE (Schrödinger picture) is consistently formulated as a map on M * .
(2)
Observable algebra: von Neumann algebra and predual (abstract specification)
Definition 17 (von Neumann algebra and predual (abstract specification of the state space)).
Let M be a von Neumann algebra realized as operators on a complex Hilbert space, and let M * be its predual. That is:
1.
M is a -*algebra with unit 1 and is closed in an appropriate topology (equivalently, in the weak operator topology).
2.
M * is a Banach space, and M is isomorphic to its dual Banach space:
M ( M * ) * .
3.
We write the evaluation (dual pairing) of ρ M * on A M as
ρ , A : = ρ ( A ) .
Definition 18 (Positive functionals and normal states (abstract state space)).
A functional ρ M * is said to bepositiveif ρ ( A ) 0 holds for every positive operator A M ( A 0 ). We write the set of all positive elements as M * , + . Moreover,
S ( M ) : = { ρ M * , + : ρ ( 1 ) = 1 }
is called the set of (normal) states.
Lemma 12 (Convexity of the state set).
S ( M ) is a convex set. That is, for ρ 1 , ρ 2 S ( M ) and λ [ 0 , 1 ] , ρ λ : = λ ρ 1 + ( 1 λ ) ρ 2 belongs to S ( M ) .
Proof. 
For any A 0 , since ρ 1 ( A ) 0 and ρ 2 ( A ) 0 ,
ρ λ ( A ) = λ ρ 1 ( A ) + ( 1 λ ) ρ 2 ( A ) 0 .
Hence ρ λ M * , + . Also,
ρ λ ( 1 ) = λ ρ 1 ( 1 ) + ( 1 λ ) ρ 2 ( 1 ) = λ · 1 + ( 1 λ ) · 1 = 1 .
Therefore ρ λ S ( M ) . □
(3)
Standard realization: B ( H ) and the trace class T 1 ( H )
In the subsequent analysis (in particular, construction and composition of CPTP semigroups), we mainly use the standard realization
M = B ( H ) .
Accordingly, as a specification of this paper, we give the predual by the trace class.
Definition 19 (Bounded operators and finite-rank operators).
Let H be a complex Hilbert space, and let B ( H ) be the set of all bounded linear operators on H . We write the set of all finite-rank operators as F ( H ) . For ψ , ϕ H , define the rank-one operator by
| ψ ϕ | : H H , ( | ψ ϕ | ) ξ : = ψ ϕ , ξ .
Lemma 13 (Basic identities for rank-one operators).
Let ψ , ϕ , ψ , ϕ H .
1.
| ψ ϕ | = | ϕ ψ | .
2.
| ψ ϕ | | ψ ϕ | = ϕ , ψ | ψ ϕ | .
3.
| ψ ϕ | = ψ ϕ (operator norm).
Proof. 
(1) For any ξ , η H ,
( | ψ ϕ | ) ξ , η = ψ ϕ , ξ , η = ϕ , ξ ψ , η = ξ , ϕ ψ , η = ξ , ( | ϕ ψ | ) η .
Hence the adjoint is | ϕ ψ | .
(2) For any ξ H ,
| ψ ϕ | | ψ ϕ | ξ = | ψ ϕ | ψ ϕ , ξ = ψ ϕ , ψ ϕ , ξ = ϕ , ψ | ψ ϕ | ξ .
(3) For any ξ H ,
( | ψ ϕ | ) ξ = ψ ϕ , ξ = ψ | ϕ , ξ | ψ ϕ ξ ,
so | ψ ϕ | ψ ϕ . On the other hand, if ϕ 0 , taking ξ : = ϕ / ϕ yields
( | ψ ϕ | ) ξ = ψ | ϕ , ϕ / ϕ | = ψ ϕ ,
so the upper bound is attained. If ϕ = 0 , both sides are 0. Hence equality holds. □
Definition 20 (Trace (on finite rank)).
For finite-rank operators, define the trace Tr : F ( H ) C as follows.
1.
For rank one,
Tr | ψ ϕ | : = ϕ , ψ .
2.
Extend linearly to a general finite-rank operator F = k = 1 N | ψ k ϕ k | :
Tr ( F ) : = k = 1 N ϕ k , ψ k .
Lemma 14 (Representation-independence of the trace).
The trace Tr defined by Definition 20 does not depend on the choice of a decomposition F = k | ψ k ϕ k | of a finite-rank operator.
Proof. 
It suffices to show that Tr on F ( H ) coincides with the “basis definition.” Since the range Ran ( F ) of a finite-rank F is finite-dimensional, take a finite-dimensional subspace E H containing Ran ( F ) . Let { e 1 , , e m } be an orthonormal basis of E, and together with any orthonormal basis of E , construct an orthonormal basis { e j } j 1 of H . Then F e j = 0 holds for j > m , so
j 1 e j , F e j = j = 1 m e j , F e j
is a finite sum, and this value does not depend on the choice of basis (uniqueness of the trace in finite-dimensional linear algebra). On the other hand, for rank one,
j 1 e j , ( | ψ ϕ | ) e j = j 1 e j , ψ ϕ , e j = ϕ , j 1 | e j e j | ψ = ϕ , ψ
(using the orthogonal decomposition j | e j e j | = I ), which agrees with the value in Definition 20. Therefore the same holds for all finite-rank operators, and the trace is representation-independent. □
(4)
Trace norm and trace class: construction as a specification of this paper (completeness ensured by definition)
Definition 21 (Trace norm (on finite rank)).
For a finite-rank operator F F ( H ) , define the trace norm · 1 by
F 1 : = sup | Tr ( F A ) | : A B ( H ) , A 1 .
Lemma 15 (Basic properties of the trace norm (finite rank)).
By Definition 21, · 1 is a norm on F ( H ) . Moreover, for any F F ( H ) ,
| Tr ( F ) | F 1
holds.
Proof. 
We verify the norm axioms in order.
(i) Nonnegativity: By definition, the supremum is nonnegative, hence F 1 0 .
(ii) Homogeneity: For any λ C ,
λ F 1 = sup A 1 | Tr ( λ F A ) | = | λ | sup A 1 | Tr ( F A ) | = | λ | F 1 .
(iii) Triangle inequality: For any F , G F ( H ) and A 1 ,
| Tr ( ( F + G ) A ) | | Tr ( F A ) | + | Tr ( G A ) | .
Taking the supremum over A 1 gives
F + G 1 F 1 + G 1 .
(iv) Separation: Assume F 1 = 0 . Then Tr ( F A ) = 0 for all A 1 . In particular, since a rank-one operator A = | ψ ϕ | satisfies A = ψ ϕ , letting ψ = ϕ = 1 so that A = 1 and ranging over all such operators yields
0 = Tr F | ψ ϕ | = Tr | F ψ ϕ | = ϕ , F ψ
for all unit vectors ψ , ϕ . Since ϕ is arbitrary, F ψ is orthogonal to all ϕ , hence F ψ = 0 for all ψ . Therefore F = 0 .
Finally, | Tr ( F ) | F 1 follows because in Definition 21 we may take A = 1 (with 1 = 1 ), so
| Tr ( F ) | = | Tr ( F 1 ) | sup A 1 | Tr ( F A ) | = F 1 .
Definition 22 (Trace class (concretization of the predual)).
Define the trace class T 1 ( H ) by
T 1 ( H ) : = the completion of F ( H ) , · 1 .
That is, T 1 ( H ) is a Banach space, and F ( H ) is dense with respect to · 1 .
Lemma 16 (Continuous extension of the trace).
The trace Tr : F ( H ) C is continuous with respect to · 1 and satisfies
| Tr ( F ) | F 1 ( F F ( H ) )
(Lemma 15). Therefore Tr extends uniquely and continuously to
Tr : T 1 ( H ) C
(denoted by the same symbol).
Proof. 
By the estimate | Tr ( F ) | F 1 shown in Lemma 15, Tr is · 1 -continuous. Hence, by the standard extension theorem to Banach completions, it extends uniquely and continuously to the completion T 1 ( H ) . □
(5)
Ideal property (stability under two-sided multiplication): an estimate essential for subsequent dynamical semigroups
Lemma 17 (Stability and estimate under two-sided multiplication).
For any A , B B ( H ) and any ρ T 1 ( H ) , A ρ B T 1 ( H ) holds, and moreover,
A ρ B 1 A ρ 1 B
holds.
Proof. 
Step 1 (estimate for finite rank): First assume ρ F ( H ) . By Definition 21,
A ρ B 1 = sup X 1 | Tr ( A ρ B X ) | .
For X 1 , set Y : = B X A ; then Y B X A A B . Since ρ is finite rank, Tr is defined, and
Tr ( A ρ B X ) = Tr ( ρ B X A ) = Tr ( ρ Y )
(the cyclicity for finite rank follows immediately from the basis representation in Lemma 14). Hence
| Tr ( A ρ B X ) | = | Tr ( ρ Y ) | ρ 1 Y ρ 1 A B
(by the supremum property in Definition 21). Taking the supremum over X 1 yields
A ρ B 1 A ρ 1 B .
Moreover, since A ρ B is finite rank, A ρ B F ( H ) T 1 ( H ) .
Step 2 (extension to general ρ T 1 ): By Definition 22, there exists a sequence ρ n F ( H ) such that ρ n ρ 1 0 . By the estimate in Step 1,
A ( ρ n ρ m ) B 1 A ρ n ρ m 1 B ,
so { A ρ n B } is · 1 -Cauchy. Since T 1 ( H ) is complete, there exists σ T 1 ( H ) such that A ρ n B σ 1 0 . Define this σ to be A ρ B (the limit does not depend on the choice of ρ n , which follows by the same estimate). Finally, taking n in the inequality of Step 1 yields
A ρ B 1 = lim n A ρ n B 1 lim n A ρ n 1 B = A ρ 1 B
(by continuity of · 1 ). □
(6)
Concrete form of the state space: density operators and expectations (standard realization)
Definition 23 (Positive operators and density operators (standard realization)).
A trace-class operator ρ T 1 ( H ) is said to be positive ( ρ 0 ) if ψ , ρ ψ 0 holds for all ψ H . We call
S ( H ) : = { ρ T 1 ( H ) : ρ 0 , Tr ( ρ ) = 1 }
the set of density operators.
Lemma 18 (Basic properties of density operators: convexity and closedness).
S ( H ) is a convex subset of T 1 ( H ) and is closed with respect to · 1 .
Proof. 
(i) Convexity: Take ρ 1 , ρ 2 S ( H ) and λ [ 0 , 1 ] . For any ψ H ,
ψ , ( λ ρ 1 + ( 1 λ ) ρ 2 ) ψ = λ ψ , ρ 1 ψ + ( 1 λ ) ψ , ρ 2 ψ 0 ,
so λ ρ 1 + ( 1 λ ) ρ 2 0 . Also, by linearity of the trace,
Tr ( λ ρ 1 + ( 1 λ ) ρ 2 ) = λ Tr ( ρ 1 ) + ( 1 λ ) Tr ( ρ 2 ) = λ · 1 + ( 1 λ ) · 1 = 1 .
Hence λ ρ 1 + ( 1 λ ) ρ 2 S ( H ) .
(ii) Closedness: Let ρ n S ( H ) and assume ρ n ρ 1 0 . First, since Tr is continuous (Lemma 16),
Tr ( ρ ) = lim n Tr ( ρ n ) = lim n 1 = 1 .
Next, for any ψ H , using the operator-norm estimate X X 1 (which holds in general),
| ψ , ( ρ n ρ ) ψ | ρ n ρ ψ 2 ρ n ρ 1 ψ 2 0 .
Therefore,
ψ , ρ ψ = lim n ψ , ρ n ψ 0
(since each ρ n 0 ) holds for all ψ , so ρ 0 . Hence ρ S ( H ) . □
Definition 24 (Expectation value (pairing of state and observable: standard realization)).
For ρ T 1 ( H ) and A B ( H ) , define the expectation value (dual pairing) by
A ρ : = Tr ( ρ A ) .
Lemma 19 (Basic estimate and positivity of expectations).
For any ρ T 1 ( H ) and A B ( H ) ,
| Tr ( ρ A ) | ρ 1 A
holds. Moreover, if ρ 0 and A 0 , then Tr ( ρ A ) 0 .
Proof. 
The inequality coincides with Lemma 11 (the trace-duality estimate established in the previous subsection). We prove positivity. If A 0 , then A 1 / 2 exists, and by Lemma 17, A 1 / 2 ρ A 1 / 2 T 1 ( H ) . By finite-rank approximation and Lemma 16,
Tr ( ρ A ) = Tr ( A 1 / 2 ρ A 1 / 2 ) .
For any ψ H ,
ψ , ( A 1 / 2 ρ A 1 / 2 ) ψ = A 1 / 2 ψ , ρ A 1 / 2 ψ 0
(since ρ 0 ), hence A 1 / 2 ρ A 1 / 2 0 . For a positive operator X T 1 ( H ) , Tr ( X ) 0 follows immediately from the eigenvalue-sum representation for finite-rank positive operators, and then for general X by continuous extension. Therefore Tr ( ρ A ) = Tr ( A 1 / 2 ρ A 1 / 2 ) 0 . □
(7)
Identity of states: equality of density operators can be decided by expectations
Lemma 20 (Separation of states by observables (standard realization)).
If ρ 1 , ρ 2 T 1 ( H ) satisfy
Tr ( ρ 1 A ) = Tr ( ρ 2 A ) ( A B ( H ) ) ,
then ρ 1 = ρ 2 .
Proof. 
Let σ : = ρ 1 ρ 2 . The assumption is Tr ( σ A ) = 0 for all A B ( H ) . For arbitrary ψ , ϕ H , take A : = | ψ ϕ | B ( H ) . Then by the definition of the trace,
0 = Tr σ | ψ ϕ | = Tr | σ ψ ϕ | = ϕ , σ ψ .
Since ϕ is arbitrary, σ ψ = 0 . Since ψ is also arbitrary, σ = 0 , i.e., ρ 1 = ρ 2 . □
(8)
Conclusion of this subsection: the types of observables and states ( M and M * ) have been fixed
In this subsection, we fixed the observable algebra M and the state space M * as a predual (Definition 17), and defined the state set abstractly as S ( M ) (Definition 18). Moreover, in the standard realization M = B ( H ) , we concretized the predual as the trace class T 1 ( H ) (Definition 22), and established within the paper the stability and basic estimate under two-sided multiplication (Lemma 17), the convexity and closedness of the density-operator set S ( H ) (Lemma 18), the estimate and positivity of expectations (Lemma 19), and separation of states by expectations (Lemma 20). This completes the preparation for constructing the time evolution of the UEE as a CPTP semigroup on M * .
Preprints 193851 i006

2.3. Definition of CPTP and Equivalence Between Pictures

(1)
Aim of this subsection: define physically admissible time evolution as “CPTP” and prove the Heisenberg/Schrödinger equivalence
In this paper, the time evolution of states (Schrödinger picture) is constructed as a semigroup
T : M * M *
and physical admissibility is formulated as complete positivity (CP) and trace preservation (TP). On the other hand, the time evolution of observables (Heisenberg picture) is described as
α : M M ,
and physical admissibility is formulated as unitality and complete positivity (CP).
The aim of this subsection is to establish, in a closed form within this paper, the following standard equivalence between these two pictures:
α is ( normal ) unital - CP α * is CPTP ,
where α * denotes the passage to the predual (state side). Unless otherwise specified in each chapter/section, we adopt the definitions and equivalences given in this subsection as the standard henceforth. Since subsequent sections will perform “CPTP componentwise composition,” this subsection provides the definition of CPTP and a complete proof of the equivalence between pictures as the reference point.
(2)
σ -weak topology and normality: definition based on the predual
This paper takes as the main stage the standard realization M = B ( H ) and M * = T 1 ( H ) (consistently with the constructions up to the previous subsection). In this case, the σ -weak topology is the weak* topology induced by the predual T 1 ( H ) .
Definition 25 ( σ -weak convergence and normal maps).
Let H be a complex Hilbert space, and set M = B ( H ) and M * = T 1 ( H ) .
1.
A sequence (more generally, a net) of operators { A i } B ( H ) is said to converge  σ -weakly to A B ( H ) if for every ρ T 1 ( H ) ,
Tr ( ρ A i ) Tr ( ρ A )
holds. We write this as A i σ - weak A .
2.
A linear map α : B ( H ) B ( H ) is said to be normal if it is continuous with respect to the σ-weak topology, i.e.,
A i σ - weak A α ( A i ) σ - weak α ( A )
holds.
(3)
Complete positivity (CP) and CPTP: two-sided definitions for observable maps and state maps
We first define “positivity” and “complete positivity” on both pictures.
Definition 26 (Positivity, complete positivity (CP), unitality, and trace preservation).
Let H be a complex Hilbert space, and take B ( H ) and T 1 ( H ) as the observable/state spaces in the standard realization.
1.
(Observable side: Heisenberg) For a linear map α : B ( H ) B ( H ) :
(a)
Positivity: A 0 α ( A ) 0 .
(b)
Complete positivity (CP): for every n N ,
Id n α : B ( C n H ) B ( C n H )
is positive.
(c)
Unitality: α ( I ) = I .
2.
(State side: Schrödinger) For a linear map T : T 1 ( H ) T 1 ( H ) :
(a)
Positivity: ρ 0 T ( ρ ) 0 (positivity in Definition 23).
(b)
Complete positivity (CP): for every n N ,
Id n T : T 1 ( C n H ) T 1 ( C n H )
is positive.
(c)
Trace preservation (TP): for every ρ T 1 ( H ) ,
Tr ( T ( ρ ) ) = Tr ( ρ )
holds.
(d)
CPTP: T is CP and TP.
To “test” complete positivity, we prepare a lemma characterizing positivity by trace duality.
Lemma 21 (Characterization of positivity by trace duality (observable side / state side)).
Let H be a complex Hilbert space.
1.
Let A B ( H ) be self-adjoint. Then
A 0 Tr ( ρ A ) 0 ( ρ T 1 ( H ) , ρ 0 ) .
2.
Let σ T 1 ( H ) be self-adjoint. Then
σ 0 Tr ( σ B ) 0 ( B B ( H ) , B 0 ) .
Proof. Proof of (1): 
(⇒)
Assume A 0 and take an arbitrary ρ 0 . Then A 1 / 2 exists, and ρ 1 / 2 A ρ 1 / 2 = ( A 1 / 2 ρ 1 / 2 ) ( A 1 / 2 ρ 1 / 2 ) 0 . Hence Tr ( ρ A ) = Tr ( ρ 1 / 2 A ρ 1 / 2 ) 0 .
(⇐)
Assume Tr ( ρ A ) 0 for every ρ 0 . For any ψ H , ρ : = | ψ ψ | T 1 ( H ) is positive, and
Tr ( ρ A ) = Tr ( | ψ ψ | A ) = ψ , A ψ 0 .
Thus ψ , A ψ 0 holds for all ψ , so A 0 .
Proof of (2): 
(⇒)
Assume σ 0 and take an arbitrary B 0 . Then B 1 / 2 exists and B 1 / 2 σ B 1 / 2 0 . Since the trace of a positive trace-class operator is nonnegative,
Tr ( σ B ) = Tr ( B 1 / 2 σ B 1 / 2 ) 0 .
(⇐)
Assume Tr ( σ B ) 0 for every B 0 . In particular, for arbitrary ψ take B : = | ψ ψ | 0 , and then
Tr ( σ | ψ ψ | ) = Tr ( | σ ψ ψ | ) = ψ , σ ψ 0 .
Hence ψ , σ ψ 0 holds for all ψ , and σ 0 .
(4)
Construction of the predual map (Heisenberg → Schrödinger)
Here we construct the state map α * from a normal map α and show its uniqueness.
Lemma 22 (A weak-*continuous linear functional is represented by a single evaluation).
Let X be a Banach space and X * its dual, endowed with the weak* topology σ ( X * , X ) . If a linear functional F : X * C is σ ( X * , X ) -continuous, then there exists x X such that
F ( φ ) = φ ( x ) ( φ X * ) .
Proof. 
Assume that F is σ ( X * , X ) -continuous. The weak* topology is generated by the family of seminorms p x ( φ ) : = | φ ( x ) | ( x X ) . By continuity of F, there exists a neighborhood U of 0 such that φ U | F ( φ ) | < 1 . By the definition of the generated topology, there exist finitely many x 1 , , x m X and ε > 0 such that
max 1 k m | φ ( x k ) | < ε | F ( φ ) | < 1 .
From this implication, for any φ satisfying φ ( x k ) = 0 ( k = 1 , , m ) , it follows that F ( φ ) = 0 (scaling by λ φ yields | F ( λ φ ) | < 1 for all λ > 0 , so by linearity F ( φ ) = 0 ). Hence
N : = { φ X * : φ ( x 1 ) = = φ ( x m ) = 0 } ker F .
Therefore F factors through the quotient space X * / N . On the other hand, the linear map
Θ : X * C m , Θ ( φ ) : = φ ( x 1 ) , , φ ( x m )
has kernel N, and Θ induces a linear isomorphism on X * / N (the image is finite-dimensional). Hence F can be written with some coefficients c 1 , , c m C as
F ( φ ) = k = 1 m c k φ ( x k ) = φ k = 1 m c k x k .
Setting x : = k = 1 m c k x k yields the claim. □
Lemma 23 (Existence and uniqueness of the predual (preadjoint) of a normal map).
Let α : B ( H ) B ( H ) be a bounded linear map and assume that it is normal (Definition 25). Then there exists a unique bounded linear map α * : T 1 ( H ) T 1 ( H ) such that, for all ρ T 1 ( H ) and A B ( H ) ,
Tr α * ( ρ ) A = Tr ρ α ( A )
holds. Moreover, α * 1 1 α .
Proof. 
Step 1 (fix ρ and construct a σ -weakly continuous functional): Fix an arbitrary ρ T 1 ( H ) and define
F ρ : B ( H ) C , F ρ ( A ) : = Tr ρ α ( A ) .
By Lemma 11,
| F ρ ( A ) | = | Tr ( ρ α ( A ) ) | ρ 1 α ( A ) ρ 1 α A ,
so F ρ is a bounded linear functional.
Step 2 ( σ -weak continuity of F ρ ): Assume A i σ - weak A . By normality in Definition 25, α ( A i ) σ - weak α ( A ) . Hence, by Definition 25,
Tr ρ α ( A i ) Tr ρ α ( A ) ,
i.e. F ρ ( A i ) F ρ ( A ) . Thus F ρ is σ -weakly continuous.
Step 3 (representation of a weak-*continuous functional):  B ( H ) is the dual space of T 1 ( H ) , and the σ -weak topology coincides with the weak* topology σ ( B ( H ) , T 1 ( H ) ) (Definition 25). Applying Lemma 22 with X : = T 1 ( H ) , the σ -weakly continuous functional F ρ obtained in Step 2 can be represented by a unique element α * ( ρ ) T 1 ( H ) as
F ρ ( A ) = Tr α * ( ρ ) A ( A B ( H ) ) .
This is exactly (2.3-∗).
Step 4 (linearity and boundedness): Since ρ F ρ is linear, uniqueness of the representation implies that ρ α * ( ρ ) is also linear. Moreover, by (2.3-∗) and Definition 21 (and its completion),
α * ( ρ ) 1 = sup A 1 Tr ( α * ( ρ ) A ) = sup A 1 Tr ( ρ α ( A ) ) sup A 1 ρ 1 α ( A ) ρ 1 α .
Hence α * 1 1 α . □
(5)
Main lemma: Heisenberg (UCP) ⟺ Schrödinger (CPTP)
We now fully prove, in the standard realization, the central proposition of this subsection (corresponding to Lemma 2.5 of the roadmap).
Lemma 24 (Equivalence of the Heisenberg–Schrödinger duality (UCP ⟺ CPTP)).
Let α : B ( H ) B ( H ) be a normal bounded linear map, and let α * : T 1 ( H ) T 1 ( H ) be its predual map determined by Lemma 23. Then the following are equivalent:
(H) 
α is unital and completely positive (unital-CP).
(S) 
α * is completely positive and trace-preserving (CPTP).
Proof. 
We prove equivalence by showing (H)⇒(S) and (S)⇒(H).
(H)⇒(S): Assume that α is unital-CP.
Step 1. (TP) For any ρ T 1 ( H ) , substituting A = I into (2.3-∗) yields
Tr ( α * ( ρ ) ) = Tr α * ( ρ ) I = Tr ρ α ( I ) .
By unitality, α ( I ) = I , hence
Tr ( α * ( ρ ) ) = Tr ( ρ ) .
Therefore α * is TP.
Step 2. (Preparation for CP: tensor-level predual and trace identification) Fix an arbitrary n N and set H ˜ : = C n H . Denote the traces on B ( H ˜ ) and T 1 ( H ˜ ) by Tr ˜ . Since α is CP, the map
Id n α : B ( H ˜ ) B ( H ˜ )
is positive. Also, Id n α * is well-defined as a linear map on T 1 ( H ˜ ) , and the identity
Tr ˜ ( Id n α * ) ( Σ ) X = Tr ˜ Σ ( Id n α ) ( X ) ( Σ T 1 ( H ˜ ) , X B ( H ˜ ) )
holds. We prove this identity. Let { E i j } i , j = 1 n be the matrix units of M n ( C ) . Any Σ T 1 ( H ˜ ) and X B ( H ˜ ) can be written as
Σ = i , j = 1 n E i j σ i j , X = k , = 1 n E k A k
(with σ i j T 1 ( H ) and A k B ( H ) ). Then
( Id n α ) ( X ) = k , = 1 n E k α ( A k ) , ( Id n α * ) ( Σ ) = i , j = 1 n E i j α * ( σ i j ) .
Using E i j E k = δ j k E i , we have
Σ ( Id n α ) ( X ) = i , j , k , ( E i j E k ) σ i j α ( A k ) = i , j , E i σ i j α ( A j ) .
Hence, by the tensor-trace property Tr ˜ ( E i B ) = Tr ( E i ) Tr ( B ) = δ i Tr ( B ) ,
Tr ˜ Σ ( Id n α ) ( X ) = i , j = 1 n Tr σ i j α ( A j i ) .
Similarly,
( Id n α * ) ( Σ ) X = i , j , k , ( E i j E k ) α * ( σ i j ) A k = i , j , E i α * ( σ i j ) A j ,
so
Tr ˜ ( Id n α * ) ( Σ ) X = i , j = 1 n Tr α * ( σ i j ) A j i .
Applying (2.3-∗) with ρ = σ i j and A = A j i yields
Tr α * ( σ i j ) A j i = Tr σ i j α ( A j i ) .
Hence the sums coincide and (2.3-∗∗) is proved.
Step 3. (CP) Let Σ T 1 ( H ˜ ) be an arbitrary positive operator ( Σ 0 ), and let X B ( H ˜ ) be an arbitrary positive operator ( X 0 ). Since α is CP, ( Id n α ) ( X ) 0 . Also, if Σ 0 and Y 0 , then Tr ˜ ( Σ Y ) 0 (as in the discussion of Lemma 19). Therefore, by (2.3-∗∗),
Tr ˜ ( Id n α * ) ( Σ ) X = Tr ˜ Σ ( Id n α ) ( X ) 0 .
Since X 0 is arbitrary, applying Lemma 21-(2) on H ˜ yields
( Id n α * ) ( Σ ) 0 .
Hence Id n α * preserves positivity. Since n was arbitrary, α * is completely positive (CP).
Together with Step 1, α * is CPTP.
(S)⇒(H): Assume that α * is CPTP.
Step 4. (unital) For any ρ T 1 ( H ) , substituting A = I into (2.3-∗) yields
Tr ρ α ( I ) = Tr α * ( ρ ) I = Tr ( α * ( ρ ) ) .
By TP, Tr ( α * ( ρ ) ) = Tr ( ρ ) , hence
Tr ρ ( α ( I ) I ) = 0 ( ρ T 1 ( H ) ) .
Applying Lemma 20 (separation by expectations) to σ : = α ( I ) I gives σ = 0 , i.e. α ( I ) = I . Hence α is unital.
Step 5. (CP) Fix an arbitrary n N and set H ˜ = C n H . Since α * is CP, Id n α * preserves the positive cone of T 1 ( H ˜ ) . Take an arbitrary positive operator X B ( H ˜ ) ( X 0 ) and an arbitrary positive operator Σ T 1 ( H ˜ ) ( Σ 0 ). The identity (2.3-∗∗) shown in Step 2 of (H)⇒(S) also holds in the present situation (by the same algebraic expansion). Hence
Tr ˜ Σ ( Id n α ) ( X ) = Tr ˜ ( Id n α * ) ( Σ ) X .
The right-hand side is nonnegative since ( Id n α * ) ( Σ ) 0 and X 0 . Therefore,
Tr ˜ Σ ( Id n α ) ( X ) 0 ( Σ 0 ) .
Applying Lemma 21-(1) on H ˜ yields
( Id n α ) ( X ) 0 .
Since X 0 was arbitrary, Id n α is positive. Since n was arbitrary, α is completely positive (CP).
Together with Step 4, α is unital-CP.
Thus (H) and (S) are equivalent. □
(6)
Conclusion of this subsection: the definition of CPTP and picture equivalence have been established
By this subsection, we defined physical admissibility of state maps as “CPTP” (Definition 26), and physical admissibility of observable maps as “normal unital-CP.” Moreover, using the predual of a normal map (Lemma 23), we proved rigorously that these two pictures represent essentially the same dynamics (Lemma 24). Henceforth, the CPTP property of each component semigroup of the UEE (reversible, dissipative, transport) can equivalently be treated as (normal) unital-CP on the Heisenberg side.
Preprints 193851 i007

2.4. Dissipative Data as S5 (Common Specification): Π n , V n

(1)
Aim of this subsection: specify, as a specification, the “finite projection system” and “jump operators” responsible for dissipation (measurement/coarse-graining)
In this subsection, as input data for constructing the dissipative component of the Unified Evolution Equation (UEE) treated in this paper, we fix, as a common specification (dissipative data of S5), a finite family of orthogonal projections { Π n } and the associated family of dissipative jump operators { V n } derived from them. Unless otherwise specified in each chapter/section, we use the dissipative data defined in this subsection as the common specification (dissipative data of S5). This specification is the minimal requirement for the dissipative generator L Δ constructed in subsequent sections to satisfy simultaneously a measurement basis (block decomposition) and the CPTP property (complete positivity and normalization preservation). In particular, this paper restricts the projection system to be finite (fixing N = 18 as a specification), and completes all analysis within the paper.
(2)
Finite projection resolution: definition of { Π n } n = 1 N and basic identities
Definition 27 (Dissipative projector system (finite orthogonal resolution)).
Let H be a complex Hilbert space, and let the observable algebra be M : = B ( H ) . As a common specification of this paper, fix the integer N : = 18 and take { Π n } n = 1 N M to be a family satisfying the following:
(P1) 
(Projection) For each n,
Π n = Π n , Π n 2 = Π n .
(P2) 
(Orthogonality) If n m , then
Π n Π m = 0 .
(P3) 
(Completeness) As a finite sum,
n = 1 N Π n = I .
We call { Π n } the dissipative projector system (or measurement projector system).
Lemma 25 (Consequences: commutativity and the δ n m identity for the projector system).
Under Definition 27, for any n , m ,
Π n Π m = Π m Π n
holds. Moreover, Π n Π m = δ n m Π n holds.
Proof. 
If n = m , then Π n Π n = Π n 2 = Π n . If n m , then by (P2), Π n Π m = 0 . On the other hand, applying (P2) with n and m exchanged yields Π m Π n = 0 . Hence always Π n Π m = Π m Π n . Also, when n = m we have Π n Π m = Π n , and when n m we have 0, so Π n Π m = δ n m Π n follows. □
Lemma 26 (Orthogonal decomposition: direct-sum decomposition of H and uniqueness).
Under Definition 27, let H n : = Ran ( Π n ) . Then
H = n = 1 N H n
holds. That is, any ψ H can be written uniquely as
ψ = n = 1 N ψ n , ψ n H n ,
and moreover H n H m for n m .
Proof. 
(i) Orthogonality:. Let n m and write ψ n = Π n u and ψ m = Π m v ( u , v H ). By Lemma 25, Π n Π m = 0 , hence
ψ n , ψ m = Π n u , Π m v = u , Π n Π m v = u , Π n Π m v = u , 0 = 0 .
Thus H n H m .
(ii) Existence (existence of the decomposition): For any ψ H , by (P3),
ψ = I ψ = n = 1 N Π n ψ = n = 1 N Π n ψ .
Since Π n ψ Ran ( Π n ) = H n , ψ is expressed as a sum of the direct-sum components.
(iii) Uniqueness: Assume n = 1 N ψ n = 0 with each ψ n H n . Since each ψ n satisfies ψ n = Π n ψ n (being in the range of the projection), for any m,
0 = Π m n = 1 N ψ n = n = 1 N Π m ψ n = n = 1 N Π m Π n ψ n = Π m Π m ψ m = Π m ψ m = ψ m
(using Lemma 25). Hence ψ m = 0 for all m, so the representation is unique. □
(3)
Block decomposition (measurement-basis decomposition): decomposition formulas for operators and states
The projector system { Π n } decomposes an observable A B ( H ) or a state ρ T 1 ( H ) into finitely many block components.
Lemma 27 (Block decomposition of operators).
For any A B ( H ) ,
A = n = 1 N m = 1 N Π n A Π m
holds (no convergence issue arises since this is a finite sum). In particular, defining the diagonal block projection (pinching)
E ( A ) : = n = 1 N Π n A Π n ,
the difference A E ( A ) = n m Π n A Π m is the sum of off-diagonal blocks.
Proof. 
By (P3), I = n = 1 N Π n , hence
A = I A I = n = 1 N Π n A m = 1 N Π m = n = 1 N m = 1 N Π n A Π m .
The diagonal/off-diagonal decomposition follows immediately by splitting indices into m = n and m n . □
Lemma 28 (Block decomposition of states (trace class) and distribution of the trace).
For any ρ T 1 ( H ) ,
ρ = n = 1 N m = 1 N Π n ρ Π m ( the equality holds as an element of T 1 )
holds. Moreover, for any A B ( H ) ,
Tr ( ρ A ) = n = 1 N m = 1 N Tr ( Π n ρ Π m ) A
holds.
Proof. 
We would like to apply Lemma 27 with A : = ρ , but ρ is not, in general, an element of B ( H ) . Hence we use Definition 22 (that T 1 is the completion of finite rank).
Step 1 (equality for finite rank): Assume ρ F ( H ) . Then ρ B ( H ) as well, so by Lemma 27,
ρ = n , m Π n ρ Π m ( equality as operators )
holds. Since the sum is finite, both sides are also equal as trace-class operators.
Step 2 (extension to general trace class): For a general ρ T 1 ( H ) , take a finite-rank sequence ρ k F ( H ) with ρ k ρ 1 0 . By Step 1, for each k,
ρ k = n , m Π n ρ k Π m .
By Lemma 17 (stability under two-sided multiplication),
Π n ( ρ k ρ ) Π m 1 Π n ρ k ρ 1 Π m ρ k ρ 1
(since projections satisfy Π n 1 ), so for fixed n , m , Π n ρ k Π m Π n ρ Π m in · 1 . Since the sum is finite,
n , m Π n ρ k Π m n , m Π n ρ Π m ( · 1 convergence )
follows. Since the left-hand side equals ρ k , taking limits yields
ρ = n , m Π n ρ Π m
(by uniqueness of limits in · 1 ). Distribution of the trace follows from continuity of Tr (Lemma 16) and linearity over a finite sum. □
(4)
Dissipative jump operators: setting V n = γ Π n
Definition 28 (Dissipation rate γ and jump operators V n ).
As a common specification of this paper, fix a constant γ > 0 , and define the family of jump operators { V n } n = 1 N from the dissipative projector system { Π n } n = 1 N by
V n : = γ Π n ( n = 1 , , N ) .
Lemma 29 (Basic identities of the jump operators).
Under Definition 28, the following hold for any n , m :
1.
V n = V n (self-adjointness).
2.
V n V m = γ Π n Π m = γ δ n m Π n .
3.
V n V n = γ Π n .
4.
The bounded positive operator
Γ : = n = 1 N V n V n
satisfies
Γ = γ n = 1 N Π n = γ I .
Proof. (1) Since Π n = Π n , we have V n = ( γ Π n ) = γ Π n = V n . (2) follows from V n V m = γ Π n Π m and Lemma 25. (3) follows from (1) and (2) with n = m , giving V n V n = V n 2 = γ Π n . (4) follows from (3) and (P3):
Γ = n = 1 N γ Π n = γ n = 1 N Π n = γ I .
(5)
Measurement (coarse-graining) map: E ( A ) = n Π n A Π n and its CPTP property
The projector system { Π n } naturally defines the coarse-graining (pinching) map that projects observables onto diagonal blocks. We fully prove within this paper that this map is unital-CP (hence its predual is CPTP).
Theorem 6 (The pinching map is normal unital-CP, and its predual is CPTP).
Define E : B ( H ) B ( H ) by
E ( A ) : = n = 1 N Π n A Π n .
Then the following hold:
1.
E is normal (σ-weakly continuous).
2.
E is unital and completely positive (unital-CP).
3.
Therefore, the predual map E * : T 1 ( H ) T 1 ( H ) is CPTP, and for any ρ T 1 ( H ) ,
E * ( ρ ) = n = 1 N Π n ρ Π n
holds.
Proof. (1) Normality:
It suffices to show that for each n, the map A Π n A Π n is σ -weakly continuous. By Definition 25, A i σ - weak A means that for any ρ T 1 ( H ) , Tr ( ρ A i ) Tr ( ρ A ) holds. By Lemma 17, Π n ρ Π n T 1 ( H ) , hence
Tr ρ ( Π n A i Π n ) = Tr ( Π n ρ Π n ) A i Tr ( Π n ρ Π n ) A = Tr ρ ( Π n A Π n ) .
Thus Π n A i Π n σ - weak Π n A Π n . Since finite sums preserve σ -weak continuity, E ( A i ) σ - weak E ( A ) . Hence E is normal.
(2) unital-CP: Unitality follows from
E ( I ) = n = 1 N Π n I Π n = n = 1 N Π n = I
(by (P3)).
We prove complete positivity. Fix an arbitrary k N and set H ˜ : = C k H . The map Id k E on B ( H ˜ ) is given by
( Id k E ) ( X ) = n = 1 N ( I k Π n ) X ( I k Π n ) ( X B ( H ˜ ) )
(which follows immediately from linearity of the tensor product). Let X 0 . For any ξ H ˜ and any n,
ξ , ( I k Π n ) X ( I k Π n ) ξ = ( I k Π n ) ξ , X ( I k Π n ) ξ 0
(since X 0 ), so each term is positive. A finite sum of positive operators is positive, hence ( Id k E ) ( X ) 0 . Since k was arbitrary, E is completely positive.
(3) The predual is CPTP: By (1), E is normal, so by Lemma 23 the predual E * exists and satisfies
Tr ( E * ( ρ ) A ) = Tr ( ρ E ( A ) ) ( ρ T 1 ( H ) , A B ( H ) ) .
Moreover, by Lemma 24, E being normal unital-CP is equivalent to E * being CPTP. Hence E * is CPTP.
Finally, we show E * ( ρ ) = n Π n ρ Π n . For any A B ( H ) ,
Tr n = 1 N Π n ρ Π n A = n = 1 N Tr ( Π n ρ Π n A ) = n = 1 N Tr ( ρ Π n A Π n ) = Tr ρ n = 1 N Π n A Π n = Tr ( ρ E ( A ) ) .
Thus n Π n ρ Π n satisfies the characterizing equation for the predual. By Lemma 20 (separation by expectations), such an element is unique, so E * ( ρ ) = n Π n ρ Π n . □
(6)
Definition of Born weights (measurement probabilities): ρ p n ( ρ )
Definition 29 (Born weights (projection measure)).
For ρ T 1 ( H ) and a dissipative projector system { Π n } , define the Born weight for each n by
p n ( ρ ) : = Tr ( Π n ρ ) .
In particular, when ρ S ( H ) , we call { p n ( ρ ) } n = 1 N the measurement probabilities.
Lemma 30 (Born weights form a probability distribution).
Let ρ S ( H ) . Then
p n ( ρ ) 0 ( n ) , n = 1 N p n ( ρ ) = 1
hold. Moreover, E * ( ρ ) = n Π n ρ Π n is a density operator and
Tr ( Π n E * ( ρ ) ) = p n ( ρ )
holds.
Proof. 
Since ρ 0 and Π n 0 (a projection is positive), by Lemma 19,
p n ( ρ ) = Tr ( Π n ρ ) = Tr ( ρ Π n ) 0 .
Also, by (P3),
n = 1 N p n ( ρ ) = n = 1 N Tr ( Π n ρ ) = Tr n = 1 N Π n ρ = Tr ( ρ ) = 1 .
Next, since E * is CPTP (Theorem 6), ρ S ( H ) implies E * ( ρ ) S ( H ) . Finally,
Tr ( Π n E * ( ρ ) ) = Tr Π n m = 1 N Π m ρ Π m = m = 1 N Tr ( Π n Π m ρ Π m ) = Tr ( Π n ρ Π n ) = Tr ( Π n ρ ) = p n ( ρ )
(using Lemma 25 and Π n 2 = Π n ). □
(7)
Conclusion of this subsection: Π n , V n has been fixed as the common specification
In this subsection, as dissipative data of S5 (common specification), we fixed a finite orthogonal projection resolution { Π n } n = 1 N ( N : = 18 ) and the jump operators V n = γ Π n determined by a dissipation rate γ > 0 . As a result, we established within the paper: (i) the direct-sum decomposition of the Hilbert space (Lemma 26), (ii) block decompositions of observables and states (Lemma 27, Lemma 28), (iii) normal unital-CP property of the pinching map and the CPTP property of its predual (Theorem 6), and (iv) that Born weights form a probability distribution (Lemma 30). In subsequent sections, using the data fixed here as input, we construct the dissipative generator L Δ and proceed to semigroup generation and total-generator generation by componentwise composition.
Preprints 193851 i008

2.5. Specification of the Dissipative Generator L Δ *

(1)
Aim of this subsection: define the dissipative component as a “GKLS generator” and close the Heisenberg/Schrödinger consistency within the paper
In this subsection, we define the generator responsible for the dissipative component of the Unified Evolution Equation (UEE) as the observable-side (Heisenberg picture) generator L Δ * , and uniquely determine, as its predual, the state-side (Schrödinger picture) generator L Δ . Unless otherwise specified in each chapter/section, we use the specification and consequences given in this subsection as the standard henceforth. Since the dissipative data ( Π n , V n ) has already been fixed by the common specification (S5) (previous subsection), this subsection takes as its goals:
1.
that L Δ * is in GKLS standard form (fixing the type);
2.
that Hermiticity preservation, unit preservation (Heisenberg), and trace preservation (infinitesimal Schrödinger form) are completely proved within the paper;
3.
that under the minimal specification ( V n = γ Π n ), L Δ * and L Δ are reduced by the pinching map, and the block action (diagonal invariance and off-diagonal decay) is derived rigorously.
Since this subsection is part of a “specification chapter,” general semigroup theory for the semigroup generated by L Δ (Hille–Yosida, etc.) is prepared in subsequent sections, but for the minimal specification fixed in this subsection, we provide explicit consequences (up to block equations) in a form reusable in subsequent sections.
(2)
Definition of the dissipative generator (Heisenberg picture): specification as GKLS standard form
Hereafter, we use the standard realization
M = B ( H ) , M * = T 1 ( H )
(consistently with the specification up to the previous subsection). Assume that the dissipative projector system { Π n } n = 1 N and the jump operators { V n } n = 1 N have already been fixed (Definition 27, Definition 28 in the previous subsection).
Definition 30 (Dissipative generator (Heisenberg generator) L Δ * ).
Define the linear map L Δ * : B ( H ) B ( H ) on the observable algebra B ( H ) by the GKLS (Lindblad) standard form
L Δ * [ A ] : = n = 1 N V n A V n 1 2 { V n V n , A } ( A B ( H ) ) .
As the minimal specification of this paper, fix the dissipation rate γ > 0 and adopt
V n : = γ Π n ( n = 1 , , N ) .
(3)
Reduction under the minimal specification: L Δ * coincides with the “pinching difference” γ ( E Id )
Let the pinching map (diagonal block projection) E : B ( H ) B ( H ) defined in the previous subsection be
E ( A ) : = n = 1 N Π n A Π n
(which coincides with the diagonal part in Lemma 27 of the previous subsection).
Lemma 31 (Reduced form: L Δ * = γ ( E Id ) ).
Under the minimal specification V n = γ Π n in Definition 30, for any A B ( H ) ,
L Δ * [ A ] = γ n = 1 N Π n A Π n γ A = γ E ( A ) A
holds.
Proof. 
Since V n = V n = γ Π n (Lemma 29-(1) of the previous subsection),
n = 1 N V n A V n = n = 1 N γ Π n A Π n = γ E ( A ) .
Also, by the same lemma, n = 1 N V n V n = γ I , hence
n = 1 N 1 2 { V n V n , A } = 1 2 { γ I , A } = γ 2 ( I A + A I ) = γ A .
Substituting into Definition 30 gives the claim. □
(4)
Basic properties of L Δ * : boundedness, Hermiticity preservation, unit preservation, and invariance of pointer projections
Lemma 32 (Boundedness (operator-norm estimate)).
L Δ * is a bounded linear map on B ( H ) , and
L Δ * [ A ] 2 γ A ( A B ( H ) )
holds.
Proof. 
By Lemma 31,
L Δ * [ A ] = γ E ( A ) A γ E ( A ) + γ A .
For E ( A ) = n Π n A Π n , for any ψ H ,
E ( A ) ψ = n = 1 N Π n A Π n ψ n = 1 N Π n A Π n ψ n = 1 N A Π n ψ .
Moreover, by the orthogonal decomposition (Lemma 26 of the previous subsection), n Π n ψ 2 = ψ 2 , so by Cauchy–Schwarz,
n = 1 N Π n ψ N n = 1 N Π n ψ 2 1 / 2 = N ψ .
Hence E ( A ) ψ N A ψ , and in particular E ( A ) N A . However, in this paper, since E is a finite sum of “compressions” by projections, a coarser estimate suffices, and by Π n 1 and the triangle inequality,
E ( A ) = n = 1 N Π n A Π n n = 1 N Π n A Π n n = 1 N A = N A
follows. In either case, an estimate E ( A ) C A is obtained. In this subsection we do not use E ( A ) A as the minimal estimate, but using the above estimate yields
L Δ * [ A ] γ E ( A ) + γ A γ N A + γ A 2 γ N A .
Thus boundedness of L Δ * is ensured. Here, as a specification note, “boundedness” is essential rather than the constant factor. (If, in subsequent sections, one shows E = 1 from E being unital-CP, this estimate is immediately improved to 2 γ A .) □
Lemma 33 (Hermiticity preservation (∗-preservation)).
For any A B ( H ) ,
L Δ * [ A ] = L Δ * [ A ]
holds. In particular, if A = A then L Δ * [ A ] is also self-adjoint.
Proof. 
By Definition 30,
L Δ * [ A ] = n V n A V n 1 2 ( V n V n A + A V n V n ) .
Taking adjoints and using ( X Y ) = Y X and ( X + Y ) = X + Y yields
L Δ * [ A ] = n ( V n A V n ) 1 2 ( V n V n A ) + ( A V n V n ) = n V n A V n 1 2 A V n V n + V n V n A = L Δ * [ A ] .
Hence the claim follows. □
Lemma 34 (Infinitesimal form of unit preservation: L Δ * [ I ] = 0 ).
L Δ * [ I ] = 0
holds. Hence L Δ * is a generator that preserves the unit in the Heisenberg picture.
Proof. 
Substituting A = I into Definition 30 yields
L Δ * [ I ] = n V n V n 1 2 { V n V n , I } .
Since { X , I } = X I + I X = 2 X ,
V n V n 1 2 { V n V n , I } = V n V n 1 2 · 2 V n V n = 0 .
Taking the finite sum gives L Δ * [ I ] = 0 . □
Lemma 35 (Invariance of pointer projections: L Δ * [ Π m ] = 0 ).
For any m { 1 , , N } ,
L Δ * [ Π m ] = 0
holds.
Proof. 
By Lemma 31,
L Δ * [ Π m ] = γ E ( Π m ) Π m .
On the other hand,
E ( Π m ) = n = 1 N Π n Π m Π n = n = 1 N δ n m Π n Π n = Π m
(using Lemma 25 and Π n 2 = Π n ), hence E ( Π m ) Π m = 0 and therefore L Δ * [ Π m ] = 0 . □
(5)
Dissipative generator as the predual (Schrödinger picture) and the infinitesimal form of trace preservation
If the observable-side generator L Δ * is normal, then by the general fact established in the previous subsection (existence and uniqueness of the predual map), the state-side generator L Δ is uniquely determined. In this subsection, we give it as an explicit formula and prove the dual relation and trace preservation within the paper.
Definition 31 (Dissipative generator (Schrödinger generator) L Δ ).
Define L Δ : T 1 ( H ) T 1 ( H ) to be the unique linear map satisfying, for any ρ T 1 ( H ) and any A B ( H ) ,
Tr L Δ [ ρ ] A = Tr ρ L Δ * [ A ]
Lemma 36 (Explicit formula: L Δ = n V n ρ V n 1 2 { V n V n , ρ } ).
The map L Δ determined by Definition 31 is given, for any ρ T 1 ( H ) , by
L Δ [ ρ ] = n = 1 N V n ρ V n 1 2 { V n V n , ρ } .
In particular, under the minimal specification V n = γ Π n ,
L Δ [ ρ ] = γ n = 1 N Π n ρ Π n γ ρ = γ E * ( ρ ) ρ
holds, where E * : T 1 ( H ) T 1 ( H ) is defined by
E * ( ρ ) : = n = 1 N Π n ρ Π n
(the predual of the pinching map from the previous subsection).
Proof. 
First, we show that the map defined by the right-hand side (denote it by L ˜ Δ ) satisfies (2.5-∗). For any ρ T 1 ( H ) and A B ( H ) , by cyclicity of the trace (the property is isomorphic to Lemma 3 established in the previous subsection) and linearity,
Tr L ˜ Δ [ ρ ] A = n Tr ( V n ρ V n A ) 1 2 Tr ( V n V n ρ A ) 1 2 Tr ( ρ V n V n A ) = n Tr ( ρ V n A V n ) 1 2 Tr ( ρ V n V n A ) 1 2 Tr ( ρ A V n V n ) = Tr ρ n V n A V n 1 2 { V n V n , A } = Tr ρ L Δ * [ A ] .
Hence L ˜ Δ satisfies (2.5-∗). On the other hand, since an element of T 1 ( H ) satisfying (2.5-∗) is unique by separation by observables (Lemma 20 of the previous subsection), we obtain L Δ = L ˜ Δ .
The reduction under the minimal specification follows immediately, as in Lemma 31, by using n V n ρ V n = γ n Π n ρ Π n and n 1 2 { V n V n , ρ } = 1 2 { γ I , ρ } = γ ρ . □
Lemma 37 (Infinitesimal form of trace preservation: Tr ( L Δ [ ρ ] ) = 0 ).
For any ρ T 1 ( H ) ,
Tr L Δ [ ρ ] = 0
holds.
Proof. 
Substituting A = I into the duality relation (2.5-∗) in Definition 31 yields
Tr L Δ [ ρ ] = Tr L Δ [ ρ ] I = Tr ρ L Δ * [ I ] .
By Lemma 34, L Δ * [ I ] = 0 , so the right-hand side is 0. Hence the claim follows. □
(6)
Block action (concrete implication of the specification): diagonal invariance and off-diagonal damping
Define the block components with respect to the dissipative projector system by
ρ m n : = Π m ρ Π n T 1 ( H ) ( 1 m , n N )
(by Lemma 28 of the previous subsection, ρ = m , n ρ m n ).
Theorem 7 (Block action of the dissipative generator: ρ ˙ m n = γ ρ m n for m n , and ρ ˙ n n = 0 ).
Under the minimal specification V n = γ Π n , for any ρ T 1 ( H ) and any m , n ,
Π m L Δ [ ρ ] Π n = γ Π m ρ Π n , m n , 0 , m = n ,
holds. Therefore, for the dissipative equation ρ ˙ = L Δ [ ρ ] , each block component satisfies
d d t ρ m n ( t ) = γ ρ m n ( t ) , m n , 0 , m = n ,
Proof. 
Use the reduced form in Lemma 36,
L Δ [ ρ ] = γ k = 1 N Π k ρ Π k γ ρ .
Multiplying from both sides by Π m and Π n yields
Π m L Δ [ ρ ] Π n = γ k = 1 N Π m Π k ρ Π k Π n γ Π m ρ Π n .
By Lemma 25, Π m Π k = δ m k Π m and Π k Π n = δ k n Π n , hence
Π m Π k ρ Π k Π n = δ m k δ k n Π m ρ Π n = δ m n δ m k Π m ρ Π n .
Thus the sum contributes only when m = n , and
γ k = 1 N Π m Π k ρ Π k Π n = γ δ m n Π m ρ Π n .
Therefore,
Π m L Δ [ ρ ] Π n = γ δ m n Π m ρ Π n γ Π m ρ Π n = γ Π m ρ Π n , m n , 0 , m = n .
The final differential-equation statement follows by applying this identity after multiplying ρ ˙ = L Δ [ ρ ] from both sides by Π m , Π n . □
(7)
Conclusion of this subsection: the type, conservation laws, and block action of L Δ * have been fixed
In this subsection, the dissipative generator was given in GKLS standard form as the observable-side map L Δ * : B ( H ) B ( H ) (Definition 30), and under the minimal specification V n = γ Π n , we proved that it can be reduced to
L Δ * = γ ( E Id ) , L Δ = γ ( E * Id )
(Lemma 31, Lemma 36). Moreover, we proved within the paper Hermiticity preservation and unit preservation of L Δ * (Lemma 33, Lemma 34), and the infinitesimal form of trace preservation on the state side (Lemma 37). Finally, we fixed as the block action that dissipation yields “diagonal blocks invariant and off-diagonal exponentially decaying” (Theorem 7).
Preprints 193851 i009

2.6. Zero-Area Specification and the Type of R

(1)
Aim of this subsection: specify the projection Π R and the “zero-area” condition responsible for boundary effects, and type R as a generator of a CPTP semigroup
In this subsection, as the boundary specification associated with the resonance (transport) component R appearing in the Unified Evolution Equation (UEE), we rigorously fix, as a common specification,
1.
the resonance projection Π R (projection operator associated with R) and its geometric support set supp Σ ( Π R ) ,
2.
the zero-area condition H Σ 2 ( supp Σ ( Π R ) ) = 0 (vanishing two-dimensional Hausdorff measure),
3.
the flux-blocking condition for the information flux normal component at the boundary (a specification locally meaning J μ n μ = 0 ),
4.
the type of R (generator of a strongly continuous CPTP semigroup on the state space) and the Heisenberg/Schrödinger duality.
Unless otherwise specified in each chapter/section, we follow the specifications of this subsection. Since this subsection is part of a specification chapter, concrete constructions of R and composite generation via product formulas are carried out in subsequent sections, but in this subsection we complete within the paper the primary source of definitions for “what is called R” and “what it means to be zero-area.”
(2)
Measure-theoretic basis of zero-area: definition of the two-dimensional Hausdorff measure H Σ 2
The zero-area condition is defined as vanishing of the two-dimensional Hausdorff measure on a boundary set. In what follows, we treat the boundary as a metric space.
Definition 32 (Boundary metric space and the two-dimensional Hausdorff measure).
Let Σ be a metric space equipped with a distance function d Σ (physically, a boundary surface whose distance is induced by an induced metric is intended). For any set U Σ , define its diameter by
diam ( U ) : = sup { d Σ ( x , y ) : x , y U } [ 0 , ] .
For E Σ and δ > 0 , define
H Σ , δ 2 ( E ) : = inf k = 1 diam ( U k ) 2 : E k = 1 U k , diam ( U k ) δ
(where the sum is taken to be 0 for the empty cover). Define the two-dimensional Hausdorff measure H Σ 2 by
H Σ 2 ( E ) : = lim δ 0 H Σ , δ 2 ( E ) = sup δ > 0 H Σ , δ 2 ( E ) .
Lemma 38 (A countable union of H Σ 2 -null sets is H Σ 2 -null).
Let { E k } k N be a countable family of subsets of Σ such that H Σ 2 ( E k ) = 0 holds for all k N . Then
H Σ 2 k = 1 E k = 0
holds.
Proof. 
Take an arbitrary ε > 0 . Since H Σ 2 ( E k ) = 0 for each k, by Definition 32 we have H Σ , δ 2 ( E k ) = 0 for any δ > 0 . In particular, let δ k : = 2 k ; then for each k,
H Σ , δ k 2 ( E k ) = 0 .
Hence, for each k, there exists a family { U k , j } j 1 such that
E k j = 1 U k , j , diam ( U k , j ) δ k , j = 1 diam ( U k , j ) 2 < ε 2 k
(by the definition that the infimum is 0). Then
k = 1 E k k = 1 j = 1 U k , j .
Moreover, for all ( k , j ) , diam ( U k , j ) δ k 1 , so the cover diameters are uniformly bounded by 1. Therefore,
H Σ , 1 2 k = 1 E k k = 1 j = 1 diam ( U k , j ) 2 < k = 1 ε 2 k = ε .
Since ε > 0 is arbitrary, H Σ , 1 2 ( k E k ) = 0 . By Definition 32, H Σ 2 ( k E k ) H Σ , 1 2 ( k E k ) = 0 . Hence the conclusion follows. □
(3)
Resonance projection Π R and geometric support set supp Σ ( Π R ) : definition via distribution kernels
The zero-area condition is defined by requiring that the “geometric support set” of the projection Π R associated with R has zero two-dimensional Hausdorff measure. The key point here is that Π R is not treated as a mere indicator function of a measurable set, but rather its geometric support is defined via the support of a distribution kernel. This allows Π R to be a nontrivial operator even when its support collapses to a lower-dimensional set (zero-area).
Definition 33 (Kernel-admissible operators and distribution kernels).
Let Σ be a smooth manifold (or a C metric space), and let H Σ : = L 2 ( Σ ) be the Hilbert space on it. A bounded operator A B ( H Σ ) is said to be kernel-admissible if there exists a distribution K A D ( Σ × Σ ) such that, for any test functions φ , ψ C c ( Σ ) ,
φ , A ψ L 2 ( Σ ) = K A , φ ¯ ψ D D
holds. In this case, K A is called the (distributional) kernel of A.
Lemma 39 (Uniqueness of the kernel).
In Definition 33, if K A , K A D ( Σ × Σ ) both satisfy (2.6-∗), then K A = K A .
Proof. 
Let L : = K A K A . Then for any φ , ψ C c ( Σ ) ,
L , φ ¯ ψ = 0
holds. Define
T : = span { φ ¯ ψ : φ , ψ C c ( Σ ) } C c ( Σ × Σ ) .
T is the set of finite linear combinations of tensor-product functions, and by the standard local-coordinate decomposition and partition-of-unity lemma on C c ( Σ × Σ ) , T is dense in C c ( Σ × Σ ) (with respect to the Fréchet topology). Since L is a distribution, i.e. a continuous linear functional on C c ( Σ × Σ ) , vanishing on the dense subset T implies vanishing on the whole space: namely, for any f C c ( Σ × Σ ) , L , f = 0 . Hence L = 0 , i.e. K A = K A . □
Definition 34 (Geometric support set (shadow support)).
Let K A be the distribution kernel of a kernel-admissible operator A (unique by Lemma 39). Take the distributional support supp ( K A ) Σ × Σ in the usual sense, and define the projections π 1 , π 2 : Σ × Σ Σ by π 1 ( x , y ) = x and π 2 ( x , y ) = y . Define the geometric support set of A by
supp Σ ( A ) : = π 1 supp ( K A ) π 2 supp ( K A ) ¯ Σ Σ
(where the overline denotes topological closure in Σ).
Definition 35 (Resonance projection Π R and the zero-area condition).
As a common specification of this paper, fix a kernel-admissible orthogonal projection Π R B ( H Σ ) :
Π R = Π R , Π R 2 = Π R .
Define the geometric support set supp Σ ( Π R ) by Definition 34, and require the zero-area condition as
H Σ 2 supp Σ ( Π R ) = 0
(4)
A sufficient condition for zero-area: the case where the support is compressed onto lines (one-dimensional)
In many physical constructions, supp Σ ( Π R ) is compressed into a bundle of (finitely or countably many) contact lines or connection lines. In this subsection, we prove within the paper, from the definition of Hausdorff measure, that such “line support” implies (ZA).
Definition 36 (Lipschitz curves and line bundles (countable unions)).
Let I = [ 0 , 1 ] . A map γ : I Σ is called Lipschitz if there exists a constant L 0 such that
d Σ γ ( s ) , γ ( t ) L | s t | ( s , t I )
holds. For a countable family { γ k } k N , define
Γ : = k = 1 γ k ( I ) Σ
and call Γ a bundle of lines in this paper.
Lemma 40 (The image of a Lipschitz curve has zero two-dimensional Hausdorff measure).
Let γ : I Σ be a Lipschitz curve in the sense of Definition 36. Then
H Σ 2 γ ( I ) = 0
holds.
Proof. 
Let L 0 be a Lipschitz constant of γ . If L = 0 , then γ ( I ) is a singleton set, and H Σ 2 ( γ ( I ) ) = 0 follows immediately from Definition 32. Assume L > 0 .
Take an arbitrary δ > 0 . Let m : = L δ and consider the partition
I = j = 1 m j 1 m , j m .
Write each subinterval as I j and set U j : = γ ( I j ) Σ . For any s , t I j , | s t | 1 m , so by the Lipschitz property,
diam ( U j ) = sup s , t I j d Σ ( γ ( s ) , γ ( t ) ) sup s , t I j L | s t | L m δ
(since m L / δ ). Hence { U j } j = 1 m is a δ -cover of γ ( I ) :
γ ( I ) j = 1 m U j , diam ( U j ) δ .
Therefore, by Definition 32,
H Σ , δ 2 γ ( I ) j = 1 m diam ( U j ) 2 j = 1 m L m 2 = m · L 2 m 2 = L 2 m L 2 L / δ = L δ .
Taking the limit δ 0 yields
0 H Σ 2 γ ( I ) = lim δ 0 H Σ , δ 2 γ ( I ) lim δ 0 L δ = 0 .
Hence H Σ 2 ( γ ( I ) ) = 0 . □
Theorem 8 (Line-bundle support ⇒ zero-area).
Let Γ Σ be a line bundle in the sense of Definition 36. If
supp Σ ( Π R ) Γ
holds, then the zero-area condition (ZA) holds.
Proof. 
By assumption, supp Σ ( Π R ) k = 1 γ k ( I ) . By Lemma 40, for each k, H Σ 2 ( γ k ( I ) ) = 0 . By Lemma 38,
H Σ 2 k = 1 γ k ( I ) = 0 .
By monotonicity of Hausdorff measure (which follows immediately from the infimum definition in Definition 32),
H Σ 2 supp Σ ( Π R ) H Σ 2 k = 1 γ k ( I ) = 0 .
Hence (ZA) holds. □
(5)
flux-blocking specification: vanishing of the boundary normal component J μ n μ (local and integral forms)
While zero-area is a geometric condition, the boundary specification of this paper also requires, in parallel, that the normal component of the information flux at the boundary is blocked. Here we formulate this in the minimal form needed for analysis.
Definition 37 (Normal-component flux and the flux-blocking condition).
Let j L loc 1 ( Σ , H Σ 2 ) be a measurable function regarded as a representative of the boundary normal component j ( x ) = J μ ( x ) n μ ( x ) . For a measurable set E Σ , define the flux by
Φ ( E ) : = E j d H Σ 2 .
Require the flux-blocking condition associated with the resonance projection Π R as
j ( x ) = 0 for H Σ 2 - a . e . x supp Σ ( Π R )
Lemma 41 (Local flux-blocking ⇒ zero integral flux on the support).
Assume that condition (FB) of Definition 37 holds. Then for any measurable set E supp Σ ( Π R ) ,
Φ ( E ) = 0
holds.
Proof. 
Let E supp Σ ( Π R ) . By assumption (FB), j = 0 holds H Σ 2 -a.e. on supp Σ ( Π R ) , hence also j = 0 holds a.e. on E. Therefore,
Φ ( E ) = E j d H Σ 2 = E 0 d H Σ 2 = 0 .
(6)
Type of R: generator of a strongly continuous CPTP semigroup on the state space (and the dual generator)
Finally, we fix, as a specification, the type of R used in this paper. Since this paper is a “foundational analysis,” we do not give R by an explicit formula, but define it as a closed operator generating a strongly continuous CPTP semigroup.
Definition 38 (Type of R (generator of a CPTP semigroup on the state space)).
For an operator R on the standard state space X : = T 1 ( H ) , we require the following as a common specification:
(R1) 
R is a densely defined linear operator and is closed.
(R2) 
R is the generator of a strongly continuous semigroup { T R ( t ) } t 0 :
T R ( 0 ) = Id , T R ( t + s ) = T R ( t ) T R ( s ) , lim t 0 T R ( t ) [ ρ ] ρ 1 = 0 ( ρ X ) ,
and
R [ ρ ] = lim t 0 T R ( t ) [ ρ ] ρ t ( ρ Dom ( R ) ) .
(R3) 
For each t 0 , T R ( t ) is CPTP (state-side definition in Definition 26).
Lemma 42 (Infinitesimal trace preservation: Tr ( R [ ρ ] ) = 0 ).
Under Definition 38, for any ρ Dom ( R ) ,
Tr ( R [ ρ ] ) = 0
holds.
Proof. 
Take ρ Dom ( R ) . Since T R ( t ) is TP, for any t 0 ,
Tr ( T R ( t ) [ ρ ] ) = Tr ( ρ )
holds. Taking the difference quotient,
0 = Tr ( T R ( t ) [ ρ ] ) Tr ( ρ ) t = Tr T R ( t ) [ ρ ] ρ t .
Take the limit t 0 . Since Tr is · 1 -continuous (Lemma 16), and by definition T R ( t ) [ ρ ] ρ t R [ ρ ] holds in · 1 ,
0 = lim t 0 Tr T R ( t ) [ ρ ] ρ t = Tr ( R [ ρ ] ) .
Definition 39 (Dual semigroup and dual generator R * (observable side)).
When T R ( t ) is CPTP, as in Definition 16, define the observable-side map T R * ( t ) : B ( H ) B ( H ) by
Tr T R ( t ) [ ρ ] A = Tr ρ T R * ( t ) [ A ] ( ρ T 1 ( H ) , A B ( H ) )
(existence and uniqueness follow from Lemma 20). Then { T R * ( t ) } t 0 is a normal unital-CP semigroup (by the picture equivalence established in §2.3). Moreover, define its generator R * by
R * [ A ] : = lim t 0 T R * ( t ) [ A ] A t ( A Dom ( R * ) ) ,
and adopt, as a specification for R and R * , the duality relation
Tr ( R [ ρ ] ) A = Tr ρ R * [ A ] ( ρ Dom ( R ) , A Dom ( R * ) ) .
(7)
Conclusion of this subsection: zero-area and the type (generator) of R have been fixed
In this subsection, we fixed the resonance projection Π R as a kernel-admissible orthogonal projection (Definition 35), defined its geometric support set supp Σ ( Π R ) from the support of a distribution kernel (Definition 34), and required the zero-area condition
H Σ 2 supp Σ ( Π R ) = 0 .
We also proved within the paper that zero-area follows when the support is compressed onto a line bundle (a countable union of images of Lipschitz curves) (Theorem 8). Furthermore, we specified flux-blocking as the local condition j = J μ n μ = 0 ( H Σ 2 -a.e.), and showed that the integral flux on the support is zero (Lemma 41). Finally, we typed R as a generator of a strongly continuous CPTP semigroup on the state space (Definition 38), and proved within the paper the infinitesimal trace-preservation identity Tr ( R [ ρ ] ) = 0 (Lemma 42). These serve as the invariant specifications for subsequent sections where R is constructed concretely and the total generator is obtained by componentwise composition.
Preprints 193851 i010

2.7. Finite-Dimensional / Infinite-Dimensional Treatment

(1)
Aim of this subsection: separate completeness in finite dimension from the assumption package in infinite dimension, and make the “applicability conditions” explicit
As a foundational analytical paper, this paper treats the Unified Evolution Equation (UEE) as an abstract Cauchy problem on the state space X = M * (in the standard realization, X = T 1 ( H ) ). In this setting, the finite-dimensional case ( dim H < ) and the infinite-dimensional case ( dim H = ) differ essentially in boundedness of generators, domains, and the scope of applicability of semigroup generation theorems. Unless otherwise specified in each chapter/section, we follow the framework and applicability conditions given in this subsection. The purpose of this subsection is to avoid ambiguity in these differences and to:
1.
establish, in finite dimension, a reference case in which all claims can be completely proved with minimal assumptions,
2.
in infinite dimension, without claiming necessity and sufficiency, organize the required assumptions explicitly as an “Assumption Package,”
3.
make it logically traceable in subsequent sections (semigroup theory, dissipative generator, resonance generator, componentwise composition) which statements are automated in finite dimension and which statements require additional assumptions in infinite dimension.
This subsection provides, within itself, the primary source of the “applicability conditions.”
(2)
Two working modes: finite-dimensional mode (FD) and infinite-dimensional mode (ID)
Hereafter, this paper is arranged so that it can be read in two modes.
Definition 40 (Finite-dimensional mode (FD) and infinite-dimensional mode (ID)).
We classify the discussions of this paper into the following two modes.
(FD) 
Finite-dimensional mode: assume dim H < . Then B ( H ) and T 1 ( H ) are finite-dimensional linear spaces, and all linear operators are bounded, i.e., domain issues disappear.
(ID) 
Infinite-dimensional mode: allow dim H = , and explicitly list, as an assumption package, the domain, closedness, strong continuity, and the existence of a common core required for product formulas.
(3)
Automation in finite dimension: disappearance of domain issues and exponential semigroups
In finite dimension, since generators are bounded, semigroups can always be constructed via exponentials. We establish this fact within the paper and thereafter state explicitly that “in FD it is automatic.”
Lemma 43 (In finite dimension, T 1 ( H ) and B ( H ) are the same linear space).
Assume dim H < . Then
T 1 ( H ) = B ( H )
holds as sets, and moreover any linear map A : B ( H ) B ( H ) is bounded.
Proof. 
In finite dimension, every linear operator has finite rank and hence belongs to the trace class, and conversely the trace class is a subset of bounded operators. Therefore they coincide as sets. Moreover, on a finite-dimensional normed space, every linear map is continuous (bounded) (a basic theorem of linear algebra). □
Lemma 44 (In finite dimension, an exponential always yields a strongly continuous semigroup).
Assume dim H < and set X : = T 1 ( H ) . For any linear operator A : X X ,
T A ( t ) : = e t A : = k = 0 t k k ! A k ( t 0 )
converges absolutely in finite dimension and defines a strongly continuous semigroup on X. Moreover, its generator is A and Dom ( A ) = X .
Proof. 
In finite dimension, for any norm one has A k A k , and since the series k 0 t k k ! A k = e t A converges, the operator series converges absolutely and T A ( t ) is well-defined. Termwise differentiation is permitted, and T A ( t ) = A T A ( t ) = T A ( t ) A holds. Hence T A ( t + s ) = T A ( t ) T A ( s ) and T A ( 0 ) = I follow, and strong continuity follows from convergence of the series. Moreover, the limit of the difference quotient as t 0 can be taken termwise, giving generator A. □
(4)
Issues unavoidable in infinite dimension: domain, closedness, strong continuity, and a common core
In infinite dimension, the domain of L 0 = i [ D , · ] (in particular when D is unbounded), closedness and density of R as a generator, and the common core required for product formulas become issues. In this paper we organize these as an “assumption package” and make explicit the applicability conditions of the main theorem.
Definition 41 (Infinite-dimensional assumption package (ID basic assumptions)).
When allowing dim H = , we adopt the following assumptions as the ID basic assumptions.
(ID1) 
Unitary part (D): D is a self-adjoint operator on H , and U ( t ) : = e i t D forms a strongly continuous unitary group on H (Stone’s theorem). Moreover, T 0 ( t ) [ ρ ] : = U ( t ) ρ U ( t ) is strongly continuous on X = T 1 ( H ) (we adopt the property proved in § 1 . 2 ).
(ID2) 
Dissipative part ( L Δ ):  L Δ is a bounded linear map on X, and T Δ ( t ) : = e t L Δ is a strongly continuous CPTP semigroup. (Boundedness is shown within the paper from the minimal specification V n = γ Π n and N < .)
(ID3) 
Resonance part (R): R is a densely defined closed operator on X, and is the generator of a strongly continuous CPTP semigroup T R ( t ) (consistent with Definition 38).
(ID4) 
Common core (tangency condition for product formulas): There exists a dense subspace D X such that
D Dom ( L 0 ) Dom ( R ) , T 0 ( t ) D D , T Δ ( t ) D D , T R ( t ) D D ,
and for F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) ,
lim t 0 F ( t ) ρ ρ t L 0 + L Δ + R ρ 1 = 0 ( ρ D )
holds (Chernoff tangency condition).
(5)
Minimal consistency of the ID assumption package: automatic consequences (with proofs)
Given the ID basic assumptions, the “contractivity” and “closure of CPTP” needed for product formulas follow automatically. Here we state and prove them explicitly within the paper for repeated use in subsequent sections.
Lemma 45 (A CPTP map is trace-norm contractive).
If T : X X is CPTP, then
T ( ρ ) 1 ρ 1 ( ρ X )
holds.
Proof. 
By the polar decomposition of ρ , write ρ = U | ρ | (with U a partial isometry). Since U 1 in operator norm, by Definition 21 (and completion),
ρ 1 = Tr ( | ρ | ) = sup A 1 | Tr ( ρ A ) | .
Hence
T ( ρ ) 1 = sup A 1 | Tr ( T ( ρ ) A ) | .
Define the Heisenberg-side dual map T * by Tr ( T ( ρ ) A ) = Tr ( ρ T * ( A ) ) (duality in §2.3). If T is CPTP, then T * is unital-CP (equivalence in §2.3). A unital-CP map satisfies operator-norm contractivity: for any A, T * ( A ) A . (This follows from the one-dimensional Kadison inequality T * ( A A ) T * ( A ) T * ( A ) and T * ( I ) = I . Details are proved in the next subsection; in this lemma we use this standard fact.) Therefore, if A 1 , then T * ( A ) 1 , and hence
| Tr ( T ( ρ ) A ) | = | Tr ( ρ T * ( A ) ) | sup B 1 | Tr ( ρ B ) | = ρ 1 .
Taking the supremum yields T ( ρ ) 1 ρ 1 . □
Lemma 46 (The composite approximation of component semigroups is contractive (ID)).
Under the ID basic assumptions (Definition 41),
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t )
is contractive for each t 0 , and
F ( t ) ρ 1 ρ 1 ( ρ X )
holds.
Proof. 
T 0 ( t ) , T Δ ( t ) , and T R ( t ) are CPTP respectively (ID1–ID3). By Lemma 45, each is trace-norm contractive, hence for any ρ X ,
F ( t ) ρ 1 = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] 1 T Δ ( t ) T R ( t ) [ ρ ] 1 T R ( t ) [ ρ ] 1 ρ 1 .
(6)
Connection between finite and infinite dimension: the main theorem holds unconditionally in FD and conditionally in ID
The main theorem of this paper (existence of component semigroups and total generation by componentwise composition) holds without assumptions (automatically) in FD, and holds in ID as long as the ID basic assumptions are satisfied. We state this explicitly as a theorem.
Theorem 9 (Mode-wise scope of the claims (FD: unconditional, ID: conditional)).
The main theorem set proved in this paper (existence of component semigroups, total semigroup generation by CPTP componentwise composition, and invariance of the state set) holds with respect to the two modes in Definition 40 as follows.
(FD) 
If dim H < , then all generators are bounded and semigroups can be constructed by exponential series, so the claims holdwithout assumptions.
(ID) 
If dim H = is allowed, then the claims hold as long as Definition 41 (ID basic assumptions) is satisfied.
Proof. 
(FD) follows because X is finite-dimensional by Lemma 43, and because for any generator an exponential semigroup can be constructed by Lemma 44. (ID) follows from the product formula (Chernoff/Trotter) proved in subsequent sections and the common-core assumption (ID4), which yield existence of the limit semigroup and identification of the generator, together with contractivity guaranteed by Lemma 46. (Detailed generator identification is proved in the relevant subsection.) □
(7)
Conclusion of this subsection: the two modes and the assumption package have been organized
In this subsection, we clearly separated the treatment of finite dimension (FD) and infinite dimension (ID), and proved within the paper that in FD the domain issue disappears and the entire construction is automated by exponential semigroups (Lemma 43, Lemma 44). On the other hand, in ID we packaged the necessary assumptions as the “ID basic assumptions” (Definition 41) and made explicit the common core and tangency condition required by the product formula. We further established within the paper that CPTP maps are trace-norm contractive (Lemma 45), and that the composite approximation of component semigroups is contractive (Lemma 46), and organized the scope of the main theorem mode-wise as a theorem (Theorem 9). Thus, the reader can determine whether their model is FD or ID and verify rigorously the conditions under which the main results of this paper apply.
Preprints 193851 i011

3. Analytical Foundations: CPTP Maps, Strongly Continuous Semigroups, Generators, and Closedness Under Limits

3.1. Strongly Continuous Semigroups and Generators

(1)
Aim of this subsection: fixing the minimal analytical framework that allows the UEE to be defined as an abstract Cauchy problem
In this paper, the Unified Evolution Equation (UEE) is constructed as a time evolution on the state space X : = M * (in the standard realization, X = T 1 ( H ) ). If one treats the UEE directly as a “differential equation,” then domain issues for the generator (the operator on the right-hand side) become unavoidable. Therefore, this paper defines the UEE as the action of a strongly continuous semigroup { T ( t ) } t 0 and introduces the generator as a difference-quotient limit. The aims of this subsection are:
1.
to fix rigorously the definitions of strongly continuous semigroups ( C 0 -semigroups) and generators,
2.
to prove within the paper the basic properties of generators (linearity, closedness, necessity of density, consistency with the semigroup),
3.
to prepare that the notions of “mild solutions” and “strong solutions” used in subsequent sections are uniquely determined by the definitions of this subsection.
All necessary proofs are completed at the line-by-line level.
(2)
Definition of strongly continuous semigroups ( C 0 -semigroups) and basic consequences
Definition 42 (Strongly continuous semigroup ( C 0 -semigroup)).
Let X be a complex Banach space, and let { T ( t ) } t 0 be a family of linear operators on X. We say that { T ( t ) } is a strongly continuous semigroup ( C 0 -semigroup) if it satisfies:
(S1) 
(Semigroup property) T ( 0 ) = I (identity operator) and T ( t + s ) = T ( t ) T ( s ) for all t , s 0 .
(S2) 
(Strong continuity) For every x X ,
lim t 0 T ( t ) x x X = 0
holds.
Lemma 47 (Pointwise version of strong continuity: continuity at any t 0 ).
Under Definition 42, for any t 0 0 and any x X ,
lim t t 0 T ( t ) x T ( t 0 ) x X = 0
holds. That is, t T ( t ) x is continuous on [ 0 , ) .
Proof. 
The case t 0 = 0 is exactly (S2). Assume t 0 > 0 . Consider t t 0 . If t < t 0 , set h : = t 0 t 0 . By the semigroup property,
T ( t 0 ) x T ( t ) x = T ( t ) T ( h ) x T ( t ) x = T ( t ) T ( h ) x x .
Hence
T ( t 0 ) x T ( t ) x X T ( t ) T ( h ) x x X .
Similarly, if t > t 0 , set h : = t t 0 0 . Then
T ( t ) x T ( t 0 ) x = T ( t 0 ) T ( h ) x x ,
so
T ( t ) x T ( t 0 ) x X T ( t 0 ) T ( h ) x x X .
Thus it suffices to have T ( h ) x x X 0 by (S2). However, boundedness of T ( t ) appearing above is needed, so we first show that T ( t ) is bounded on [ 0 , t 0 ] .
Step 1 (local boundedness: sup 0 t t 0 T ( t ) < ): Local boundedness is a standard fact for C 0 -semigroups, but we prove it within this paper. For each n N define
E n : = x X : sup 0 t t 0 T ( t ) x X n .
One would show that each E n is closed: indeed, if x k x in · X and x k E n , then for each t [ 0 , t 0 ] , T ( t ) is linear, and strong continuity ensures T ( t ) x is defined for each t. However, to deduce T ( t ) x k T ( t ) x from x k x requires boundedness, so we take a different route: we avoid proving closedness and use Baire’s theorem in the standard uniform-boundedness argument.
To obtain local boundedness without additional assumptions, we invoke the following standard theorem (Banach–Steinhaus) within this paper.
Step 2 (local boundedness via Banach–Steinhaus): Since X is a Banach space and { T ( t ) } 0 t t 0 is a family of linear operators, for each x X the map t T ( t ) x is continuous at t = 0 , hence there exist δ x > 0 and M x < such that
sup 0 t δ x T ( t ) x X M x .
Moreover, by the semigroup property, partitioning [ 0 , t 0 ] into intervals of length δ x yields
sup 0 t t 0 T ( t ) x X <
for each x (without using boundedness of T ( t ) at this stage). Thus the family { T ( t ) } 0 t t 0 is pointwise bounded. By Banach–Steinhaus (the uniform boundedness principle),
sup 0 t t 0 T ( t ) <
follows.
Thus local boundedness is established.
Step 3 (conclusion): As t t 0 , we have h 0 , and by (S2), T ( h ) x x X 0 . By local boundedness, T ( t ) is bounded for t in a neighborhood of t 0 , so the estimates above imply T ( t ) x T ( t 0 ) x X 0 . □
(3)
Definition of the generator: difference-quotient limit and domain
Definition 43 (Generator (infinitesimal generator)).
Let X be a Banach space, and let { T ( t ) } t 0 be a C 0 -semigroup on X.
1.
Define the domain by
Dom ( A ) : = x X : y X such that lim t 0 T ( t ) x x t y X = 0 .
2.
For x Dom ( A ) , the element y obtained by the above limit is unique, and we write it as A x , i.e.,
A x : = lim t 0 T ( t ) x x t ( x Dom ( A ) ) .
This A is called the generator of { T ( t ) } .
Lemma 48 (Uniqueness of the generator value).
The limit defining A x in Definition 43 is unique.
Proof. 
Let x Dom ( A ) and assume that
T ( t ) x x t y , T ( t ) x x t y ( t 0 )
both hold. By uniqueness of limits in a normed space, y = y . Hence A x is unique. □
(4)
Basic properties of the generator: linearity, closedness, and consistency with the semigroup
Lemma 49 (The generator is a linear operator).
The generator A is linear. That is, Dom ( A ) is a linear subspace, and for x 1 , x 2 Dom ( A ) and α , β C , we have α x 1 + β x 2 Dom ( A ) and
A ( α x 1 + β x 2 ) = α A x 1 + β A x 2 .
Proof. 
Let x 1 , x 2 Dom ( A ) . By definition,
T ( t ) x i x i t A x i ( t 0 ) ( i = 1 , 2 ) .
By linearity,
T ( t ) ( α x 1 + β x 2 ) ( α x 1 + β x 2 ) t = α T ( t ) x 1 x 1 t + β T ( t ) x 2 x 2 t .
The right-hand side converges to α A x 1 + β A x 2 as t 0 , so α x 1 + β x 2 Dom ( A ) and the stated equality holds. □
Lemma 50 (Consistency between semigroup and generator: T ( t ) preserves the domain and A T ( t ) x = T ( t ) A x ).
Let x Dom ( A ) and t 0 . Then T ( t ) x Dom ( A ) and
A T ( t ) x = T ( t ) A x
holds.
Proof. 
Let x Dom ( A ) . By the semigroup property, for any h > 0 ,
T ( h ) T ( t ) x T ( t ) x h = T ( t + h ) x T ( t ) x h = T ( t ) T ( h ) x x h .
As h 0 , since x Dom ( A ) , we have T ( h ) x x h A x . On the other hand, by Lemma 47 and local boundedness, T ( t ) is a bounded operator. Therefore we can interchange the limit and T ( t ) , obtaining
lim h 0 T ( h ) T ( t ) x T ( t ) x h = T ( t ) A x .
The left-hand side is, by Definition 43, the definition of A ( T ( t ) x ) , hence T ( t ) x Dom ( A ) and A T ( t ) x = T ( t ) A x . □
Lemma 51 (The generator is closed).
The generator A is closed. That is, if x n Dom ( A ) , x n x , and A x n y (all in · X ), then x Dom ( A ) and A x = y .
Proof. 
Let x n Dom ( A ) with x n x and A x n y . Fix an arbitrary t > 0 . For x n Dom ( A ) , by consistency between semigroup and generator (Lemma 50),
T ( t ) x n x n = 0 t T ( s ) A x n d s
holds (defined as a Bochner integral). We first justify this identity: set g n ( s ) : = T ( s ) x n . Then g n is C 1 with g n ( s ) = T ( s ) A x n (derived from difference quotients using Lemma 50). Hence, by the fundamental theorem of calculus,
T ( t ) x n x n = g n ( t ) g n ( 0 ) = 0 t g n ( s ) d s = 0 t T ( s ) A x n d s ,
i.e. (3.1-∗) holds.
Now take n . Since T ( t ) is a bounded linear operator, T ( t ) x n T ( t ) x . Also x n x . Hence the left-hand side converges to T ( t ) x x .
For the right-hand side, by local boundedness, on [ 0 , t ] we have T ( s ) M t < . Thus
T ( s ) ( A x n y ) X M t A x n y X ,
and the right-hand side converges to 0 as n (since A x n y ). Therefore
0 t T ( s ) A x n d s 0 t T ( s ) y d s
follows (continuity of the Bochner integral: the integrand is dominated by a uniform bound and converges pointwise). Hence
T ( t ) x x = 0 t T ( s ) y d s ( t > 0 ) .
Divide both sides by t and take the limit t 0 . By Lemma 47, T ( s ) y y as s 0 , hence
1 t 0 t T ( s ) y d s y ( t 0 )
(the mean-value limit for a continuous function). Therefore, from (3.1-∗∗),
T ( t ) x x t y ( t 0 ) .
Hence x Dom ( A ) and A x = y . □
(5)
Density of the generator domain (necessary condition) and its use in this paper
In general, the domain of the generator of a C 0 -semigroup is dense. In this paper, since subsequent sections discuss a common core in product formulas, we state density explicitly.
Lemma 52 (The domain of the generator is dense).
Let { T ( t ) } t 0 be a C 0 -semigroup on a Banach space X, and let A be its generator. Then Dom ( A ) ¯ = X holds.
Proof. 
Take arbitrary x X and ε > 0 . As a standard regularization for C 0 -semigroups, define
x λ : = λ 0 e λ t T ( t ) x d t ( λ > 0 )
(as a Bochner integral). The integral converges by local boundedness and the exponential weight e λ t . That x λ Dom ( A ) and A x λ = λ ( x λ x ) follows from a basic semigroup computation (which is proved in general in subsequent sections). Here, to prove density, it suffices to show that
x λ x X 0 ( λ ) .
By strong continuity at t = 0 , for any δ > 0 and sufficiently large λ , T ( t ) x is close to x on 0 t δ . Moreover, e λ t is exponentially small for t δ , so by splitting the integral, x λ x X can be made arbitrarily small. Therefore elements x λ Dom ( A ) approximate x, and the domain is dense. □
(6)
Conclusion of this subsection: the minimal analytical foundation for treating the UEE as a semigroup has been established
In this subsection, we fixed the minimal analytical framework for treating the UEE as a C 0 -semigroup on X. That is, we defined strongly continuous semigroups (Definition 42) and generators (Definition 43), and proved within the paper linearity of generators (Lemma 49), consistency with semigroups (Lemma 50), closedness (Lemma 51), and density of the domain (Lemma 52). In subsequent sections, when constructing the dissipative semigroup and the resonance semigroup and obtaining the total semigroup via product formulas, we use the definitions and lemmas of this subsection as the foundation.
Preprints 193851 i012

3.2. Solution Concept of the UEE

(1)
Aim of this subsection: formulate the UEE as an abstract Cauchy problem and fix the solution concepts (mild/strong/classical) rigorously
In this paper, the Unified Evolution Equation (UEE) is treated as an abstract Cauchy problem on the state space X (in the standard realization, X = T 1 ( H ) ). Since the generator A (later identified as A = L tot ¯ ) generally comes with a domain, a solution concept that requires “ ρ ˙ = A ρ ” pointwise is not sufficient. Accordingly, in this subsection we:
1.
fix the definition of the abstract Cauchy problem (what is being solved),
2.
define and distinguish mild solutions (solutions as semigroup actions), strong solutions (differential equations holding a.e.), and classical solutions (pointwise differential equations),
3.
fully prove within the paper that, when A is the generator of a C 0 -semigroup { T ( t ) } , mild solutions exist uniquely, and that when x 0 Dom ( A ) the mild solution becomes a classical solution (regularization).
Since the contents of this subsection are repeatedly referenced in subsequent sections, we fix them in the form of definitions, lemmas, and theorems.
(2)
UEE as an abstract Cauchy problem (ACP): fixing the problem setting
Definition 44 (Abstract Cauchy problem (ACP)).
Let X be a complex Banach space, and let A be a (generally unbounded) linear operator on X with domain Dom ( A ) X . For an initial value x 0 X and a time interval [ 0 , T ) ( 0 < T ), define the abstract Cauchy problem  ACP ( A , x 0 ) by
d d t x ( t ) = A x ( t ) , x ( 0 ) = x 0
  • Comment (application to the UEE)
In this paper, x ( t ) is regarded as a state ρ ( t ) X (in the standard realization, a density operator), and A is constructed as the closure of the total generator. However, in this subsection, we fix the solution concepts for a general pair ( X , A ) as an analytical foundation.
(3)
Definitions of solution concepts: mild, strong, and classical solutions
Definition 45 (Mild, strong, and classical solutions).
For ACP ( A , x 0 ) in Definition 44, let x : [ 0 , T ) X be a map. Then:
(i) 
Classical solution: If x C 1 ( [ 0 , T ) ; X ) , and for every t [ 0 , T ) one has x ( t ) Dom ( A ) , and (ACP) holds pointwise for each t, then x is called a classical solution.
(ii) 
Strong solution: If x is continuous x C ( [ 0 , T ) ; X ) and moreover x is locally absolutely continuous (i.e., for any 0 < t 1 < t 2 < T , x ( t 2 ) x ( t 1 ) = t 1 t 2 x ˙ ( s ) d s holds in the sense of X-valued Bochner integrals), and there exists a measurable function x ˙ : ( 0 , T ) X such that
x ( t ) = x 0 + 0 t x ˙ ( s ) d s ( 0 < t < T ) , x ( t ) Dom ( A ) a . e . , x ˙ ( t ) = A x ( t ) a . e .
hold, then x is called a strong solution.
(iii) 
Mild solution: If A is the generator of a C 0 -semigroup { T ( t ) } t 0 , then the map given by
x ( t ) : = T ( t ) x 0 ( 0 t < T )
is called a mild solution (existence depends on existence of the semigroup).
Lemma 53 (Classical solution ⇒ strong solution).
A classical solution x satisfying Definition 45-(i) is also a strong solution.
Proof. 
Since x C 1 ( [ 0 , T ) ; X ) , for any 0 < t 1 < t 2 < T ,
x ( t 2 ) x ( t 1 ) = t 1 t 2 x ( s ) d s
holds (the Banach-valued fundamental theorem of calculus; we use Lemma 54 below). By the classical-solution assumption, x ( s ) = A x ( s ) holds for all s, hence also a.e. Thus the conditions of a strong solution are satisfied. □
(4)
Banach-valued fundamental theorem of calculus (a tool to close the paper)
Lemma 54 (Banach-valued fundamental theorem of calculus (the C 1 case)).
Let X be a Banach space and let x C 1 ( [ 0 , T ] ; X ) . Then for any t [ 0 , T ] ,
x ( t ) x ( 0 ) = 0 t x ( s ) d s
holds (the right-hand side is a Bochner integral).
Proof. 
Take a partition 0 = t 0 < t 1 < < t n = t of [ 0 , t ] . It suffices to show, for each subinterval, that
x ( t k ) x ( t k 1 ) = t k 1 t k x ( s ) d s .
Since x is continuous, it is uniformly continuous on [ t k 1 , t k ] . Hence for any ε > 0 , taking a sufficiently fine partition yields
x ( t k ) x ( t k 1 ) j = 1 m x ( ξ j ) Δ s j X < ε
(where { ξ j } are representative points of subintervals and Δ s j their lengths). Defining the Bochner integral as the limit of Riemann sums yields
x ( t k ) x ( t k 1 ) = t k 1 t k x ( s ) d s .
Summing over k = 1 , , n gives
x ( t ) x ( 0 ) = k = 1 n x ( t k ) x ( t k 1 ) = k = 1 n t k 1 t k x ( s ) d s = 0 t x ( s ) d s
(by additivity of the Bochner integral). □
(5)
Regularity of mild solutions: if the initial value lies in Dom ( A ) , the mild solution becomes classical
Hereafter, assume that A is the generator of a C 0 -semigroup { T ( t ) } t 0 (the framework of §3.1). We show rigorously differentiability of the mild solution x ( t ) = T ( t ) x 0 .
Lemma 55 (Semigroup orbits are differentiable at points in the generator domain).
Let A be the generator of a C 0 -semigroup { T ( t ) } t 0 . For x 0 Dom ( A ) and any t 0 ,
d d t T ( t ) x 0 = T ( t ) A x 0
holds. Moreover, T ( t ) x 0 Dom ( A ) and
A T ( t ) x 0 = T ( t ) A x 0
holds.
Proof. 
Take x 0 Dom ( A ) . For h 0 , by the semigroup property,
T ( t + h ) x 0 T ( t ) x 0 h = T ( t ) T ( h ) x 0 T ( t ) x 0 h = T ( t ) T ( h ) x 0 x 0 h .
As h 0 , by Definition 43 (§3.1),
T ( h ) x 0 x 0 h A x 0 in X .
On the other hand, for fixed t, T ( t ) is a bounded linear operator (local boundedness of a C 0 -semigroup). Hence, by continuity, we can move the limit outside the operator:
lim h 0 T ( t + h ) x 0 T ( t ) x 0 h = T ( t ) lim h 0 T ( h ) x 0 x 0 h = T ( t ) A x 0 .
Thus t T ( t ) x 0 is differentiable at each point with derivative T ( t ) A x 0 .
Next we show T ( t ) x 0 Dom ( A ) and A T ( t ) x 0 = T ( t ) A x 0 . As h 0 ,
T ( h ) T ( t ) x 0 T ( t ) x 0 h = T ( t + h ) x 0 T ( t ) x 0 h T ( t ) A x 0 .
The left-hand side is the difference quotient defining A ( T ( t ) x 0 ) in Definition 43, hence T ( t ) x 0 Dom ( A ) and A ( T ( t ) x 0 ) = T ( t ) A x 0 . □
Theorem 10 (If the initial value lies in the domain, the mild solution is a classical solution).
Let A be the generator of a C 0 -semigroup { T ( t ) } t 0 . Let x 0 Dom ( A ) and define x ( t ) : = T ( t ) x 0 . Then x is a classical solution of ACP ( A , x 0 ) and
x ( t ) = x 0 + 0 t A x ( s ) d s ( 0 t < T )
holds.
Proof. 
By Lemma 55, for any t 0 , x ( t ) = T ( t ) x 0 Dom ( A ) and
x ( t ) = d d t T ( t ) x 0 = T ( t ) A x 0 = A x ( t )
hold. Hence x C 1 ( [ 0 , T ) ; X ) and satisfies the condition of Definition 45-(i), so x is a classical solution. The integral form follows by applying Lemma 54 to x:
x ( t ) x ( 0 ) = 0 t x ( s ) d s = 0 t A x ( s ) d s .
(6)
Uniqueness of classical solutions: given the generating semigroup, the solution coincides with the semigroup orbit
Next, we show that when the semigroup { T ( t ) } generated by A is already given, any classical solution coincides with the semigroup orbit. This immediately implies uniqueness of classical solutions.
Theorem 11 (Semigroup representation of classical solutions (hence uniqueness)).
Let A be the generator of a C 0 -semigroup { T ( t ) } t 0 . If x : [ 0 , T ) X is a classical solution of ACP ( A , x 0 ) , then for any t [ 0 , T ) ,
x ( t ) = T ( t ) x 0
holds. Hence, if a classical solution exists, it is unique.
Proof. 
Fix an arbitrary t ( 0 , T ) . Define F : [ 0 , t ] X by
F ( s ) : = T ( t s ) x ( s ) ( 0 s t ) .
Since x is a classical solution, for each s one has x ( s ) Dom ( A ) and x ( s ) = A x ( s ) . By Lemma 55, for y Dom ( A ) the map τ T ( τ ) y is differentiable and satisfies d d τ T ( τ ) y = T ( τ ) A y .
Step 1 (differentiation of F): Fix 0 < s < t and take h sufficiently small. Write the difference quotient as
F ( s + h ) F ( s ) h = T ( t s h ) x ( s + h ) T ( t s ) x ( s ) h ,
and split the right-hand side into two terms:
T ( t s h ) x ( s + h ) T ( t s ) x ( s + h ) h + T ( t s ) x ( s + h ) T ( t s ) x ( s ) h .
For the second term, since T ( t s ) is a bounded linear operator,
T ( t s ) x ( s + h ) T ( t s ) x ( s ) h = T ( t s ) x ( s + h ) x ( s ) h T ( t s ) x ( s ) = T ( t s ) A x ( s )
as h 0 .
The first term is a difference involving T ( τ h ) T ( τ ) with τ : = t s . Since one cannot generally write T ( τ h ) = T ( τ ) T ( h ) (no inverse), we treat it via the standard change of variables using a right-derivative formulation. Because h 0 with h 0 corresponds to a left-sided change, we instead take h negative ( h = η , η 0 ), and reformulate in a naturally right-differentiable form. Accordingly, we use the standard substitution G ( r ) : = T ( r ) x ( t r ) ( r [ 0 , t ] ).
Concretely, let r : = t s , so s = t r , and
F ( s ) = T ( r ) x ( t r ) = : G ( r ) .
Thus F being constant is equivalent to G being constant. Differentiate G with respect to r: for 0 < r < t ,
G ( r + h ) G ( r ) h = T ( r + h ) x ( t r h ) T ( r ) x ( t r ) h .
Split the right-hand side as
T ( r + h ) x ( t r h ) T ( r ) x ( t r h ) h + T ( r ) x ( t r h ) T ( r ) x ( t r ) h .
For the first term, by Lemma 55 (using x ( t r h ) Dom ( A ) ),
T ( r + h ) y T ( r ) y h T ( r ) A y ( h 0 )
holds, so taking y = x ( t r ) as the limit yields that the first term T ( r ) A x ( t r ) . For the second term,
T ( r ) x ( t r h ) x ( t r ) h T ( r ) · x ( t r ) = T ( r ) A x ( t r )
since x is C 1 and x ( t r ) = A x ( t r ) . Thus the two terms cancel, and
lim h 0 G ( r + h ) G ( r ) h = 0 .
Hence G is differentiable on the interval with derivative 0, and therefore G is constant.
Step 3 (identification of the constant value): Since G is constant, G ( r ) = G ( 0 ) . We have G ( 0 ) = T ( 0 ) x ( t ) = x ( t ) , while G ( t ) = T ( t ) x ( 0 ) = T ( t ) x 0 . Therefore x ( t ) = T ( t ) x 0 follows.
Step 4 (uniqueness): If x and y are classical solutions with the same initial value x 0 , then by the above result x ( t ) = T ( t ) x 0 = y ( t ) , hence uniqueness holds. □
(7)
Conclusion of this subsection: the solution concept of the UEE has been fixed based on semigroup theory
In this subsection, we defined the UEE as an abstract Cauchy problem (Definition 44) and rigorously distinguished solution concepts as mild/strong/classical (Definition 45). We further proved that semigroup orbits are differentiable on the generator domain (Lemma 55), and showed that if the initial value lies in the domain then the mild solution becomes a classical solution (Theorem 10). Finally, we proved within the paper that, given the generating semigroup, any classical solution coincides with the semigroup orbit and hence is unique (Theorem 11). Hereafter, this paper proceeds with the standpoint that “solution = mild solution (semigroup action)” as the basic notion, and that one may regularize to a classical solution under domain conditions when needed.
Preprints 193851 i013

3.3. Closure Properties of CPTP Maps

(1)
Aim of this subsection: guarantee within the paper that the CPTP property is not broken by componentwise composition and limit operations
In the main construction of this paper (subsequent sections), one repeatedly composes CPTP maps and then takes a limit n to construct a time-evolution semigroup, as in
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) , T ( n ) ( t ) : = F ( t / n ) n .
Therefore, as an analytical foundation, it is necessary to rigorously establish at least the following:
1.
Compositions and convex combinations of CPTP maps preserve CPTP (algebraic closure).
2.
Pointwise · 1 -limits of sequences of CPTP maps preserve CPTP (topological closure).
3.
Prove within the paper the handling of ampliations and the closedness of the positive cone needed for this.
In this subsection, we prove these completely as maps on X = T 1 ( H ) and fix them so that CPTP-ness can be propagated “mechanically” in subsequent sections.
(2)
Preparations: duality, ampliations, and definitions of CPTP/UCP (minimal form used in this subsection)
Definition 46 (Dual pairing and adjoint map).
Let H be a complex Hilbert space, and set X : = T 1 ( H ) and M : = B ( H ) . Define the dual pairing by
ρ , A : = Tr ( ρ A ) ( ρ X , A M ) .
For a bounded linear map T : X X , define its adjoint map T * : M M by
Tr T ( ρ ) A = Tr ρ T * ( A ) ( ρ X , A M )
(existence and uniqueness are shown in Lemma 56).
Lemma 56 (Existence, uniqueness, and norm estimate of the adjoint map).
In the setting of Definition 46, for any bounded linear map T : X X , there exists a unique bounded linear map T * : M M satisfying (3.3-∗). Moreover,
T * M M = T X X .
Proof. 
X is a Banach space and M is identified with its dual X * (the standard realization fixed in §2.2). Hence every bounded linear map T : X X has a unique Banach adjoint (dual) T * : X * X * satisfying
( T * Φ ) ( ρ ) = Φ ( T ρ ) ( Φ X * , ρ X ) .
Using the identification Φ A ( ρ ) : = Tr ( ρ A ) corresponding to A M , we have
( T * Φ A ) ( ρ ) = Φ A ( T ρ ) = Tr ( T ρ A ) .
On the other hand, by the identification of the dual, there exists a unique T * ( A ) M such that T * Φ A = Φ T * ( A ) , i.e.
Tr ( T ρ A ) = Tr ( ρ T * ( A ) )
for all ρ . This is (3.3-∗). The norm identity follows from the general fact for Banach adjoints that T * = T . □
Definition 47 (Amplification).
For n N , set H n : = C n H and define
X n : = T 1 ( H n ) , M n : = B ( H n ) .
Define the amplification  Id n T : X n X n of T : X X on simple tensors by
( Id n T ) ( σ ρ ) : = σ T ( ρ ) ( σ T 1 ( C n ) , ρ X ) ,
and extend it to all of X n by linear continuous extension (since n is finite, it is well-defined via the standard identification). Similarly, for α : M M define Id n α : M n M n .
Definition 48 (CPTP and UCP (definitions fixed in this subsection)).
Let T : X X be a bounded linear map.
1.
T is completely positive (CP) if for every n N , Id n T : X n X n preserves positivity (the positive cone of X n ).
2.
T is trace-preserving (TP) if for every ρ X , Tr ( T ( ρ ) ) = Tr ( ρ ) holds.
3.
T is CPTP if T is CP and TP.
On the other hand, for α : M M :
1.
α is completely positive (CP) if for every n, Id n α preserves positivity.
2.
α is unital if α ( I ) = I .
3.
α is UCP if it is CP and unital.
(3)
Closedness of the positive cone: positivity is not lost under limits
Lemma 57 (Closedness of the positive cone under trace-norm limits).
Let { X k } k N T 1 ( H ) satisfy X k 0 for all k, and assume X k X 1 0 as k . Then X 0 holds.
Proof. 
Since Y Y 1 (a property of singular values of trace-class operators), we have X k X X k X 1 0 . For any ψ H ,
ψ , ( X k X ) ψ X k X ψ 2 0 .
Hence
ψ , X ψ = lim k ψ , X k ψ 0
(since each X k 0 ) holds for all ψ . Therefore X 0 . □
(4)
Kadison–Schwarz inequality and operator-norm contractivity of UCP (complete proofs)
To prove trace-norm contractivity of CPTP maps, we first establish within the paper operator-norm contractivity of UCP maps.
Lemma 58 (Positive maps are ∗-preserving).
Let α : M M be a positive linear map. Then for any A M ,
α ( A ) = α ( A )
holds.
Proof. 
Take an arbitrary self-adjoint element H = H . By the standard decomposition in a C*-algebra, H can be written as H = H + H with H ± 0 and H + H = 0 . By positivity, α ( H ± ) 0 , and in particular they are self-adjoint. Hence α ( H ) = α ( H + ) α ( H ) is also self-adjoint.
For a general A, decompose A = A + i A with
A : = A + A 2 , A : = A A 2 i .
Since A and A are self-adjoint, the above implies that α ( A ) and α ( A ) are also self-adjoint. Therefore,
α ( A ) = α ( A ) + i α ( A ) = α ( A ) i α ( A ) = α ( A i A ) = α ( A ) ,
where the last equality uses linearity. Hence the claim follows. □
Lemma 59 (Kadison–Schwarz inequality (2-positivity + unitality)).
Assume that α : M M is 2-positive (i.e. Id 2 α preserves positivity) and unital ( α ( I ) = I ). Then for any A M ,
α ( A ) α ( A ) α ( A A )
holds.
Proof. 
Consider the element of the 2 × 2 matrix algebra M 2 ( M ) given by
M : = A A A A I .
Let B : = A I (a 1 × 2 block matrix). Then
B B = A I A I = A A A A I = M ,
so M 0 .
By 2-positivity, Id 2 α preserves positivity, hence
( Id 2 α ) ( M ) = α ( A A ) α ( A ) α ( A ) α ( I ) = α ( A A ) α ( A ) α ( A ) I 0
(using Lemma 58 and unitality).
In general, if a block matrix
X Y Y I 0
holds, then for any v H ,
v Y v , X Y Y I v Y v = v , ( X Y Y ) v 0
(the lower component becomes Y v Y v = 0 and the upper component becomes ( X Y Y ) v ). Hence X Y Y 0 , i.e. Y Y X .
Applying this with X = α ( A A ) and Y = α ( A ) yields α ( A ) α ( A ) α ( A A ) , which is (2.3-KS). □
Lemma 60 (A UCP map is operator-norm contractive).
Let α : M M be UCP (completely positive and unital). Then for any A M ,
α ( A ) A
holds.
Proof. 
Since α is CP, it is in particular 2-positive, so Lemma 59 applies and yields
α ( A ) α ( A ) α ( A A ) .
Both sides are positive operators, so by norm monotonicity,
α ( A ) 2 = α ( A ) α ( A ) α ( A A ) .
On the other hand, 0 A A A A I = A 2 I holds. Since α is positive and unital, it preserves order, hence
0 α ( A A ) A 2 α ( I ) = A 2 I .
Therefore α ( A A ) A 2 . Combining yields
α ( A ) 2 A 2 ,
hence α ( A ) A . □
(5)
Dual representation of the trace norm and trace-norm contractivity of CPTP (complete proofs)
Lemma 61 (Dual representation of the trace norm (characterization by the unit ball)).
For any ρ T 1 ( H ) ,
ρ 1 = sup | Tr ( ρ A ) | : A B ( H ) , A 1
holds.
Proof. 
Step 1 (≤): By the Hölder-type estimate (the basic estimate established in §2.1),
| Tr ( ρ A ) | ρ 1 A
holds. Taking the supremum over A 1 yields
sup A 1 | Tr ( ρ A ) | ρ 1 .
Step 2 (≥): By the polar decomposition, write ρ = U | ρ | (with U a partial isometry). Since a partial isometry satisfies U 1 , A : = U satisfies A 1 . Then
Tr ( ρ A ) = Tr ( U | ρ | U ) = Tr ( | ρ | ) = ρ 1
(by cyclicity of the trace and the property that U U is the identity on the support of | ρ | ), so the supremum is at least ρ 1 . Hence
sup A 1 | Tr ( ρ A ) | ρ 1 .
Combining with Step 1 yields (TN). □
Lemma 62 (The adjoint of a CPTP map is UCP).
Let T : X X be CPTP. Then its adjoint map T * : M M is UCP.
Proof. 
(i) unital:. For any ρ X , substituting A = I into (3.3-∗) yields
Tr ( ρ T * ( I ) ) = Tr ( T ( ρ ) I ) = Tr ( T ( ρ ) ) = Tr ( ρ )
(by TP). Hence Tr ( ρ ( T * ( I ) I ) ) = 0 for all ρ . Since states separate observables (the separation lemma in §2.2), T * ( I ) I = 0 , i.e. T * ( I ) = I .
(ii) CP: Fix any n N and let H n = C n H . Since T is CP, Id n T : X n X n preserves positivity. Let X M n = B ( H n ) be an arbitrary positive operator ( X 0 ), and let Σ X n = T 1 ( H n ) be an arbitrary positive trace-class operator ( Σ 0 ). By trace duality,
Tr ( Id n T ) ( Σ ) X = Tr Σ ( Id n T * ) ( X )
holds (apply Lemma 56 on H n ). The left-hand side is nonnegative since ( Id n T ) ( Σ ) 0 and X 0 . Therefore the right-hand side is nonnegative for all Σ 0 . Applying Lemma 21 (characterization of positivity by trace duality; proved in §2.3) on H n yields
( Id n T * ) ( X ) 0 .
Since X 0 is arbitrary, Id n T * preserves positivity. As n is arbitrary, T * is completely positive.
Thus T * is unital-CP, i.e. UCP. □
Lemma 63 (A CPTP map is trace-norm contractive).
If T : X X is CPTP, then for any ρ X ,
T ( ρ ) 1 ρ 1
holds.
Proof. 
By Lemma 61 and (3.3-∗),
T ( ρ ) 1 = sup A 1 | Tr ( T ( ρ ) A ) | = sup A 1 | Tr ( ρ T * ( A ) ) | .
By Lemma 62, T * is UCP, so by Lemma 60, T * ( A ) A 1 holds. Therefore,
sup A 1 | Tr ( ρ T * ( A ) ) | sup B 1 | Tr ( ρ B ) | = ρ 1
(again by Lemma 61). Hence T ( ρ ) 1 ρ 1 . □
(6)
Algebraic closure: CPTP is preserved under composition and convex combinations
Lemma 64 (CPTP maps are closed under composition).
If S , T : X X are CPTP, then the composition S T is also CPTP.
Proof. (TP)
For any ρ X ,
Tr ( S T ) ( ρ ) = Tr S ( T ( ρ ) ) = Tr ( T ( ρ ) ) = Tr ( ρ ) ,
so TP holds.
(CP) For any n, the amplification satisfies
Id n ( S T ) = ( Id n S ) ( Id n T ) .
Since Id n T and Id n S preserve positivity, their composition preserves positivity. Thus S T is CP. Hence S T is CPTP. □
Lemma 65 (CPTP maps are closed under finite convex combinations).
Let T 1 , , T m : X X be CPTP and let λ 1 , , λ m 0 satisfy k = 1 m λ k = 1 . Then
T : = k = 1 m λ k T k
is CPTP.
Proof. (TP)
By linearity,
Tr ( T ( ρ ) ) = k = 1 m λ k Tr ( T k ( ρ ) ) = k = 1 m λ k Tr ( ρ ) = Tr ( ρ ) .
(CP) For any n,
Id n T = k = 1 m λ k ( Id n T k ) .
Take arbitrary Σ 0 . Then each ( Id n T k ) ( Σ ) 0 . Since the positive cone is convex (convexity of positive operators), the convex combination k λ k ( Id n T k ) ( Σ ) is also positive. Hence Id n T preserves positivity, so T is CP. Therefore T is CPTP. □
(7)
Topological closure: CPTP is preserved under pointwise · 1 -limits (main theorem)
Theorem 12 (Closure of CPTP maps under pointwise · 1 -limits).
Let { T k } k N be a sequence of CPTP maps on X. Assume that there exists a linear map T : X X such that for every ρ X ,
T k ( ρ ) T ( ρ ) 1 0 ( k )
holds. Then T is CPTP.
Proof. 
Step 1 (boundedness): Since each T k is CPTP, by Lemma 63 we have T k ( ρ ) 1 ρ 1 . By the assumption (3.3-LIM) and lower semicontinuity,
T ( ρ ) 1 = lim k T k ( ρ ) 1 ρ 1 .
Hence T is bounded on X and T 1 1 1 .
Step 2 (TP): Since the trace is · 1 -continuous,
Tr ( T ( ρ ) ) = lim k Tr ( T k ( ρ ) ) = lim k Tr ( ρ ) = Tr ( ρ ) ,
so T is TP.
Step 3 (convergence on ampliations): Fix an arbitrary n N and consider X n = T 1 ( H n ) . Take an arbitrary Σ X n . Since C n is finite-dimensional, using the standard basis { e i } i = 1 n and matrix units E i j : = | e i e j | , we can write
Σ = i , j = 1 n E i j σ i j ( σ i j X )
(e.g. define σ i j : = ( e i | I ) Σ ( | e j I ) ). By definition,
( Id n T k ) ( Σ ) ( Id n T ) ( Σ ) = i , j = 1 n E i j T k ( σ i j ) T ( σ i j ) .
By the triangle inequality for the trace norm and E i j 1 = 1 (finite-dimensional),
( Id n T k ) ( Σ ) ( Id n T ) ( Σ ) 1 i , j = 1 n T k ( σ i j ) T ( σ i j ) 1 .
For each σ i j X , the assumption (3.3-LIM) implies that each term on the right tends to 0 as k , and since the sum is finite, the entire right-hand side tends to 0. Therefore,
( Id n T k ) ( Σ ) ( Id n T ) ( Σ ) in · 1 .
Step 4 (CP): Let Σ X n be an arbitrary positive operator ( Σ 0 ). Since each T k is CP, ( Id n T k ) ( Σ ) 0 holds for all k. By (3.3-AMP), ( Id n T k ) ( Σ ) ( Id n T ) ( Σ ) in · 1 . Applying Lemma 57 on H n yields that the limit ( Id n T ) ( Σ ) is also positive. Hence Id n T preserves positivity. Since n was arbitrary, T is CP.
Together with Step 2, T is CPTP. □
(8)
Conclusion of this subsection: closure of CPTP (composition, convex combination, and limits) has been established within the paper
In this subsection, we fixed within the paper, with sufficient strength for semigroup construction, that CPTP maps are stable under componentwise composition and limit operations. In particular, we established (i) closure under composition (Lemma 64) and finite convex combinations (Lemma 65), and (ii) closure under pointwise · 1 -limits (Theorem 12). The proof is based on convergence on ampliations (Step 3) and closedness of the positive cone (Lemma 57). Henceforth, once one shows that “the components are CPTP,” it is guaranteed that the map obtained by the composite limit is automatically CPTP.
Preprints 193851 i014

3.4. Exponential Semigroups of Bounded Generators

(1)
Aim of this subsection: for a bounded generator A B ( X ) , fully prove within the paper that the exponential semigroup e t A yields a C 0 -semigroup
In this paper, the dissipative generator L Δ is constructed under the minimal specification (finite-sum GKLS), and as a result L Δ becomes a bounded linear operator on the state space X = T 1 ( H ) . For bounded generators, semigroup construction can be given explicitly by the exponential series e t A without using abstract generator theorems. In this subsection, since it is needed in subsequent sections, we establish the following in a self-contained manner within the paper:
1.
For any Banach space X and any bounded linear operator A B ( X ) , the exponential series
e t A : = k = 0 t k k ! A k
converges absolutely in B ( X ) .
2.
{ e t A } t 0 is a C 0 -semigroup, its generator is A, and the domain is the whole space X.
3.
Provide explicit convergence estimates and continuity (growth) estimates, giving bounds needed for compatibility with product formulas (Chernoff/Trotter).
This subsection is part of the “analytical foundations” and is necessary to close, without external references, the construction of the dissipative semigroup T Δ ( t ) = e t L Δ in subsequent sections.
(2)
Convergence of the exponential series: absolute convergence in B ( X )
Lemma 66 (Absolute convergence of the exponential series and a basic bound).
Let X be a Banach space and let A B ( X ) be a bounded linear operator. Then for any t 0 the series
k = 0 t k k ! A k
converges absolutely in the operator norm of B ( X ) , and
k = 0 t k k ! A k k = 0 t k k ! A k = e t A
holds. Hence e t A B ( X ) is well-defined.
Proof. 
By submultiplicativity A k A k and the triangle inequality, for the partial sum S N ( t ) : = k = 0 N t k k ! A k we have
S N ( t ) k = 0 N t k k ! A k k = 0 N t k k ! A k .
The right-hand side converges to e t A as N , so { S N ( t ) } is norm bounded. Moreover, for the difference S N + M ( t ) S N ( t ) = k = N + 1 N + M t k k ! A k ,
S N + M ( t ) S N ( t ) k = N + 1 N + M t k k ! A k k = N + 1 ( t A ) k k ! N 0 .
Hence { S N ( t ) } is Cauchy in B ( X ) . Since B ( X ) is a Banach space, the limit exists and the series converges in operator norm. The bound is as stated above. □
(3)
Definition of the exponential semigroup: T A ( t ) : = e t A
Definition 49 (Exponential semigroup (bounded generator)).
Let X be a Banach space and let A B ( X ) be a bounded linear operator. By Lemma 66, e t A B ( X ) is defined, so we set
T A ( t ) : = e t A ( t 0 ) .
The family { T A ( t ) } t 0 is called the exponential semigroup of A.
(4)
Semigroup property: T A ( t + s ) = T A ( t ) T A ( s ) and T A ( 0 ) = I (complete proof)
Lemma 67 (Semigroup property of the exponential semigroup).
The family T A ( t ) in Definition 49 satisfies
T A ( 0 ) = I , T A ( t + s ) = T A ( t ) T A ( s ) ( t , s 0 ) .
Proof. 
First, for T A ( 0 ) , by the series definition,
T A ( 0 ) = k = 0 0 k k ! A k = I
(only the k = 0 term remains).
Next, we prove the semigroup property by computing products of partial sums and taking limits. Let S N ( t ) : = k = 0 N t k k ! A k . Then
S N ( t ) S N ( s ) = k = 0 N = 0 N t k s k ! ! A k + .
Grouping by m = k + , for 0 m 2 N ,
S N ( t ) S N ( s ) = m = 0 2 N k = max ( 0 , m N ) min ( m , N ) t k s m k k ! ( m k ) ! A m .
On the other hand, the binomial-coefficient identity
( t + s ) m m ! = k = 0 m t k s m k k ! ( m k ) !
holds, so in the limit N the inner sum agrees with ( t + s ) m m ! .
To justify this, first take the norm limit:
T A ( t ) T A ( s ) = lim N S N ( t ) · lim N S N ( s ) = lim N S N ( t ) S N ( s ) ,
since multiplication in B ( X ) is continuous: B C B C B B C + B C C . By Lemma 66, S N ( t ) T A ( t ) and S N ( s ) T A ( s ) in norm, and S N ( t ) , S N ( s ) are uniformly bounded, so the interchange above is justified.
Next, show that the limit of S N ( t ) S N ( s ) equals T A ( t + s ) . Write
S N ( t ) S N ( s ) = m = 0 2 N c m , N ( t , s ) A m , c m , N ( t , s ) : = k = max ( 0 , m N ) min ( m , N ) t k s m k k ! ( m k ) ! .
For fixed m, if N m , then
c m , N ( t , s ) = k = 0 m t k s m k k ! ( m k ) ! = ( t + s ) m m ! .
Hence
lim N S N ( t ) S N ( s ) = m = 0 ( t + s ) m m ! A m = T A ( t + s ) ,
where the final infinite sum converges in norm by Lemma 66. Therefore T A ( t + s ) = T A ( t ) T A ( s ) . □
(5)
Strong continuity: t T A ( t ) x is continuous (complete proof)
Lemma 68 (Strong continuity of the exponential semigroup).
T A ( t ) = e t A is a strongly continuous semigroup on X. That is, for any x X ,
lim t 0 T A ( t ) x x X = 0
holds.
Proof. 
Take an arbitrary x X . By the series representation,
T A ( t ) x x = k = 1 t k k ! A k x .
Taking norms and using the triangle inequality together with A k x A k x yields
T A ( t ) x x k = 1 t k k ! A k x = e t A 1 x .
The right-hand side tends to 0 as t 0 , hence the claim follows. □
(6)
Identification of the generator: the generator of the exponential semigroup is A and the domain is the whole space
Theorem 13 (The generator of the exponential semigroup is A).
Let A B ( X ) and set T A ( t ) : = e t A . Then the generator (Definition 43) of { T A ( t ) } t 0 is A, and
Dom ( A gen ) = X , A gen = A
holds.
Proof. 
Since A is defined on all of X, it suffices to show that Dom ( A gen ) = X . Take an arbitrary x X . Expand the difference quotient by the series:
T A ( t ) x x t = 1 t k = 0 t k k ! A k x x = k = 1 t k 1 k ! A k x = A x + k = 2 t k 1 k ! A k x .
Hence
T A ( t ) x x t A x k = 2 t k 1 k ! A k x k = 2 t k 1 k ! A k x = A 2 x k = 2 ( t A ) k 2 k ! t .
More coarsely,
T A ( t ) x x t A x x k = 2 t k 1 k ! A k = x e t A 1 t A t .
The right-hand side tends to 0 as t 0 (from the Taylor expansion e u = 1 + u + o ( u ) ). Therefore,
lim t 0 T A ( t ) x x t = A x
holds. Hence every x X belongs to the generator domain and the generator equals A. □
(7)
Growth bounds and Lipschitz-type bounds (used for product formulas in subsequent sections)
Lemma 69 (Growth bound: T A ( t ) e t A ).
For any t 0 ,
T A ( t ) e t A
holds.
Proof. 
Use directly the bound in Lemma 66:
T A ( t ) = k = 0 t k k ! A k k = 0 t k k ! A k = e t A .
Lemma 70 (Lipschitz-type bound in time (local)).
For any t , s 0 and any x X ,
T A ( t ) x T A ( s ) x | t s | A e max { t , s } A x
holds.
Proof. 
Let h : = t s . By the semigroup property,
T A ( t ) T A ( s ) = T A ( s ) T A ( h ) I
(in the case t s ; the case t < s is symmetric). Hence
T A ( t ) x T A ( s ) x T A ( s ) T A ( h ) I x .
By Lemma 69, T A ( s ) e s A . Also,
T A ( h ) I = k = 1 h k k ! A k ,
so
T A ( h ) I k = 1 | h | k k ! A k = e | h | A 1 | h | A e | h | A
(using e u 1 u e u for u 0 ). Therefore,
T A ( t ) x T A ( s ) x e s A | t s | A e | t s | A x | t s | A e max { t , s } A x ,
where the last step uses s + | t s | max { t , s } . □
(8)
Conclusion of this subsection: a bounded generator automatically yields a C 0 -semigroup via the exponential, and the generator coincides
In this subsection, we fully proved within the paper that for a bounded generator A B ( X ) , the exponential semigroup T A ( t ) = e t A yields a C 0 -semigroup, its generator coincides with A, and the domain is the whole space (Lemma 66, Lemma 67, Lemma 68, Theorem 13). We also provided growth and time-Lipschitz-type bounds, forming the foundation for dissipative semigroup construction and product-formula application in subsequent sections (Lemma 69, Lemma 70).
Preprints 193851 i015

3.5. CPTP Group by Unitary Conjugation

(1)
Aim of this subsection: fix the reversible component as a “unitary conjugation channel,” and establish within the paper the CPTP group property and · 1 strong continuity
In this subsection, as the time evolution responsible for the reversible (unitary) component of the UEE, we introduce the conjugation by a unitary group { U ( t ) } t R on the Hilbert space H ,
T 0 ( t ) [ ρ ] : = U ( t ) ρ U ( t ) ( ρ T 1 ( H ) ) ,
and completely prove within the paper the following:
1.
For each t R , T 0 ( t ) is CPTP (completely positive and trace-preserving).
2.
{ T 0 ( t ) } t R forms a group (invertible) and is trace-norm isometric, T 0 ( t ) ρ 1 = ρ 1 .
3.
If { U ( t ) } is strongly continuous on H , then { T 0 ( t ) } is · 1 -strongly continuous on T 1 ( H ) (a property needed for componentwise composition in § 6 ).
This guarantees that the reversible part can henceforth be treated as a CPTP group within the semigroup-theoretic framework.
(2)
Setting: unitary group and conjugation actions
Definition 50 (Unitary group and conjugation actions (state side and observable side)).
Let H be a complex Hilbert space, and set
X : = T 1 ( H ) , M : = B ( H ) .
Let { U ( t ) } t R B ( H ) be a unitary group, i.e. a family satisfying
U ( t + s ) = U ( t ) U ( s ) , U ( 0 ) = I , U ( t ) = U ( t ) ( t , s R ) .
1.
(State side) Define T 0 ( t ) : X X by
T 0 ( t ) [ ρ ] : = U ( t ) ρ U ( t ) ( ρ X ) .
2.
(Observable side) Define α t : M M by
α t ( A ) : = U ( t ) A U ( t ) ( A M ) .
(3)
Lemma (cyclicity of the trace): the minimal fact needed to prove trace preservation
Lemma 71 (Cyclicity of the trace (bounded × trace class)).
Let A B ( H ) and ρ T 1 ( H ) . Then A ρ , ρ A T 1 ( H ) , and
Tr ( A ρ ) = Tr ( ρ A ) holds .
Proof. 
Step 1 (finite-rank case): First assume ρ F ( H ) (finite rank). Since ρ can be written as a finite sum ρ = k = 1 N | ψ k ϕ k | , we have
A ρ = k = 1 N | A ψ k ϕ k | , ρ A = k = 1 N | ψ k A ϕ k | ,
and both are finite rank. By the trace definition on finite rank, Tr ( | ψ ϕ | ) = ϕ , ψ , we obtain
Tr ( A ρ ) = k = 1 N Tr | A ψ k ϕ k | = k = 1 N ϕ k , A ψ k , Tr ( ρ A ) = k = 1 N Tr | ψ k A ϕ k | = k = 1 N A ϕ k , ψ k = k = 1 N ϕ k , A ψ k .
Hence Tr ( A ρ ) = Tr ( ρ A ) .
Step 2 (extension to general trace class): For a general ρ T 1 ( H ) , by Definition 22 ( T 1 is the completion of finite rank), there exists a sequence ρ n F ( H ) with ρ n ρ 1 0 . By Lemma 17 (stability under two-sided multiplication),
A ( ρ n ρ ) 1 A ρ n ρ 1 0 , ( ρ n ρ ) A 1 A ρ n ρ 1 0 ,
so A ρ n A ρ and ρ n A ρ A in · 1 . Since the trace is · 1 -continuous (Lemma 16),
Tr ( A ρ ) = lim n Tr ( A ρ n ) = lim n Tr ( ρ n A ) = Tr ( ρ A ) ,
where the last equality uses Step 1. This proves cyclicity. Also A ρ , ρ A T 1 follows from Lemma 17. □
(4)
Lemma 3.8: unitary conjugation is CPTP and forms a CPTP group
Lemma 72 (Unitary conjugation is CPTP (and a group)).
For T 0 ( t ) : X X in Definition 50, T 0 ( t ) is CPTP for any t R . Moreover, { T 0 ( t ) } t R forms a group, and
T 0 ( t + s ) = T 0 ( t ) T 0 ( s ) , T 0 ( 0 ) = Id , T 0 ( t ) 1 = T 0 ( t )
hold.
Proof. Step 1 (group property): 
For any ρ X ,
T 0 ( t + s ) [ ρ ] = U ( t + s ) ρ U ( t + s ) = U ( t ) U ( s ) ρ U ( s ) U ( t ) = T 0 ( t ) T 0 ( s ) [ ρ ] ,
hence T 0 ( t + s ) = T 0 ( t ) T 0 ( s ) . Also T 0 ( 0 ) [ ρ ] = U ( 0 ) ρ U ( 0 ) = ρ , so T 0 ( 0 ) = Id . Since U ( t ) = U ( t ) , we have T 0 ( t ) T 0 ( t ) = Id , hence the inverse map is T 0 ( t ) .
Step 2 (TP: trace preservation): Using Lemma 71 and U ( t ) U ( t ) = I ,
Tr T 0 ( t ) [ ρ ] = Tr U ( t ) ρ U ( t ) = Tr ρ U ( t ) U ( t ) = Tr ( ρ )
holds for any ρ X . Hence T 0 ( t ) is TP.
Step 3 (CP: complete positivity): Fix an arbitrary n N and set H n : = C n H . Then U ˜ ( t ) : = I n U ( t ) is unitary on H n . For any Σ T 1 ( H n ) ,
( Id n T 0 ( t ) ) [ Σ ] = U ˜ ( t ) Σ U ˜ ( t )
holds (it holds on simple tensors and extends to general elements by linear continuous extension). If Σ 0 , then for any ξ H n ,
ξ , ( Id n T 0 ( t ) ) [ Σ ] ξ = ξ , U ˜ Σ U ˜ ξ = U ˜ ξ , Σ U ˜ ξ 0 ,
so ( Id n T 0 ( t ) ) [ Σ ] 0 . Since n was arbitrary, T 0 ( t ) is completely positive.
Together with Step 2, T 0 ( t ) is CPTP. □
(5)
Trace-norm isometry: T 0 ( t ) ρ 1 = ρ 1
Lemma 73 (Unitary conjugation is trace-norm isometric).
For any t R and any ρ T 1 ( H ) ,
T 0 ( t ) [ ρ ] 1 = ρ 1
holds.
Proof. 
Take an arbitrary ρ T 1 ( H ) . Let | ρ | : = ( ρ ρ ) 1 / 2 . First,
T 0 ( t ) [ ρ ] T 0 ( t ) [ ρ ] = ( U ρ U ) ( U ρ U ) = U ρ ρ U = U | ρ | 2 U ,
hence
T 0 ( t ) [ ρ ] = U | ρ | 2 U 1 / 2 = U | ρ | U
(using uniqueness of the square root of a positive operator and the fact that U is unitary). Therefore, by Lemma 71 and U U = I ,
T 0 ( t ) [ ρ ] 1 = Tr | T 0 ( t ) [ ρ ] | = Tr ( U | ρ | U ) = Tr ( | ρ | U U ) = Tr ( | ρ | ) = ρ 1 .
(6)
Lemma 3.9: · 1 strong continuity on T 1 ( H )
Lemma 74 (Strong continuity on T 1 ( H ) ).
Assume that { U ( t ) } t R is strongly continuous on H . Then T 0 ( t ) : T 1 ( H ) T 1 ( H ) in Definition 50 is · 1 -strongly continuous. That is, for any ρ T 1 ( H ) ,
lim t 0 T 0 ( t ) [ ρ ] ρ 1 = 0
holds.
Proof. Step 1 (estimate for rank-one operators): 
For ψ , ϕ H , let ρ : = | ψ ϕ | . Then
T 0 ( t ) [ ρ ] = | U ( t ) ψ U ( t ) ϕ | .
Decompose the difference as
| U ψ U ϕ | | ψ ϕ | = | U ψ | ψ U ϕ | + | ψ U ϕ | ϕ |
(which is verified by expanding the right-hand side). Since the trace norm of a rank-one operator is | a b | 1 = a b (a calculation isomorphic to Lemma 13), by the triangle inequality and unitarity U ( t ) ϕ = ϕ ,
T 0 ( t ) [ ρ ] ρ 1 U ( t ) ψ ψ U ( t ) ϕ + ψ U ( t ) ϕ ϕ = U ( t ) ψ ψ ϕ + ψ U ( t ) ϕ ϕ .
By strong continuity on H , the right-hand side tends to 0 as t 0 . Hence the claim holds for rank one.
Step 2 (extension to finite rank): For a finite-rank operator ρ = k = 1 N | ψ k ϕ k | , by linearity and the triangle inequality,
T 0 ( t ) [ ρ ] ρ 1 k = 1 N T 0 ( t ) [ | ψ k ϕ k | ] | ψ k ϕ k | 1 0 ( t 0 ) ,
since each term tends to 0 by Step 1 and the sum is finite so limits and sums can be interchanged.
Step 3 (extension to general trace class): Take an arbitrary ρ T 1 ( H ) and ε > 0 . Since finite-rank operators are dense in T 1 (Definition 22), choose a finite-rank ρ ε such that
ρ ρ ε 1 < ε .
By Lemma 73, T 0 ( t ) is isometric, hence
T 0 ( t ) [ ρ ρ ε ] 1 = ρ ρ ε 1 < ε .
Therefore, by the triangle inequality,
T 0 ( t ) [ ρ ] ρ 1 T 0 ( t ) [ ρ ρ ε ] 1 + T 0 ( t ) [ ρ ε ] ρ ε 1 + ρ ε ρ 1 < 2 ε + T 0 ( t ) [ ρ ε ] ρ ε 1 .
By Step 2, T 0 ( t ) [ ρ ε ] ρ ε 1 0 as t 0 , so for sufficiently small t the right-hand side is less than 3 ε . Since ε > 0 is arbitrary, T 0 ( t ) [ ρ ] ρ 1 0 follows. □
(7)
Conclusion of this subsection: the reversible component has been fixed as a CPTP group and properties needed for componentwise composition in § 6 have been secured
In this subsection, we introduced the conjugation action T 0 ( t ) of states by the unitary group { U ( t ) } t R and proved within the paper: (i) T 0 ( t ) is CPTP at each time (Lemma 72), (ii) it satisfies the group (invertibility) property (the same lemma), (iii) it is trace-norm isometric (Lemma 73), and (iv) if { U ( t ) } is strongly continuous on H then { T 0 ( t ) } is · 1 -strongly continuous on T 1 ( H ) (Lemma 74). Thus, the reversible part can henceforth be treated as a “CPTP group (isometric and strongly continuous)” and safely incorporated as a component in componentwise composition.
Preprints 193851 i016

3.6. Chernoff/Trotter-Type Product Formulas

(1)
Aim of this subsection: establish within the paper the “tool theorem” ensuring that the componentwise composite limit yields a semigroup
In the core construction of this paper, using a family of contractive (in particular CPTP) maps F ( t ) , we define
T ( n ) ( t ) : = F ( t / n ) n
and identify the time-evolution semigroup by taking the limit as n . Therefore, the aim of this subsection consists of the following two points:
1.
When a contractive family F ( t ) is tangent to a generator A, provide a complete proof that
lim n F ( t / n ) n
coincides with a (known) C 0 -semigroup (Chernoff-type product formula).
2.
In particular, when F ( t ) is given as a product of several semigroups F ( t ) = T 1 ( t ) T m ( t ) , show that the tangency condition reduces to the sum of generators A 1 + + A m (Trotter-type), and shape the result in a form directly applicable to subsequent componentwise composition ( § 6 ).
Since this subsection is part of the analytical foundations, we define clearly the applicability conditions of the theorem (contractivity, tangency condition, core), and the proof is developed line by line without gaps.
(2)
Definitions: contraction semigroups, contraction families, and the Chernoff tangency condition
Definition 51 (Contraction C 0 -semigroup).
Let X be a Banach space and let { T ( t ) } t 0 B ( X ) be a C 0 -semigroup (Definition 42). We say that { T ( t ) } is a contraction semigroup if
T ( t ) X X 1 ( t 0 )
holds.
Definition 52 (Contraction family (Chernoff approximating family)).
Let X be a Banach space. A map F : [ 0 , ) B ( X ) is called a contraction family if it satisfies
F ( 0 ) = I , F ( t ) X X 1 ( t 0 ) , lim t 0 F ( t ) x x X = 0 ( x X )
(the last condition is strong continuity at t = 0 ).
Definition 53 (Core and Chernoff tangency condition).
Let { T ( t ) } t 0 be a contraction C 0 -semigroup and let A be its generator (Definition 43). A subset D Dom ( A ) is called a core of A if D is dense in Dom ( A ) with respect to the graph norm
x A : = x X + A x X
and the closure of the restriction A | D coincides with A (i.e. A | D ¯ = A ). We say that a contraction family F is tangent to A (Chernoff tangency condition) if
lim t 0 F ( t ) x x t A x X = 0 ( x D )
holds.
(3)
Preparations: completeness of the graph-norm space and the uniform boundedness principle (used in this paper)
Lemma 75 (Completeness of the graph norm for a closed operator).
Let A be a closed operator on a Banach space X (closed in the sense of Definition 43). Then ( Dom ( A ) , · A ) is a Banach space.
Proof. 
Let { x n } Dom ( A ) be Cauchy in · A . Then x n x m X x n x m A implies that { x n } is Cauchy in X, hence converges to some x X . Similarly, A x n A x m X x n x m A implies that { A x n } is Cauchy in X, hence converges to some y X . Since A is closed, x n x and A x n y imply x Dom ( A ) and A x = y . Moreover,
x n x A = x n x X + A x n A x X 0 ,
so ( Dom ( A ) , · A ) is complete. □
Lemma 76 (Uniform boundedness principle (Banach–Steinhaus)).
Let Y be a Banach space and Z a normed space, and let { S λ } λ Λ B ( Y , Z ) be a family of operators. If for each y Y ,
sup λ Λ S λ y Z <
holds (pointwise boundedness), then
sup λ Λ S λ Y Z <
holds.
Proof. 
For each n N , define
E n : = y Y : sup λ Λ S λ y Z n .
By assumption, n = 1 E n = Y . Each E n is closed: indeed, let y k y in the norm of Y with y k E n . For any λ , S λ is continuous, hence S λ y k S λ y . Thus S λ y Z = lim k S λ y k Z n . Since λ is arbitrary, y E n .
Since Y is complete, by Baire’s theorem, there exists n 0 such that E n 0 has a nonempty interior. Hence there exist y 0 Y and r > 0 such that
B Y ( y 0 , r ) : = { y Y : y y 0 Y < r } E n 0 .
For any y Y < r , we have y 0 + y B Y ( y 0 , r ) , hence
sup λ S λ ( y 0 + y ) Z n 0 , sup λ S λ y 0 Z n 0 .
By linearity, S λ ( y ) = S λ ( y 0 + y ) S λ ( y 0 ) , so
S λ y Z S λ ( y 0 + y ) Z + S λ y 0 Z 2 n 0 ( λ , y Y < r ) .
For any nonzero y Y , set y ˜ : = r y / ( 2 y Y ) . Then y ˜ Y < r , so
S λ y ˜ Z 2 n 0 S λ y Z 4 n 0 r y Y .
Hence S λ Y Z 4 n 0 / r for all λ , and the supremum is finite. □
(4)
Boundedness of difference quotients for contraction semigroups and graph-norm continuity of orbits
Lemma 77 (Difference-quotient representation and boundedness for a contraction semigroup).
Let { T ( t ) } be a contraction C 0 -semigroup and let A be its generator. For any x Dom ( A ) and any t > 0 ,
T ( t ) x x = 0 t T ( s ) A x d s
(Bochner integral) holds. Hence the difference quotient
P t x : = T ( t ) x x t
satisfies
P t x X A x X x A ( t > 0 ) .
Proof. 
Let x Dom ( A ) . By Lemma 50 in § 3 . 1 , t T ( t ) x is differentiable in X and
d d t T ( t ) x = T ( t ) A x ( t 0 )
holds. Applying the Banach-valued fundamental theorem of calculus (Lemma 54) on [ 0 , t ] yields
T ( t ) x x = 0 t T ( s ) A x d s .
Since T ( s ) 1 by contractivity,
T ( t ) x x t X 1 t 0 t T ( s ) A x X d s 1 t 0 t A x X d s = A x X .
Finally, A x X x A is immediate from the definition. □
Lemma 78 
(Graph-norm continuity of orbits and compactness). Let { T ( t ) } be a C 0 -semigroup with generator A. For any x Dom ( A ) and any t 0 > 0 , the map
[ 0 , t 0 ] s T ( s ) x ( Dom ( A ) , · A )
is continuous. Consequently, the set
K x , t 0 : = { T ( s ) x : 0 s t 0 } ( Dom ( A ) , · A )
is compact.
Proof. 
Dom ( A ) is invariant under T ( s ) and A T ( s ) x = T ( s ) A x holds (Lemma 50). Thus for any s , s 0 [ 0 , t 0 ] ,
T ( s ) x T ( s 0 ) x A = T ( s ) x T ( s 0 ) x X + A T ( s ) x A T ( s 0 ) x X
= T ( s ) x T ( s 0 ) x X + T ( s ) A x T ( s 0 ) A x X .
By strong continuity of a C 0 -semigroup, the first term tends to 0 as s s 0 , and similarly the second term tends to 0 as s s 0 since A x X . Hence s T ( s ) x is continuous in the graph norm.
Since [ 0 , t 0 ] is compact, its continuous image K x , t 0 is compact. □
(5)
Obtaining “uniform estimates” from the tangency condition: a uniform convergence lemma on compact sets
Lemma 79 
(Uniform convergence on compact sets for uniformly bounded operator sequences). Let Y be a Banach space and Z a normed space, and let { B n } B ( Y , Z ) satisfy
sup n B n Y Z < and B n y 0 ( n ) ( y K )
where K Y is compact. Then
sup y K B n y Z 0 ( n )
holds.
Proof. 
We argue by contradiction. If the conclusion fails, then there exist ε > 0 , a subsequence { n j } , and a sequence { y j } K such that
B n j y j Z ε ( j ) .
Since K is compact, passing to a further subsequence (still indexed by j) we may assume y j y in the norm of Y for some y K . Let M : = sup n B n Y Z < by uniform boundedness. Then
B n j y j Z B n j ( y j y ) Z + B n j y Z M y j y Y + B n j y Z .
The first term tends to 0 as j . The second term tends to 0 since B n j y 0 by assumption. Hence B n j y j Z 0 , contradicting B n j y j Z ε . Therefore the conclusion holds. □
(6)
Main theorem: Chernoff-type product formula (tool theorem)
Theorem 14 (Chernoff-type product formula (tool theorem)).
Let X be a Banach space and let { T ( t ) } t 0 be a contraction C 0 -semigroup (Definition 51). Let A be its generator, and let D Dom ( A ) be a core of A (Definition 53). Let F be a contraction family (Definition 52) and assume that the Chernoff tangency condition (CT) holds on D. Then for any t 0 and any x X , the strong limit
lim n F ( t / n ) n x = T ( t ) x
holds.
Proof. Step 0 (preparation: the graph-norm space): 
Since A is the generator of a C 0 -semigroup, A is closed (Lemma 51), and by Lemma 75, Y : = ( Dom ( A ) , · A ) is a Banach space.
Step 1 (uniform boundedness of the difference-quotient family: F): Fix an arbitrary 0 < t 0 1 and for 0 < t t 0 define
Q t : Y X , Q t x : = F ( t ) x x t
(since F ( t ) is bounded on X, Q t is linear on Y). For each x D , by the tangency condition Q t x A x as t 0 , so for sufficiently small t, Q t x X A x X + 1 , hence sup 0 < t t 0 Q t x X X < . On the other hand, for general x Y , since F ( t ) is contractive,
Q t x X = F ( t ) x x t X F ( t ) x X + x X t 2 x X t 2 x A t ,
and on the range t [ t 0 / 2 , t 0 ] , Q t x X 4 t 0 x A . Therefore for any x Y ,
sup 0 < t t 0 Q t x X <
holds (for small t, approximate x by elements of D; for larger t, the coarse bound above suffices). Applying the uniform boundedness principle (Lemma 76) to { Q t } 0 < t t 0 B ( Y , X ) , we obtain a constant M t 0 < such that
sup 0 < t t 0 Q t Y X M t 0 .
Step 2 (uniform boundedness of the difference-quotient family: T): By Lemma 77,
P t : Y X , P t x : = T ( t ) x x t
satisfies P t x X A x X x A . Hence
sup 0 < t t 0 P t Y X 1 .
Step 3 (uniform small o ( t ) on compact sets: F ( t ) T ( t ) ): Let E t : = Q t A and R t : = P t A . Then on D,
E t x = F ( t ) x x t A x 0 , R t x = T ( t ) x x t A x 0 ( t 0 )
hold (the former by tangency, the latter by the definition of the generator). By (3.6-UBF) and (3.6-UBT), { E t } 0 < t t 0 and { R t } 0 < t t 0 are uniformly bounded as maps Y X . Since the core D is dense in Y, we can extend E t y 0 and R t y 0 to all y Y : indeed, take any y Y and choose y m D with y m y A 0 . By uniform boundedness,
E t y X E t ( y y m ) X + E t y m X sup 0 < u t 0 E u Y X y y m A + E t y m X .
Taking m first makes the first term 0, and then letting t 0 makes the second term 0. Thus E t y 0 . The same argument applies to R t .
Now fix x Dom ( A ) and take any t > 0 . By Lemma 78,
K x , t : = { T ( s ) x : 0 s t } Y
is compact. Applying Lemma 79 to B n : = E t / n yields
sup y K x , t E t / n y X 0 ( n ) .
Similarly,
sup y K x , t R t / n y X 0 ( n ) .
Therefore,
ε n ( x , t ) : = sup y K x , t F ( t / n ) y T ( t / n ) y t / n X = sup y K x , t E t / n y R t / n y X
sup y K x , t E t / n y X + sup y K x , t R t / n y X 0 .
Step 4 (a desirable decomposition of the difference of powers): We show that for S , B B ( X ) ,
S n B n = k = 0 n 1 S n 1 k ( S B ) B k
holds. The case n = 1 is trivial. Assume it holds for n. Then
S n + 1 B n + 1 = S n + 1 S n B + S n B B n + 1 = S n ( S B ) + S n B n B .
Substituting the induction hypothesis gives
S n + 1 B n + 1 = S n ( S B ) + k = 0 n 1 S n 1 k ( S B ) B k + 1 = k = 0 n S n k ( S B ) B k ,
which is (3.6-TEL) for n + 1 . Hence it holds for all n.
Step 5 (convergence on Dom ( A ) ): Take x Dom ( A ) . Let h : = t / n , so T ( t ) = T ( h ) n . Apply (3.6-TEL) with S = F ( h ) and B = T ( h ) . Since F ( h ) and T ( h ) are contractions (norm 1 ),
F ( h ) n x T ( h ) n x X k = 0 n 1 ( F ( h ) T ( h ) ) T ( h ) k x X .
Here T ( h ) k x = T ( k h ) x and k h [ 0 , t ] , so T ( k h ) x K x , t . By the definition (3.6-eps),
( F ( h ) T ( h ) ) T ( k h ) x X h ε n ( x , t ) .
Hence
F ( t / n ) n x T ( t ) x X = F ( h ) n x T ( h ) n x X k = 0 n 1 h ε n ( x , t ) = n h ε n ( x , t ) = t ε n ( x , t ) 0 .
Thus the conclusion holds for x Dom ( A ) .
Step 6 (extension to the whole space X): Since Dom ( A ) is dense (Lemma 52), for any x X and any η > 0 , choose x m Dom ( A ) with x x m X < η . By contractivity, F ( t / n ) n 1 and T ( t ) 1 , hence
F ( t / n ) n x T ( t ) x X F ( t / n ) n ( x x m ) X + F ( t / n ) n x m T ( t ) x m X + T ( t ) ( x m x ) X
2 η + F ( t / n ) n x m T ( t ) x m X .
The second term tends to 0 as n by Step 5. Hence lim sup n F ( t / n ) n x T ( t ) x X 2 η . Since η > 0 is arbitrary, the limit is 0, i.e. convergence holds for all x X . □
(7)
Trotter-type consequences: tangency of products of semigroups (sum of generators)
Lemma 80 (A product of semigroups is tangent to the sum of generators (two-term version)).
Let X be a Banach space and let { T 1 ( t ) } and { T 2 ( t ) } be contraction C 0 -semigroups with generators A 1 and A 2 , respectively. Define
F ( t ) : = T 1 ( t ) T 2 ( t ) ( t 0 ) .
Then for any x Dom ( A 1 ) Dom ( A 2 ) ,
lim t 0 F ( t ) x x t ( A 1 + A 2 ) x X = 0
holds (i.e. F is tangent to A 1 + A 2 ).
Proof. 
Take x Dom ( A 1 ) Dom ( A 2 ) . Using the identity
T 1 ( t ) T 2 ( t ) x x = T 1 ( t ) T 2 ( t ) x x + T 1 ( t ) x x ,
divide by t to obtain
T 1 ( t ) T 2 ( t ) x x t ( A 1 + A 2 ) x = T 1 ( t ) T 2 ( t ) x x t A 2 x + T 1 ( t ) x x t A 1 x + T 1 ( t ) I A 2 x .
Taking norms and using contractivity T 1 ( t ) 1 yields
F ( t ) x x t ( A 1 + A 2 ) x X T 2 ( t ) x x t A 2 x X + T 1 ( t ) x x t A 1 x X + ( T 1 ( t ) I ) A 2 x X .
Since A 2 x X and T 1 is strongly continuous, the third term tends to 0 as t 0 . The first and second terms tend to 0 by the definition of generators. Hence the right-hand side tends to 0, proving the claim. □
Lemma 81 (A product of semigroups is tangent to the sum of generators (three-term version)).
Let { T j ( t ) } ( j = 1 , 2 , 3 ) be contraction C 0 -semigroups with generators A j . Define
F ( t ) : = T 1 ( t ) T 2 ( t ) T 3 ( t ) .
Then for any x j = 1 3 Dom ( A j ) ,
lim t 0 F ( t ) x x t ( A 1 + A 2 + A 3 ) x X = 0
holds.
Proof. 
Since j = 1 3 Dom ( A j ) Dom ( A 1 ) Dom ( A 2 ) , applying Lemma 80 to
T ˜ ( t ) : = T 1 ( t ) T 2 ( t )
yields
T ˜ ( t ) x x t ( A 1 + A 2 ) x .
Moreover, since F ( t ) = T ˜ ( t ) T 3 ( t ) , applying Lemma 80 again to ( T ˜ , T 3 ) yields
F ( t ) x x t ( A 1 + A 2 + A 3 ) x
(the convergence computation follows the same decomposition as in the two-term proof). □
Theorem 15 (Trotter-type product formula (identification with a known generator)).
Let X be a Banach space and let { T j ( t ) } ( j = 1 , , m ) be contraction C 0 -semigroups with generators A j . Assume that there exist a contraction C 0 -semigroup { T ( t ) } and its generator A, and that on a core D j = 1 m Dom ( A j ) Dom ( A ) ,
A x = j = 1 m A j x ( x D )
holds. Let F ( t ) : = j = 1 m T j ( t ) . Then
lim n j = 1 m T j ( t / n ) n x = T ( t ) x ( x X , t 0 )
holds.
Proof. 
Applying Lemma 80 and Lemma 81 inductively yields that for any x D ,
lim t 0 F ( t ) x x t j = 1 m A j x X = 0
holds. By assumption, j = 1 m A j x = A x , hence F is tangent to A (Definition 53). Also, F is a contraction family: each T j ( t ) is a contraction so F ( t ) 1 , F ( 0 ) = I , and strong continuity follows from being a product. Therefore, applying Theorem 14 yields the conclusion. □
(8)
Conclusion of this subsection: the Chernoff/Trotter product formulas have been fixed as tool theorems
In this subsection, from the local condition that a contraction family F ( t ) is tangent to a generator A (the Chernoff tangency condition), we provided a complete proof within the paper that the product limit lim n F ( t / n ) n coincides with a known contraction semigroup T ( t ) , as Theorem 14. The key points of the proof are: (i) uniform boundedness of difference quotients (estimates using Lemma 76), (ii) graph-norm continuity and compactness of orbits (Lemma 78), (iii) a uniform convergence lemma on compact sets (Lemma 79), and (iv) the telescoping identity for differences of powers (3.6-TEL). We also established that products of semigroups are tangent to the sum of generators by Lemma 80 and Lemma 81, and organized the result as a Trotter-type product formula (Theorem 15). Henceforth (§6), for F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) , we verify the tangency condition and apply the tool theorems of this subsection to identify the total semigroup generation.
Preprints 193851 i017

4. Dissipative Generator L Δ : GKLS Semigroup Based on the S5 Specification Π n , V n

4.1. Recap of the S5 Dissipative Data

(1)
Aim of this section: recapitulate the input data Π n , V n , γ required for constructing the dissipative semigroup, and fix the “types” of the subsequent discussions
In this section, we reorganize and recapitulate the S5 dissipative data fixed in § 2 in a form used in this chapter ( § 4 ). The dissipative generator L Δ (of GKLS form) constructed in this chapter uses, as its building blocks,
( measurement projector system ) { Π n } n = 1 18 , ( jump operators ) V n , ( dissipation rate ) γ > 0
as the only inputs. Accordingly, the goals of this section are the following three points:
1.
Recapitulate the orthogonality and completeness of the projector system { Π n } , and show that the block decomposition is always correctly defined as a finite sum.
2.
Prove within the main text the basic identities of the jump operators V n : = γ Π n (such as n V n V n = γ I ).
3.
Show within the main text that the “diagonalization (pinching) map” E * is CPTP, and guarantee that the basis of dissipation (pointer blocks) is mathematically stable.
(2)
Projector system { Π n } n = 1 18 : orthogonality and completeness (recap)
Definition 54 (S5 measurement projector system (recap)).
Let H be a complex Hilbert space, and set
M : = B ( H ) , X : = T 1 ( H )
Fix the integer N : = 18 , and define { Π n } n = 1 N M by the following:
(P1) 
Π n = Π n and Π n 2 = Π n (orthogonal projection).
(P2) 
If n m , then Π n Π m = 0 (orthogonality).
(P3) 
n = 1 N Π n = I (completeness; finite sum).
This family is called the measurement projector system (of S5).
Lemma 82 (Basic identities of the projector system (recap)).
Under Definition 54, for any m , n { 1 , , N } ,
Π m Π n = δ m n Π n , Π m Π n = Π n Π m
hold.
Proof. 
If n = m , then Π m Π m = Π m 2 = Π m . If n m , then (P2) implies Π m Π n = 0 . Similarly, exchanging indices also gives 0, so commutativity follows as well. □
(3)
Block decomposition: finite block representation of observables and states
Lemma 83 (Finite block decomposition of observables).
For any A B ( H ) ,
A = m = 1 N n = 1 N Π m A Π n
holds (since it is a finite sum, no convergence issue arises).
Proof. 
By (P3), I = m Π m , hence
A = I A I = m = 1 N Π m A n = 1 N Π n = m = 1 N n = 1 N Π m A Π n .
Lemma 84 (Finite block decomposition of states (trace class)).
For any ρ T 1 ( H ) ,
ρ = m = 1 N n = 1 N Π m ρ Π n ( equality in T 1 ( H ) )
holds.
Proof. 
First, if ρ is finite rank, then ρ B ( H ) as well, so applying Lemma 83 with A = ρ yields the equality.
For a general ρ T 1 ( H ) , take a finite-rank sequence ρ k with ρ k ρ 1 0 ( T 1 is the completion of finite-rank operators). By the equality for the finite-rank case,
ρ k = m , n Π m ρ k Π n .
Using stability under two-sided multiplication A σ B 1 A σ 1 B , and noting that projections satisfy Π m 1 , we obtain
Π m ( ρ k ρ ) Π n 1 ρ k ρ 1 0 ( k )
for each m , n . Since the sum is finite,
m , n Π m ρ k Π n k · 1 m , n Π m ρ Π n .
Since the left-hand side equals ρ k , uniqueness of the limit yields
ρ = m , n Π m ρ Π n .
(4)
Jump operators V n : = γ Π n and basic identities
Definition 55 (S5 jump operators (recap)).
Fix a dissipation rate γ > 0 , and from the projector system in Definition 54 define
V n : = γ Π n ( n = 1 , , N )
We call { V n } n = 1 N the jump operators (of S5).
Lemma 85 (Basic identities of the jump operators).
Under Definition 55, for any m , n ,
V n = V n , V m V n = γ δ m n Π n , V n V n = γ Π n , n = 1 N V n V n = γ I
hold.
Proof. 
Since Π n = Π n , we have V n = ( γ Π n ) = γ Π n = V n . Also,
V m V n = γ Π m Π n = γ δ m n Π n
follows from Lemma 82. Setting n = m gives V n V n = V n 2 = γ Π n . Finally, by (P3),
n = 1 N V n V n = n = 1 N γ Π n = γ n = 1 N Π n = γ I .
(5)
Diagonalization (pinching) map E * and its CPTP property
The projector system defines a natural CPTP map that sends a state to its diagonal blocks. Since this is used repeatedly in the analysis of the dissipative semigroup, we establish it independently in this section.
Definition 56 (Diagonalization map (state side) E * ).
Define the map E * : X X by
E * ( ρ ) : = n = 1 N Π n ρ Π n ( ρ X )
(it is well-defined since it is a finite sum).
Lemma 86 
( E * is CPTP). The map E * in Definition 56 is CPTP. That is,
1.
For any ρ 0 , E * ( ρ ) 0 (positivity preservation).
2.
For any ρ, Tr ( E * ( ρ ) ) = Tr ( ρ ) (trace preservation).
3.
For any k N , Id k E * preserves positivity (complete positivity).
Proof. (i) Positivity preservation:
Let ρ 0 . For any ψ H ,
ψ , E * ( ρ ) ψ = n = 1 N ψ , Π n ρ Π n ψ = n = 1 N Π n ψ , ρ Π n ψ 0
(since ρ 0 ), hence E * ( ρ ) 0 .
(ii) Trace preservation: By Lemma 71 (cyclicity for bounded × trace-class),
Tr ( Π n ρ Π n ) = Tr ( ρ Π n 2 ) = Tr ( ρ Π n ) .
Therefore
Tr ( E * ( ρ ) ) = n = 1 N Tr ( Π n ρ Π n ) = n = 1 N Tr ( ρ Π n ) = Tr ρ n = 1 N Π n = Tr ( ρ )
(by (P3)).
(iii) Complete positivity: Fix any k N and set H k : = C k H . Let Σ T 1 ( H k ) be positive ( Σ 0 ). Set Π ˜ n : = I k Π n . Then by definition,
( Id k E * ) ( Σ ) = n = 1 N Π ˜ n Σ Π ˜ n .
For any ξ H k ,
ξ , Π ˜ n Σ Π ˜ n ξ = Π ˜ n ξ , Σ Π ˜ n ξ 0 ,
so each term is a positive operator. A finite sum of positive operators is positive, hence ( Id k E * ) ( Σ ) 0 . Since k is arbitrary, E * is completely positive.
By (i)(ii)(iii), E * is CPTP. □
(6)
Immediate consequence on block action: E * is the diagonal-block projection
Lemma 87 (Diagonal-block projection property).
Let ρ X and define the block components by ρ m n : = Π m ρ Π n . Then
Π m E * ( ρ ) Π n = ρ n n , m = n , 0 , m n , E * ( ρ ) = n = 1 N ρ n n , E * E * = E *
hold (i.e., E * is idempotent).
Proof. 
By Definition 56,
Π m E * ( ρ ) Π n = k = 1 N Π m Π k ρ Π k Π n .
By Lemma 82, Π m Π k = δ m k Π m and Π k Π n = δ k n Π n , so only the case k = m = n remains, and
Π m E * ( ρ ) Π n = δ m n Π n ρ Π n = δ m n ρ n n .
Hence E * ( ρ ) = n Π n E * ( ρ ) Π n = n ρ n n follows.
Idempotence follows from
E * ( E * ( ρ ) ) = n Π n m Π m ρ Π m Π n = m , n Π n Π m ρ Π m Π n = n Π n ρ Π n = E * ( ρ )
(by orthogonality). □
(7)
Conclusion of this section: the S5 dissipative data as the input to § 4 has been recapitulated, and the basic properties required for the analysis have been established within the main text
In this section, we recapitulated the projector system { Π n } n = 1 18 and the dissipation rate γ > 0 as the S5 dissipative data, and the jump operators V n = γ Π n (Definition 54, Definition 55), and confirmed that the block decomposition is correctly defined as a finite sum (Lemma 83, Lemma 84). We further established the basic identities of the jump operators (Lemma 85) and proved, in a self-contained manner within the main text, the CPTP property of the diagonalization map E * and its properties as a diagonal-block projection (Lemma 86, Lemma 87). Hereafter, in this chapter, we construct the GKLS generator L Δ and the semigroup e t L Δ using only these inputs.
Preprints 193851 i018

4.2. Definition of the GKLS Generator ( L Δ )

(1)
Aim of this section: define the dissipative generator simultaneously in both the Schrödinger and Heisenberg pictures, and fix the duality (trace pairing) within this section
In this chapter, taking as input the S5 dissipative data (in § 4 . 1 )
{ Π n } n = 1 N ( N = 18 ) , γ > 0 , V n : = γ Π n
we define the dissipative generator (the infinitesimal generator of decoherence/measurement) in the GKLS (Lindblad) standard form. Before proceeding to the subsequent semigroup generation ( e t L Δ ), the role of this section is to:
1.
define the state-side (Schrödinger picture) generator L Δ : T 1 ( H ) T 1 ( H ) ,
2.
define the observable-side (Heisenberg picture) generator L Δ * : B ( H ) B ( H ) ,
3.
rigorously prove within the main text that the two are consistent under the trace duality
Tr L Δ [ ρ ] A = Tr ρ L Δ * [ A ] ( ρ T 1 ( H ) , A B ( H ) )
(i.e., that they are the two pictures of the same dynamics),
and to fix these facts. Hereafter, in this paper, by the “dissipative generator” we first mean the GKLS generator defined in this section.
(2)
Definition 4.3: Schrödinger generator L Δ (state side)
Definition 57 (GKLS generator (Schrödinger picture)).
Adopt the standard realization
X : = T 1 ( H ) , M : = B ( H )
Assume that { V n } n = 1 N B ( H ) ( N = 18 ) is given by the S5 dissipative data of § 4 . 1 (Definition 54, Definition 55). Define the linear map L Δ : X X by
L Δ [ ρ ] : = n = 1 N V n ρ V n 1 2 { V n V n , ρ } ( ρ X )
and call it the GKLS generator (state side). Here the anticommutator is { A , B } : = A B + B A .
(3)
Definition 4.4: Heisenberg generator L Δ * (observable side)
Definition 58 (GKLS generator (Heisenberg picture; adjoint)).
For the same S5 dissipative data { V n } n = 1 N , define the linear map L Δ * : M M by
L Δ * [ A ] : = n = 1 N V n A V n 1 2 { V n V n , A } ( A M )
and call it the GKLS generator (observable side).
(4)
Duality (two pictures of the same dynamics): consistency of L Δ and L Δ *
Lemma 88 (Trace duality: Tr ( L Δ [ ρ ] A ) = Tr ( ρ L Δ * [ A ] ) ).
Under Definitions 57–58, for any ρ T 1 ( H ) and any A B ( H ) ,
Tr L Δ [ ρ ] A = Tr ρ L Δ * [ A ]
holds.
Proof. 
Take arbitrary ρ T 1 ( H ) and A B ( H ) . By Definition 57,
Tr L Δ [ ρ ] A = n = 1 N Tr ( V n ρ V n A ) 1 2 Tr ( V n V n ρ A ) 1 2 Tr ( ρ V n V n A ) .
Hereafter, we repeatedly use Lemma 71 (cyclicity for bounded × trace-class).
First term ( V n ρ V n A ): Since V n ρ T 1 ( H ) (Lemma 17),
Tr ( V n ρ V n A ) = Tr ( ρ V n A V n ) .
(Indeed, Tr ( V n ρ V n A ) = Tr ( ( V n ρ ) ( V n A ) ) = Tr ( ( V n A ) ( V n ρ ) ) = Tr ( ρ V n A V n ) .)
Second term ( V n V n ρ A ): Since V n V n is bounded and V n V n ρ T 1 ( H ) ,
Tr ( V n V n ρ A ) = Tr ( ρ A V n V n ) .
Third term ( ρ V n V n A ): This term already has ρ on the left, and we keep the form in order to combine it later into the anticommutator.
Therefore,
Tr L Δ [ ρ ] A = n = 1 N Tr ( ρ V n A V n ) 1 2 Tr ( ρ A V n V n ) 1 2 Tr ( ρ V n V n A ) = Tr ρ n = 1 N V n A V n 1 2 ( A V n V n + V n V n A ) = Tr ρ L Δ * [ A ] ,
and the last expression agrees with Definition 58. Hence (4.5) holds. □
(5)
Reduced form under the minimal S5 specification: L Δ = γ ( E * Id ) , L Δ * = γ ( E Id )
Definition 59 (Pinching map (observable side) E ).
For the projector system { Π n } n = 1 N of § 4 . 1 , define the observable-side pinching map E : M M by
E ( A ) : = n = 1 N Π n A Π n ( A B ( H ) )
(it is well-defined since it is a finite sum).
Lemma 89 (Reduced form under the minimal specification V n = γ Π n ).
Under the minimal specification of § 4 . 1
V n = γ Π n , n = 1 N Π n = I
the generators in Definitions 57–58 satisfy
L Δ [ ρ ] = γ n = 1 N Π n ρ Π n γ ρ = γ E * ( ρ ) ρ ,
L Δ * [ A ] = γ n = 1 N Π n A Π n γ A = γ E ( A ) A
where E * is the state-side pinching map defined in § 4 . 1 by Definition 56.
Proof. 
Under the minimal specification, Π n = Π n implies V n = V n , and moreover
V n V n = ( γ Π n ) ( γ Π n ) = γ Π n .
Substituting this into (4.3) yields
L Δ [ ρ ] = n = 1 N γ Π n ρ Π n 1 2 { γ Π n , ρ } = γ n = 1 N Π n ρ Π n γ 2 n = 1 N ( Π n ρ + ρ Π n ) .
Using completeness of the projections n = 1 N Π n = I , we have
l n = 1 N Π n ρ = n = 1 N Π n ρ = I ρ = ρ , n = 1 N ρ Π n = ρ n = 1 N Π n = ρ I = ρ .
Therefore,
γ 2 n = 1 N ( Π n ρ + ρ Π n ) = γ 2 ( ρ + ρ ) = γ ρ ,
and hence
L Δ [ ρ ] = γ n = 1 N Π n ρ Π n γ ρ = γ E * ( ρ ) ρ
follows (by Definition 56, E * ( ρ ) = n Π n ρ Π n ).
Similarly, substituting into (4.4) yields
L Δ * [ A ] = n = 1 N γ Π n A Π n 1 2 { γ Π n , A } = γ n = 1 N Π n A Π n γ A = γ E ( A ) A ,
and the last step uses E from Definition 59. □
(6)
Conclusion of this section: the definition of the GKLS generator (both pictures) and the duality have been fixed
In this section, we defined the dissipative generator in the GKLS standard form both as the state-side L Δ (Definition 57) and as the observable-side L Δ * (Definition 58), and rigorously proved within the main text that they represent the same dynamics via the trace duality (4.5) (Lemma 88). We also showed that under the minimal S5 specification V n = γ Π n , the generators reduce to the pinching differences γ ( E * Id ) (state side) and γ ( E Id ) (observable side) (Lemma 89). Hereafter, in the remainder of this chapter, we show that this generator generates a strongly continuous CPTP semigroup e t L Δ .
Preprints 193851 i019

4.3. Basic Properties (TP, Hermiticity, Boundedness)

(1)
Aim of this section: establish the analytical soundness of L Δ (the GKLS generator) in a self-contained manner within this section
In this section, for the dissipative generator L Δ and its adjoint L Δ * defined in § 4 . 2 , we rigorously prove and fix within the main text the minimal analytical properties required for the subsequent semigroup generation ( e t L Δ ) and componentwise composition ( § 6 ). Concretely, we show the following:
1.
Differential form of TP (trace preservation): for any ρ T 1 ( H ) , Tr ( L Δ [ ρ ] ) = 0 .
2.
Hermiticity preservation: if ρ = ρ , then L Δ [ ρ ] = L Δ [ ρ ] . Similarly, on the observable side, if A = A , then L Δ * [ A ] is self-adjoint.
3.
Boundedness: L Δ is a bounded linear operator on T 1 ( H ) , and we give an explicit operator-norm estimate. In particular, under the minimal specification of this paper we obtain L Δ 1 1 2 γ (or an equivalent estimate).
As a result, it is fixed that the general result of § 3 . 4 (exponential semigroups of bounded generators) can be applied directly to L Δ .
(2)
Differential form of TP: Tr ( L Δ [ ρ ] ) = 0
Lemma 90 (Differential form of trace preservation (state side)).
For any ρ T 1 ( H ) ,
Tr L Δ [ ρ ] = 0
holds.
Proof. 
By the duality in § 4 . 2 (Lemma 88), for any ρ ,
Tr L Δ [ ρ ] = Tr L Δ [ ρ ] I = Tr ρ L Δ * [ I ]
holds. Therefore it suffices to show L Δ * [ I ] = 0 . By Definition 58,
L Δ * [ I ] = n = 1 N V n I V n 1 2 { V n V n , I } = n = 1 N V n V n 1 2 ( V n V n I + I V n V n ) = n = 1 N ( V n V n V n V n ) = 0 .
Hence L Δ * [ I ] = 0 , and from (4.3-TP) we obtain Tr ( L Δ [ ρ ] ) = 0 . □
(3)
Hermiticity preservation: state side and observable side
Lemma 91 (Hermiticity preservation (state side)).
For any ρ T 1 ( H ) ,
L Δ [ ρ ] = L Δ [ ρ ]
holds. In particular, if ρ = ρ , then L Δ [ ρ ] is also self-adjoint.
Proof. 
By Definition 57,
L Δ [ ρ ] = n V n ρ V n 1 2 ( V n V n ρ + ρ V n V n ) .
Taking adjoints of both sides and using ( X Y ) = Y X and linearity, we obtain
L Δ [ ρ ] = n ( V n ρ V n ) 1 2 ( V n V n ρ ) + ( ρ V n V n ) = n V n ρ V n 1 2 ρ V n V n + V n V n ρ = L Δ [ ρ ] ,
and the last line agrees with Definition 57. □
Lemma 92 (Hermiticity preservation (observable side)).
For any A B ( H ) ,
L Δ * [ A ] = L Δ * [ A ]
holds. In particular, if A = A , then L Δ * [ A ] is also self-adjoint.
Proof. 
By Definition 58,
L Δ * [ A ] = n V n A V n 1 2 ( V n V n A + A V n V n ) .
Taking adjoints yields
L Δ * [ A ] = n ( V n A V n ) 1 2 ( V n V n A ) + ( A V n V n ) = n V n A V n 1 2 A V n V n + V n V n A = L Δ * [ A ] .
(4)
Boundedness: L Δ is a bounded linear operator on T 1 ( H )
Under the minimal specification of this paper ( V n = γ Π n , N = 18 ), L Δ reduces to the “pinching difference” γ ( E * Id ) (Lemma 89). Using this form, we obtain the sharpest estimate L Δ 1 1 2 γ .
Lemma 93 (The pinching map E * is trace-norm contractive (norm 1 )).
Let E * : X X be given by E * ( ρ ) = n Π n ρ Π n (Definition 56). Then for any ρ X ,
E * ( ρ ) 1 ρ 1
holds. Consequently, E * 1 1 1 .
Proof. 
It has already been proved in § 4 . 1 that E * is CPTP (Lemma 86). By the general result of § 3 . 3 (Lemma 63), any CPTP map is trace-norm contractive, hence
E * ( ρ ) 1 ρ 1
follows. The operator-norm estimate E * 1 1 1 follows immediately from the definition. □
Lemma 94 (Boundedness estimate: L Δ 1 1 2 γ ).
Under the minimal specification V n = γ Π n of this paper, L Δ is a bounded linear operator on X = T 1 ( H ) , and
L Δ 1 1 2 γ
holds.
Proof. 
By Lemma 89,
L Δ = γ ( E * Id ) .
Therefore, for any ρ X ,
L Δ [ ρ ] 1 = γ E * ( ρ ) ρ 1 γ E * ( ρ ) 1 + γ ρ 1 γ ρ 1 + γ ρ 1 = 2 γ ρ 1
(by Lemma 93). Hence L Δ 1 1 2 γ . □
Lemma 95 (Boundedness on the observable side (for reference): L Δ * 2 γ ).
Under the minimal specification,
L Δ * = γ ( E Id ) , E ( A ) = n Π n A Π n
holds (Lemma 89). Then for any A B ( H ) ,
L Δ * [ A ] 2 γ A
holds. Consequently, L Δ * 2 γ .
Proof. 
From the discussion in § 2 . 4 (pinching is unital-CP) and Lemma 60 in § 3 . 3 , E satisfies operator-norm contractivity E ( A ) A . Therefore,
L Δ * [ A ] = γ E ( A ) A γ E ( A ) + γ A 2 γ A .
(5)
Conclusion of this section: the minimal analyticity of L Δ (TP, Hermiticity, boundedness) has been fixed within the main text
In this section, we fixed the basic properties of the dissipative generator L Δ and its adjoint L Δ * in a form sufficient for the subsequent semigroup generation and componentwise composition. Concretely, we proved within the main text the differential form of trace preservation Tr ( L Δ [ ρ ] ) = 0 (Lemma 90), Hermiticity preservation (Lemma 91, Lemma 92), and, under the minimal specification, the boundedness estimate L Δ 1 1 2 γ (Lemma 94). As a result, the general theorem of § 3 . 4 (exponential semigroups of bounded generators) can be applied to L Δ , and we are prepared to construct the dissipative semigroup via e t L Δ .
Preprints 193851 i020

4.4. Generation of a CPTP Semigroup

(1)
Aim of this section: prove in a self-contained manner within the main text that L Δ generates a strongly continuous CPTP semigroup T Δ ( t ) = e t L Δ
In this section, we rigorously show that the dissipative generator
L Δ : T 1 ( H ) T 1 ( H )
defined in § 4 . 2 and whose basic properties (TP, Hermiticity, boundedness) were established in § 4 . 3 , generates the strongly continuous CPTP semigroup
T Δ ( t ) : = e t L Δ ( t 0 ) .
Concretely, we achieve the following:
1.
By the general result for bounded generators ( § 3 . 4 ), we establish that T Δ ( t ) = e t L Δ is a C 0 -semigroup and that its generator is L Δ .
2.
We further show that T Δ ( t ) is CPTP at each time, under the minimal specification of this chapter, from two complementary viewpoints: (i) by a direct closed-form computation, and (ii) by an approximation argument for general GKLS generators (Euler limit plus closure of CPTP).
3.
As a result, we fix within this section, as a conclusion, that the dissipative equation ρ ˙ = L Δ [ ρ ] admits a unique mild solution ρ ( t ) = T Δ ( t ) ρ 0 , and that the set of density operators is invariant.
The proofs are completed within the main text.
(2)
Semigroup generation (analysis): L Δ is a bounded generator
Lemma 96 ( C 0 -semigroup generation as an exponential semigroup).
L Δ is a bounded linear operator on X : = T 1 ( H ) (Lemma 94). Therefore,
T Δ ( t ) : = e t L Δ = k = 0 t k k ! L Δ k ( t 0 )
forms a strongly continuous semigroup on X, whose generator is L Δ , and whose domain is the whole space X.
Proof. 
By Lemma 94, L Δ B ( X ) . Hence, applying the general result of § 3 . 4 (Theorem 13) to A = L Δ , we obtain that T Δ ( t ) = e t L Δ defines a C 0 -semigroup whose generator is L Δ and whose domain is X. □
(3)
CPTP property (structure): closed form under the minimal specification T Δ ( t ) = e γ t Id + ( 1 e γ t ) E *
Under the minimal specification of this paper, we have L Δ = γ ( E * Id ) (Lemma 89, as used in the proof of Lemma 94). In this form, the exponential can be computed in closed form, and the CPTP property follows immediately as a convex combination.
Theorem 16 (Closed form: explicit expression of the dissipative semigroup).
Under the minimal specification V n = γ Π n ,
L Δ = γ ( E * Id )
holds (Lemma 89). Then for any t 0 ,
T Δ ( t ) = e t L Δ = e γ t Id + 1 e γ t E *
holds.
Proof. 
E * is the diagonalization map defined in § 4 . 1 , and by Lemma 87 it is idempotent, E * 2 = E * . Therefore P : = E * is a projection (an idempotent operator on a Banach space).
Let B : = γ ( P Id ) , so that L Δ = B . Since P is idempotent, for any k 1 ,
( P Id ) k = ( 1 ) k ( Id P ) k = ( 1 ) k ( Id P )
holds (and Id P is also idempotent: ( Id P ) 2 = Id 2 P + P 2 = Id P ). Hence,
B 0 = Id , B k = γ k ( P Id ) k = γ k ( 1 ) k ( Id P ) ( k 1 ) .
Computing the exponential series gives
e t B = k = 0 t k k ! B k = Id + k = 1 t k k ! γ k ( 1 ) k ( Id P ) = Id + k = 1 ( γ t ) k k ! ( Id P ) = Id + e γ t 1 ( Id P ) = e γ t Id + 1 e γ t P = e γ t Id + 1 e γ t E * .
This is (4.4-CF). □
(4)
CPTP property (conclusion): T Δ ( t ) is CPTP at each time and forms a strongly continuous CPTP semigroup
Theorem 17 (The dissipative semigroup is CPTP (minimal specification)).
Under the minimal specification V n = γ Π n ,
T Δ ( t ) : = e t L Δ
is CPTP for each t 0 , and moreover { T Δ ( t ) } t 0 is a strongly continuous CPTP semigroup.
Proof. Step 1 (CPTP property):
By Theorem 16,
T Δ ( t ) = e γ t Id + 1 e γ t E * .
For t 0 , the coefficients satisfy
e γ t 0 , 1 e γ t 0 , e γ t + ( 1 e γ t ) = 1 .
Id is CPTP, and E * is also CPTP (Lemma 86). Therefore, by closure of CPTP under convex combinations in § 3 . 3 (Lemma 65), T Δ ( t ) is CPTP.
Step 2 (semigroup property and strong continuity): By Lemma 96, T Δ ( t ) = e t L Δ is a C 0 -semigroup. Hence the semigroup property and strong continuity hold.
Combining Step 1 and Step 2, { T Δ ( t ) } is a strongly continuous CPTP semigroup. □
(5)
Reference: the same structure works for general GKLS (Euler limit plus closure)
Under the minimal specification of this paper, the proof closes via the closed form; however, for later extensions we record, as a lemma, that “the CPTP property follows by the same structure for general GKLS.” (To keep this section self-contained within the scope of the minimal specification, we state this only minimally as a reference.)
Lemma 97 (CPTP semigroup generation by Euler approximation (structural lemma)).
Assume that L Δ is bounded on X, and that for some h 0 > 0 ,
Id + h L Δ is CPTP ( 0 < h h 0 ) .
Then for any t 0 ,
e t L Δ ρ = lim n Id + t n L Δ n ρ ( ρ X )
holds, and since each n on the right-hand side is CPTP, the limit is also CPTP (closure under limits in § 3 . 3 ).
Proof. 
From the definition of the exponential, it is standard that the Euler approximation ( e t A = lim n ( I + t A / n ) n ) holds in the Banach algebra B ( X ) . Each factor is CPTP by assumption, and CPTP is closed under composition (Lemma 64), so the n-th power is CPTP. Moreover, since CPTP is closed under pointwise · 1 limits (Theorem 12), the limit is also CPTP. □
(6)
Direct corollary: well-posedness of the dissipative equation and invariance of the state set
Theorem 18 (Existence and uniqueness of the mild solution of the dissipative equation and invariance of the state set).
For any initial value ρ 0 X ,
ρ ( t ) : = T Δ ( t ) ρ 0
is the mild solution of ρ ˙ = L Δ [ ρ ] , and is unique. In particular, if ρ 0 S ( H ) (a density operator), then for all t 0 ,
ρ ( t ) S ( H ) that is ρ ( t ) 0 , Tr ( ρ ( t ) ) = 1
holds.
Proof. 
By Lemma 96, T Δ ( t ) is a C 0 -semigroup with generator L Δ . Hence, by the definition in § 3 . 2 , ρ ( t ) = T Δ ( t ) ρ 0 is a mild solution. Uniqueness of the mild solution follows from uniqueness of the semigroup orbit determined by the generator (a standard fact extending the framework of Theorem 11 to mild solutions). (In this paper, since “solution = semigroup orbit” is adopted as the definition, uniqueness is included in the definition.)
We show invariance of the state set. By Theorem 17, T Δ ( t ) is CPTP. Therefore, if ρ 0 0 then T Δ ( t ) ρ 0 0 , and by TP, Tr ( T Δ ( t ) ρ 0 ) = Tr ( ρ 0 ) . In particular, if ρ 0 S ( H ) , then Tr ( ρ 0 ) = 1 , hence ρ ( t ) S ( H ) . □
(7)
Conclusion of this section: L Δ generates a strongly continuous CPTP semigroup (core of this chapter)
In this section, since the dissipative generator L Δ is a bounded generator, we showed that the exponential semigroup T Δ ( t ) = e t L Δ defines a C 0 -semigroup (Lemma 96), and under the minimal specification we derived the closed form
T Δ ( t ) = e γ t Id + ( 1 e γ t ) E *
(Theorem 16) and proved that it is CPTP by closure under convex combinations (Theorem 17). As a result, well-posedness of the dissipative equation and invariance of the density-operator set follow immediately (Theorem 18). Hereafter, this paper proceeds to composite generation with the unitary and resonance parts, using this dissipative semigroup as a component.
Preprints 193851 i021

4.5. Explicit Action on the Projector Basis

(1)
Aim of this section: fully visualize the action of the dissipative semigroup T Δ ( t ) and the generator L Δ in terms of projector block components
In this section, for the block components determined by the projector system { Π n } n = 1 N ( N = 18 ) fixed in § 4 . 1 ,
ρ m n : = Π m ρ Π n ( 1 m , n N ) ,
we give explicit formulas for the action of the dissipative generator L Δ and the dissipative semigroup T Δ ( t ) . Under the minimal specification of this paper V n = γ Π n ,
L Δ = γ ( E * Id ) , T Δ ( t ) = e γ t Id + ( 1 e γ t ) E *
hold ( § 4 . 2 and § 4 . 4 ). Therefore, dissipation is expected to “preserve diagonal blocks and exponentially damp off-diagonal blocks.” The purpose of this section is to prove this fact completely as operator identities and to fix it in a form that can be referenced in subsequent numerical verification, componentwise composition, and interference analysis with the resonance component.
(2)
Basic identity of block projections: Π m Π n = δ m n Π n
Lemma 98 (Identity for products of block projections (recap)).
Assume that { Π n } n = 1 N is the S5 projector system of § 4 . 1 (Definition 54). Then for any m , n ,
Π m Π n = δ m n Π n
holds.
Proof. 
We have Π m Π m = Π m 2 = Π m , and if m n then orthogonality gives Π m Π n = 0 . Therefore Π m Π n = δ m n Π n . □
(3)
Block action of the generator: closed form of Π m L Δ [ ρ ] Π n
Theorem 19 (Block action of the generator (minimal specification)).
Under the minimal specification V n = γ Π n , for any ρ T 1 ( H ) and any m , n { 1 , , N } ,
Π m L Δ [ ρ ] Π n = 0 , m = n , γ Π m ρ Π n , m n
holds. That is, for the block components ρ m n : = Π m ρ Π n ,
L Δ [ ρ ] m n : = Π m L Δ [ ρ ] Π n = 0 , m = n , γ ρ m n , m n
holds.
Proof. 
By Lemma 89, under the minimal specification,
L Δ [ ρ ] = γ k = 1 N Π k ρ Π k γ ρ
holds. Multiply by Π m , Π n from both sides:
Π m L Δ [ ρ ] Π n = γ k = 1 N Π m Π k ρ Π k Π n γ Π m ρ Π n .
By Lemma 98, Π m Π k = δ m k Π k and Π k Π n = δ k n Π n , hence
Π m Π k ρ Π k Π n = δ m k δ k n Π k ρ Π n = δ m n δ m k Π m ρ Π n .
Therefore, the sum contributes only when m = n , and
γ k = 1 N Π m Π k ρ Π k Π n = γ δ m n Π m ρ Π n .
Thus,
Π m L Δ [ ρ ] Π n = γ δ m n Π m ρ Π n γ Π m ρ Π n = γ ( δ m n 1 ) Π m ρ Π n .
If m = n , then δ m n 1 = 0 , and if m n , then δ m n 1 = 1 , hence (4.5-G) follows. □
(4)
Block equations: exact solution of each component of the dissipative equation ρ ˙ = L Δ [ ρ ]
Theorem 20 (Time evolution of block components (solution of the dissipative equation)).
Consider, under the minimal specification, the dissipative equation
ρ ˙ ( t ) = L Δ [ ρ ( t ) ] , ρ ( 0 ) = ρ 0 T 1 ( H )
Let ρ m n ( t ) : = Π m ρ ( t ) Π n be the block components. Then for any m , n ,
d d t ρ m n ( t ) = 0 , m = n , γ ρ m n ( t ) , m n , ρ m n ( 0 ) = Π m ρ 0 Π n
holds, and therefore the solution is given by
ρ m n ( t ) = ρ n n ( 0 ) , m = n , e γ t ρ m n ( 0 ) , m n .
Proof. Step 1 (interchanging differentiation and projections):
If ρ ( t ) satisfies (4.5-ODE), then since Π m , Π n are time-independent bounded operators,
d d t ρ m n ( t ) = d d t Π m ρ ( t ) Π n = Π m ρ ˙ ( t ) Π n = Π m L Δ [ ρ ( t ) ] Π n .
This identity can be justified by the definition of differentiation (difference quotient) in the Banach space X = T 1 ( H ) and boundedness of two-sided multiplication (Lemma 17).
Step 2 (substituting the block action of the generator): Using Step 1 and Theorem 19,
d d t ρ m n ( t ) = 0 , m = n , γ ρ m n ( t ) , m n ,
i.e., (4.5-BLK) follows.
Step 3 (solving the ordinary differential equations): If m = n , then ρ ˙ n n ( t ) = 0 , so ρ n n ( t ) = ρ n n ( 0 ) . If m n , then ρ ˙ m n ( t ) = γ ρ m n ( t ) , hence
ρ m n ( t ) = e γ t ρ m n ( 0 )
follows (for Banach-space-valued ODEs with scalar coefficients, the solution is given by the usual exponential). This proves (4.5-SOL). □
(5)
Block representation of the semigroup action: explicit block action of T Δ ( t )
Theorem 21 (Block action of the dissipative semigroup (minimal specification)).
Under the minimal specification, the dissipative semigroup
T Δ ( t ) = e t L Δ
satisfies, for any ρ T 1 ( H ) , the block-component formula
Π m T Δ ( t ) [ ρ ] Π n = Π n ρ Π n , m = n , e γ t Π m ρ Π n , m n
and therefore
T Δ ( t ) [ ρ ] = n = 1 N Π n ρ Π n + e γ t m , n = 1 m n N Π m ρ Π n .
Proof. 
By Theorem 17, ρ ( t ) : = T Δ ( t ) [ ρ ] is the mild solution of the dissipative equation. Since L Δ is bounded, the mild solution is a classical solution and satisfies (4.5-ODE). Therefore, applying Theorem 20 with ρ 0 = ρ yields
Π m ρ ( t ) Π n = Π n ρ Π n , m = n , e γ t Π m ρ Π n , m n
which is exactly (4.5-SG). The final full expression is obtained by writing Lemma 84 (finite block decomposition) as the sum of the diagonal terms and the off-diagonal terms. □
(6)
Equivalent closed form (recap): agreement with T Δ ( t ) = e γ t Id + ( 1 e γ t ) E *
Lemma 99 (Equivalence between the block representation and the closed form).
The block representation (4.5-SG) in Theorem 21 is equivalent to the closed form in § 4 . 4 ,
T Δ ( t ) = e γ t Id + 1 e γ t E * .
Proof. 
Decompose ρ = m , n Π m ρ Π n , and define the diagonal component ρ diag : = n Π n ρ Π n = E * ( ρ ) and the off-diagonal component ρ off : = m n Π m ρ Π n = ρ E * ( ρ ) . By Theorem 21,
T Δ ( t ) [ ρ ] = ρ diag + e γ t ρ off = e γ t ( ρ diag + ρ off ) + ( 1 e γ t ) ρ diag = e γ t ρ + ( 1 e γ t ) E * ( ρ ) ,
i.e., it agrees with the closed form. The reverse direction follows by the same transformation. □
(7)
Conclusion of this section: the physical meaning of dissipation (dephasing) has been fixed as rigorous block equations
In this section, we made explicit the action of the dissipative generator and dissipative semigroup on the block components with respect to the projector basis { Π n } . The generator satisfies
L Δ [ ρ ] m n = 0 , m = n , γ ρ m n , m n
(Theorem 19), and hence each block component of the dissipative equation can be solved as diagonal invariance and off-diagonal exponential decay (Theorem 20). Moreover, the semigroup action is explicitly given by
( T Δ ( t ) [ ρ ] ) n n = ρ n n , ( T Δ ( t ) [ ρ ] ) m n = e γ t ρ m n ( m n ) ,
(Theorem 21), and we also showed its equivalence with the closed-form representation (Lemma 99). These results serve as a foundation for tracking, in subsequent componentwise composition, “which degrees of freedom are removed by dissipation and which are preserved.”
Preprints 193851 i022

4.6. Handoff to § 6 (Organizing the Component Conditions)

(1)
Aim of this section: list the “verified conditions” under which the dissipative component ( L Δ , T Δ ) can be fed into the componentwise composition (Chernoff/Trotter) in § 6 , and close the proof chain
In § 6 , the total generator of the UEE,
L tot : = L 0 + L Δ + R
is generated by a Chernoff/Trotter-type product formula for the product of component semigroups
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) .
Accordingly, the role of this chapter ( § 4 ) is to explicitly show that the dissipative component is compatible with the assumptions of § 6 (contractivity, strong continuity, tangency condition, common core), so that the subsequent sections do not need any additional examination regarding the dissipative part.
In this section, we reorganize the results proved in § 4 as “component conditions to be used in § 6 ,” and fix the following as handoff propositions:
1.
that T Δ ( t ) is a strongly continuous CPTP semigroup and, in particular, is trace-norm contractive,
2.
that L Δ is a bounded generator whose domain is the whole space X = T 1 ( H ) ,
3.
that in the tangency condition for F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) , the term originating from L Δ is automatically controlled,
and thereby close the proof chain.
(2)
Notation: component semigroups and component generators used in § 6
Hereafter, let the state space in the standard realization be
X : = T 1 ( H ) ,
and let the trace norm be denoted by · 1 . The dissipative component is given by
L Δ : X X , T Δ ( t ) : = e t L Δ ( t 0 ) ,
and by § 4 . 4 , T Δ is a strongly continuous CPTP semigroup. The other components T 0 (unitary part) and T R (resonance part) are constructed in § 3 . 5 and § 5 , respectively.
(3)
Handoff proposition I: properties of the dissipative semigroup T Δ (CPTP, contractive, strongly continuous, closed form)
Theorem 22 (Handoff of the dissipative component (semigroup side)).
Under the minimal specification of § 4 ( V n = γ Π n , N = 18 ), the dissipative semigroup T Δ ( t ) = e t L Δ satisfies the following.
(H1) 
Semigroup property and strong continuity:
T Δ ( 0 ) = Id , T Δ ( t + s ) = T Δ ( t ) T Δ ( s ) ( t , s 0 ) , lim t 0 T Δ ( t ) ρ ρ 1 = 0 ( ρ X ) .
(H2) 
CPTP property: for any t 0 , T Δ ( t ) is CPTP. In particular, ρ 0 T Δ ( t ) ρ 0 , and Tr ( T Δ ( t ) ρ ) = Tr ( ρ ) .
(H3) 
Trace-norm contractivity:
T Δ ( t ) ρ 1 ρ 1 ( t 0 , ρ X ) .
(H4) 
Closed form:
T Δ ( t ) = e γ t Id + 1 e γ t E * , E * ( ρ ) : = n = 1 18 Π n ρ Π n .
Proof. 
(H1) follows from Lemma 96 (exponential semigroup of a bounded generator). (H2) follows from Theorem 17 (closed form and closure of CPTP). (H3) follows by applying the general lemma in § 3 . 3 (CPTP maps are trace-norm contractive: Lemma 63) to T Δ ( t ) . (H4) is the conclusion of Theorem 16. □
(4)
Handoff proposition II: properties of the dissipative generator L Δ (boundedness, domain, conservation laws)
Theorem 23 (Handoff of the dissipative component (generator side)).
Under the minimal specification of § 4 , the dissipative generator L Δ satisfies the following.
(G1) 
Boundedness: L Δ B ( X ) , and
L Δ 1 1 2 γ .
(G2) 
Domain: as the generator of an exponential semigroup,
Dom ( L Δ ) = X
(i.e., no domain issue arises for the dissipative part).
(G3) 
Differential form of trace preservation: for any ρ X ,
Tr ( L Δ [ ρ ] ) = 0 .
(G4) 
Hermiticity preservation: for any ρ X ,
L Δ [ ρ ] = L Δ [ ρ ] .
(G5) 
Reduced form:
L Δ = γ ( E * Id ) , E * 2 = E * .
Proof. (G1) is Lemma 94. (G2) follows by applying the general result for bounded generators (Theorem 13) to A = L Δ , which yields that the domain of the generator is the whole space. (G3) is Lemma 90. (G4) is Lemma 91. (G5) follows from Lemma 89 and Lemma 87 (idempotence). □
(5)
Handoff proposition III: automatic control of the dissipative part in the tangency condition in § 6 (reduction regarding a common core)
In § 6 , one needs to verify, on a dense core, the tangency condition for the product formula,
F ( t ) ρ ρ t ( L 0 + L Δ + R ) ρ ( t 0 ) .
For the dissipative part, since L Δ is bounded and its domain is the whole space, we show that the common-core condition can be reduced essentially to conditions on L 0 and R.
Lemma 100 (Reduction of the common-core condition: the dissipative part automatically fits on the whole space).
When choosing the common core D X used in § 6 , the following hold for the dissipative part:
1.
For any linear subspace D X , D Dom ( L Δ ) holds automatically.
2.
Moreover, for any t 0 , T Δ ( t ) D X holds automatically. In particular, the assumption “ D is invariant under T Δ ( t ) ” is,for the dissipative part alone, not an additional condition (it simply means that T Δ ( t ) acts on the whole space).
3.
The difference appearing in the tangency condition,
T Δ ( t ) ρ ρ t L Δ ρ 1 ,
converges to 0 as t 0 for any ρ X .
Proof. 
(1) and (2) are immediate from Theorem 23-(G2) and the fact that T Δ ( t ) is defined as an operator on X (Theorem 22).
For (3), applying the generator identification (the conclusion of Theorem 13) to L Δ yields that for any ρ X ,
lim t 0 T Δ ( t ) ρ ρ t L Δ ρ 1 = 0
holds. This depends on the fact that the domain of L Δ is the whole space. □
(6)
Usage form in § 6 : checklist (proved items) for the dissipative part
In the componentwise composition in § 6 , the properties required of the dissipative part are:
1.
that T Δ ( t ) is contractive ( T Δ ( t ) 1 1 1 ),
2.
that T Δ ( t ) is strongly continuous,
3.
that T Δ ( t ) is CPTP (to propagate the CPTP property via closure under limits),
4.
that the tangency condition T Δ ( t ) ρ ρ t L Δ ρ holds on a dense set,
and all of these are already proved by Theorem 22 and Lemma 100. Hence, what remains newly required in § 6 is only to choose a common core shared between the remaining components T 0 and T R , and to evaluate the “cross terms” in the tangency condition for the composite F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) .
(7)
Conclusion of this section: the dissipative component satisfies the composition assumptions of § 6 (no unresolved issues remain for the dissipative part)
In this section, we organized and fixed, as proved propositions, the conditions required to feed the dissipative component ( L Δ , T Δ ) into the composition theorem in § 6 . The dissipative semigroup is a strongly continuous CPTP semigroup, is contractive, and admits a closed form (Theorem 22). Since the dissipative generator is bounded and its domain is the whole space, the choice of a common core in § 6 is not restrictive for the dissipative part (Lemma 100). Therefore, the issues to be examined in § 6 concentrate on the unitary and resonance parts, and no additional analytical conditions arise from the dissipative component.
Preprints 193851 i023

5. Zero-Area Resonance Generator R: Definition, Construction, and Basic Properties as a CPTP Semigroup

5.1. Purpose and Targets

(1)
Position of this section: fix an independent “resonance (transport) component,” separate from the dissipative part, in a minimal form that is definable as an analytical foundation
In this chapter, we rigorously construct the Zero-Area Resonance Generator R, introduced as the third component of the Unified Evolution Equation (UEE), as the generator of a strongly continuous CPTP semigroup on the state space X = T 1 ( H ) . In § 2 . 6 , we have already fixed, as a “common specification,”
1.
the resonance projection Π R and its geometric support set supp Σ ( Π R ) ,
2.
the zero-area condition H Σ 2 ( supp Σ ( Π R ) ) = 0 ,
3.
the flux-blocking condition (the normal flux vanishes on the support),
4.
the type of R: a generator of a strongly continuous CPTP semigroup on X,
The role of this chapter is to show that these specifications are not vacuous, and to give, in a self-contained manner within the main text, R and its semigroup T R ( t ) as a minimal construction that is analytically tractable, and to organize them in a form that can be fed into the componentwise composition (Chernoff/Trotter) in § 6 .
(2)
Goal of this chapter: define R primarily as “the generator of a CPTP semigroup { T R ( t ) } ,” and connect zero-area/flux-blocking as accompanying specifications
The most important point as the analytical foundation of this paper is not to leave R ambiguously as “a symbol on the right-hand side of a differential equation,” but rather to first define the semigroup { T R ( t ) } t 0 and then introduce R as its generator by
R [ ρ ] = lim t 0 T R ( t ) [ ρ ] ρ t
(consistently with the definition of generators in § 3 . 1 ). With this standpoint, one can manage the domain, closedness, and conservation laws within the semigroup-theoretic framework, and zero-area/flux-blocking can be attached as additional specifications that regulate “which T R are admissible.”
In this chapter, we adopt the following two-layer structure:
(Layer A) 
Analytical layer (essential): Define T R ( t ) as a strongly continuous CPTP semigroup on X, introduce R as its generator, and prove the basic properties of R (density, closedness, and the differential form of trace preservation).
(Layer B) 
Geometric specification layer (accompanying): Incorporate that the support of Π R satisfies the zero-area condition and that flux-blocking holds as constraints on the construction (or admissible class) of T R , and connect them in a manner consistent with the analytical layer.
Since this chapter is a foundational analytical paper, we do not fix geometric concrete models (such as explicit formulas for flows) more than necessary, but we do present within the main text the minimal sufficient conditions needed to ensure that “the specification is realizable” (for example, line-bundle support).
(3)
Detailed targets: theorem set to be established in this chapter (clarifying proof obligations)
We clearly list the deliverables of this chapter in a form referable by the subsequent sections.
Definition 60 (Deliverables of this chapter (Deliverables of §5)).
We define the deliverables to be established in this chapter ( § 5 ) as the following proposition set:
(D1) 
Definition as a semigroup: Define a strongly continuous semigroup { T R ( t ) } t 0 on the state space X = T 1 ( H ) , and prove that for each t, T R ( t ) is CPTP.
(D2) 
Introduction of the generator: Define R as the generator of T R in the sense of Definition 43, and show that Dom ( R ) is dense and that R is a closed operator.
(D3) 
Differential form of conservation laws: For any ρ Dom ( R ) , prove within the main text that
Tr ( R [ ρ ] ) = 0
(the differential form of trace preservation).
(D4) 
Dual picture: Define T R * ( t ) : B ( H ) B ( H ) by trace duality, establish that { T R * ( t ) } is a normal unital-CP semigroup, and introduce the generator R * so that
Tr ( ( R [ ρ ] ) A ) = Tr ( ρ R * [ A ] )
holds.
(D5) 
Consistency of zero-area/flux-blocking: Show that the zero-area condition and the flux-blocking condition for the resonance projection Π R do not contradict the above semigroup construction, and present at least one realizable sufficient condition (such as line-bundle support).
(D5) 
Handoff to § 6 : Organize that T R is contractive (trace-norm contractive), is strongly continuous, and that a common-core candidate (finite rank, etc.) needed for verifying the tangency condition can be chosen.
(4)
Boundary between what is “proved” and what is “fixed as assumptions” in this chapter
Since this paper is an “analytical foundation,” we do not over-fix the geometric implementation of R (for example, concrete vector fields or streamlines), while the analytical claims (CPTP, strong continuity, closedness of the generator, etc.) are completely proved within the main text. Accordingly, in this chapter we make explicit the following boundary:
1.
Claims in the analytical layer (Layer A) (construction of the CPTP semigroup, properties of the generator, conservation laws) are proved to completion in this chapter.
2.
For the geometric specification layer (Layer B), we fix as “specifications” that the support of Π R is zero-area and that flux-blocking holds, and in this chapter we present sufficient conditions for realizability (such as line-bundle support), while leaving degrees of freedom for implementation.
With this design, regardless of how a subsequent concrete model implements R, this paper becomes a primary source that can be referenced for both “validity as a CPTP semigroup” and the “zero-area/flux-blocking specification.”
(5)
Conclusion of this section: the roadmap (targets) of § 5 has been fixed
From the above, this chapter carries out, in a two-layer structure, (i) primarily defining T R ( t ) as a CPTP semigroup and introducing R as its generator, and (ii) making zero-area/flux-blocking consistent as accompanying specifications. In the subsequent sections, we first construct T R concretely from a normal -*automorphism group on the Heisenberg side (or an equivalent construction), then prove the properties and duality of the generator, and finally organize the handoff conditions needed for § 6 (contractivity and tangency conditions).
Preprints 193851 i024

5.2. Underlying Spaces and Two Equivalent Descriptions (Heisenberg/Schrödinger)

(1)
Aim of this section: fix the types and duality so that the resonance semigroup T R can be handled equivalently both as a normal UCP semigroup on the observable side and as a CPTP semigroup on the state side
In this section, prior to constructing the time evolution of the zero-area resonance component as
T R ( t ) : X = T 1 ( H ) X
(on the state side: Schrödinger picture), we rigorously fix the duality with the normal UCP semigroup on the observable side (Heisenberg picture),
α t : M = B ( H ) M .
In § 2 . 3 we have already proved the equivalence “normal unital-CP ⟺ the predual is CPTP,” but in this section we organize the notation specialized to R and the “duality as semigroups” and the “duality as generators,” so that no confusion of pictures occurs when constructing R in the subsequent sections.
The deliverables are as follows:
1.
For a normal UCP map α : M M , its predual α * : X X exists uniquely, and α is UCP ⟺ α * is CPTP; we restate this equivalence in the context of R.
2.
We define that the semigroup { α t } (Heisenberg) and the semigroup { T R ( t ) } (Schrödinger) are linked by
T R ( t ) = ( α t ) * ,
and prove that this correspondence preserves the semigroup property, continuity, and contractivity.
3.
We define the correspondence between the generator R and the dual generator R * by
Tr ( R [ ρ ] ) A = Tr ρ R * [ A ] ,
and establish within this section that the generator of T R and the generator of α t are dual.
(2)
Underlying spaces (recap): M = B ( H ) and X = T 1 ( H )
Definition 61 (Observable space and state space (standard realization)).
Let H be a complex Hilbert space, and set
M : = B ( H ) , X : = T 1 ( H ) .
Define the dual pairing by
ρ , A : = Tr ( ρ A ) ( ρ X , A M ) .
Lemma 101 (Separation by duality: Tr ( σ A ) = 0 ( A ) σ = 0 ).
If σ X satisfies
Tr ( σ A ) = 0 ( A M ) ,
then σ = 0 .
Proof. 
The proof is the same as Lemma 20 in § 2 . 2 . For arbitrary ψ , ϕ H , take A : = | ψ ϕ | B ( H ) . Then
0 = Tr ( σ | ψ ϕ | ) = Tr ( | σ ψ ϕ | ) = ϕ , σ ψ .
Since ϕ is arbitrary, σ ψ = 0 . Since ψ is also arbitrary, σ = 0 . □
(3)
Normal maps and preduals (preadjoints): existence, uniqueness, and norm estimate
Definition 62 (Normal maps and predual maps).
Let α : M M be a bounded linear map. We say that α isnormalif it is continuous with respect to the σ-weak topology (see § 2 . 3 ). In this case, define thepredual map(preadjoint) α * : X X as the map satisfying
Tr α * ( ρ ) A = Tr ρ α ( A ) ( ρ X , A M )
Lemma 102 (Existence and uniqueness of the predual map).
If α : M M is a normal bounded linear map, then there exists a unique bounded linear map α * : X X satisfying (5.2-∗). Moreover, α * 1 1 α holds.
Proof. 
It suffices to apply Lemma 23 in § 2 . 3 as is. Here we recap only the key points. By normality, for any fixed ρ X , the functional A Tr ( ρ α ( A ) ) is σ -weakly continuous. Under the identification M = X * , any weak-*continuous functional is represented by an element of X (representation lemma for weak-*continuous functionals). Therefore there exists a unique α * ( ρ ) X satisfying (5.2-∗). Linearity follows from uniqueness, and the boundedness estimate follows from
α * ( ρ ) 1 = sup A 1 | Tr ( α * ( ρ ) A ) | = sup A 1 | Tr ( ρ α ( A ) ) | ρ 1 α
(4)
UCP ⟺ CPTP (fixing the equivalence in the context of this chapter)
Lemma 103 (Picture equivalence: normal UCP ⟺ CPTP).
Let α : M M be a normal bounded linear map, and define α * by Lemma 102. Then the following are equivalent:
α is unital - CP ( UCP ) α * is CPTP .
Proof. 
It suffices to restate Lemma 24 in § 2 . 3 . To avoid external references, we state the minimal logic. Unitality corresponds to trace preservation by substituting A = I into (5.2-∗), and complete positivity corresponds via the duality between the amplifications Id n α and Id n α * . Therefore the equivalence holds. □
(5)
Duality of semigroups: the Heisenberg semigroup { α t } and the Schrödinger semigroup { T R ( t ) }
Definition 63 (Duality of semigroups (preadjoint semigroup)).
Let { α t } t 0 be a family of normal linear maps on M . If each α t is normal, then by Lemma 102 the predual α t * exists. Define the state-side family { T R ( t ) } t 0 by
T R ( t ) : = α t * ( t 0 ) .
That is,
Tr T R ( t ) [ ρ ] A = Tr ρ α t ( A ) ( ρ X , A M )
holds.
Lemma 104 (Preservation of the semigroup property: if α t is a semigroup then T R ( t ) is also a semigroup).
Assume that { α t } t 0 satisfies the semigroup property
α 0 = Id , α t + s = α t α s
and that each α t is normal. Then T R ( t ) : = α t * satisfies the semigroup property on X:
T R ( 0 ) = Id , T R ( t + s ) = T R ( t ) T R ( s ) .
Proof. 
First, T R ( 0 ) = α 0 * = ( Id ) * = Id is immediate from the definition. Next, for arbitrary ρ X and A M ,
Tr T R ( t + s ) ρ A = Tr ρ α t + s ( A ) = Tr ρ ( α t α s ) ( A ) = Tr T R ( t ) [ ρ ] α s ( A ) = Tr T R ( s ) T R ( t ) [ ρ ] A ,
where the third equality applies the duality (5.2-SG) in Definition 63 to ( t , ρ ) , and the last equality applies the same duality to ( s , T R ( t ) [ ρ ] ) . By Lemma 101, if traces against all A coincide then the operators coincide, hence
T R ( t + s ) ρ = T R ( s ) T R ( t ) [ ρ ] .
Therefore T R ( t + s ) = T R ( s ) T R ( t ) . (The order appears reversed because we adopt the notation of right action, which corresponds to the fact that the predual maps composition contravariantly. Hereafter, since we use T R ( t ) : = α t * as the Schrödinger time evolution, if one wants to write it in the form T R ( t + s ) = T R ( t ) T R ( s ) , one may adjust the notation for α t as t α t . In this paper, since we adopt the Schrödinger semigroup property as T R ( t + s ) = T R ( t ) T R ( s ) henceforth, we fix the Heisenberg-side notation accordingly.) □
(6)
Propagation of contractivity and CPTP: UCP semigroup ⇒ CPTP semigroup
Theorem 24 (The predual of a normal UCP semigroup is a strongly continuous CPTP semigroup (framework theorem)).
Let { α t } t 0 be a semigroup of normal linear maps on M , and assume that for each t, α t is UCP. Assume furthermore that α t is continuous in the σ-weak topology (i.e., t α t ( A ) is σ-weakly continuous for each A). Then T R ( t ) : = α t * is a strongly continuous CPTP semigroup on X, and in particular,
T R ( t ) [ ρ ] 1 ρ 1 ( t 0 , ρ X )
holds.
Proof. Step 1 (CPTP at each time):
Since each α t is normal UCP, by Lemma 103 the predual T R ( t ) = α t * is CPTP.
Step 2 (semigroup property): Since { α t } is a semigroup, Lemma 104 implies that { T R ( t ) } is also a semigroup (the order follows the contravariance of the predual).
Step 3 (strong continuity): Fix an arbitrary ρ X . For any A M , by the duality (5.2-SG),
Tr ( T R ( t ) [ ρ ] ρ ) A = Tr ρ ( α t ( A ) A ) .
By assumption, t α t ( A ) is σ -weakly continuous, hence the right-hand side converges to 0 as t 0 . Therefore T R ( t ) [ ρ ] ρ holds in the weak topology. Next, since T R ( t ) is CPTP, it satisfies trace-norm contractivity (Lemma 63 in § 3 . 3 ), in particular T R ( t ) [ ρ ] 1 ρ 1 , so it is uniformly bounded. Moreover, by approximation using finite-rank ρ k and an isometry-type argument (isomorphic to the proof of strong continuity in § 3 . 5 ), one can lift weak convergence plus uniform boundedness to strong convergence in · 1 . (Details are restated as a lemma in the subsequent sections; in this section, we adopt the standard conclusion that “the predual of a σ -weakly continuous normal semigroup is a C 0 -semigroup.”) Hence lim t 0 T R ( t ) [ ρ ] ρ 1 = 0 follows.
Step 4 (contractivity): Since T R ( t ) is CPTP for each t, trace-norm contractivity follows from Lemma 63. □
(7)
Dual generators: correspondence between R and R * (fixing the definition)
Definition 64 (Dual generator (observable side) and generator duality).
Let R be the generator (Definition 43) of the strongly continuous semigroup { T R ( t ) } t 0 on X. Define the adjoint semigroup { T R * ( t ) } t 0 B ( M ) by
Tr T R ( t ) [ ρ ] A = Tr ρ T R * ( t ) [ A ] ( ρ X , A M )
(which is unique by Lemma 56). Then for each t, T R * ( t ) is normal UCP (Lemma 62 in § 3 . 3 ), and we define its generator R * by
R * [ A ] : = lim t 0 T R * ( t ) [ A ] A t ( A Dom ( R * ) ) .
Furthermore, we adopt as a specification of this paper the generator duality
Tr ( R [ ρ ] ) A = Tr ρ R * [ A ] ( ρ Dom ( R ) , A Dom ( R * ) )
Lemma 105 (Justification of generator duality (difference-quotient limit)).
In the setting of Definition 64, for ρ Dom ( R ) and A Dom ( R * ) , (5.2-GD) holds.
Proof. 
Compute the difference quotient using (5.2-AD). For any t > 0 ,
Tr T R ( t ) [ ρ ] ρ t A = 1 t Tr ( T R ( t ) [ ρ ] A ) Tr ( ρ A ) = 1 t Tr ( ρ T R * ( t ) [ A ] ) Tr ( ρ A )
= Tr ρ T R * ( t ) [ A ] A t .
Letting t 0 , since ρ Dom ( R ) and A Dom ( R * ) , the left-hand side converges to Tr ( ( R [ ρ ] ) A ) and the right-hand side converges to Tr ( ρ R * [ A ] ) . Since the trace is · 1 -continuous, exchanging limits is justified, and (5.2-GD) follows. □
(8)
Conclusion of this section: the “underlying spaces” and the “two equivalent descriptions” needed to construct R have been fixed
In this section, we fixed the underlying spaces M = B ( H ) and X = T 1 ( H ) as the stage for constructing R, and organized the equivalence between the Heisenberg and Schrödinger descriptions via the predual (preadjoint) of normal maps, at the levels of semigroups and generators. Concretely, we fixed: that the predual α * of a normal UCP map α is CPTP (Lemma 103), the framework that the predual of a normal UCP semigroup { α t } becomes a strongly continuous CPTP semigroup (Theorem 24), and generator duality (Definition 64 and Lemma 105). In the subsequent sections, when constructing T R ( t ) concretely and proving the basic properties of R, we use the framework of this section as a fixed foundation.
Preprints 193851 i025

5.3. Definition of T R ( t ) as a CPTP Transport Semigroup

(1)
Aim of this section: define T R ( t ) primarily as “transport,” and prove within the main text that it is CPTP, a semigroup, and strongly continuous
In this section, we primarily define the time evolution of the resonance (transport) component as
T R ( t ) : X = T 1 ( H ) X ( t 0 ) ,
and fix, with proofs, that it simultaneously satisfies
1.
the semigroup property ( T R ( 0 ) = Id , T R ( t + s ) = T R ( t ) T R ( s ) ),
2.
CPTP (complete positivity and trace preservation),
3.
· 1 strong continuity ( C 0 property),
4.
a unitary implementation induced by a geometric flow (corresponding to the meaning of transport),
within this section. In this section we do not yet define the generator R itself (in the next section we define R = lim t 0 ( T R ( t ) Id ) / t ). Accordingly, the target of this section is to establish that “the semigroup T R ( t ) , which serves as the foundation for R as a generator, is mathematically well-defined as a CPTP transport semigroup.”
(2)
Transport data: measure-preserving flow and the Koopman unitary group
In this paper, transport is defined as a unitary group induced by a measure-preserving flow. (Consistency with zero-area/flux-blocking is connected later under the specification of § 2 . 6 .)
Definition 65 (Measure-preserving flow (transport flow)).
Let ( Σ , B , μ ) be a σ-finite measure space. A family of maps { φ t } t R is called a measure-preserving flow if it satisfies the following:
(F1) 
(Group property) φ 0 = Id Σ , and φ t + s = φ t φ s (for all t , s R ).
(F2) 
(Measurability) For each t, φ t : Σ Σ is measurable.
(F3) 
(Measure preservation) For any E B ,
μ ( φ t 1 ( E ) ) = μ ( E ) ( t R )
holds.
(F4) 
( L 2 strong continuity) The Koopman operators (Definition 66) defined on H : = L 2 ( Σ , μ ) form a strongly continuous group.
Definition 66 
(Koopman unitary group). For ( Σ , μ , φ t ) in Definition 65, define a family of operators { U R ( t ) } t R on H : = L 2 ( Σ , μ ) by
( U R ( t ) f ) ( x ) : = f ( φ t ( x ) ) ( f H ) .
This is called theKoopman operator .
Lemma 106 (The Koopman operators form a unitary group).
The family { U R ( t ) } t R in Definition 66 is a unitary group on H. That is,
U R ( t + s ) = U R ( t ) U R ( s ) , U R ( 0 ) = I , U R ( t ) = U R ( t ) ( t , s R )
hold.
Proof. (i) Group property: 
For f H and x Σ ,
( U R ( t ) U R ( s ) f ) ( x ) = U R ( s ) f ( φ t ( x ) ) = f ( φ s ( φ t ( x ) ) ) = f ( φ ( t + s ) ( x ) ) = ( U R ( t + s ) f ) ( x )
hence U R ( t + s ) = U R ( t ) U R ( s ) by Definition 65-(F1). Also, since ( U R ( 0 ) f ) ( x ) = f ( φ 0 ( x ) ) = f ( x ) , we have U R ( 0 ) = I .
(ii) Isometry: For f H ,
U R ( t ) f L 2 2 = Σ | f ( φ t ( x ) ) | 2 d μ ( x ) .
Use the change of variables y = φ t ( x ) (i.e., x = φ t ( y ) ). By Definition 65-(F3), μ is invariant under φ t , hence
Σ | f ( φ t ( x ) ) | 2 d μ ( x ) = Σ | f ( y ) | 2 d μ ( y ) = f L 2 2 .
Therefore U R ( t ) f L 2 = f L 2 .
(iii) Adjoint and inverse: By (ii), U R ( t ) is an isometry, and by (i), U R ( t ) U R ( t ) = I . Hence U R ( t ) is the inverse of U R ( t ) . An invertible isometry is unitary, and its adjoint equals its inverse, so U R ( t ) = U R ( t ) . □
(3)
Heisenberg transport: definition of a normal -*automorphism group α t
Transport is implemented on the observable side as a -*automorphism (automorphism). Here we define it on B ( H ) by unitary conjugation (normality is automatically ensured).
Definition 67 (Heisenberg transport automorphism group).
Let H = L 2 ( Σ , μ ) , and let { U R ( t ) } t R be the unitary group in Lemma 106. Let the observable algebra be M : = B ( H ) , and define α t : M M by
α t ( A ) : = U R ( t ) A U R ( t ) ( A M )
Lemma 107 ( α t is a normal ∗-automorphism group and, in particular, is normal UCP).
The family { α t } in Definition 67 satisfies the following:
(A1) 
(Group property) α t + s = α t α s , α 0 = Id .
(A2) 
(-*automorphism) α t ( A B ) = α t ( A ) α t ( B ) , α t ( A ) = α t ( A ) .
(A3) 
(Normality) α t is σ-weakly continuous (hence normal).
(A4) 
(UCP) α t is unital-CP (hence UCP).
Proof. (A1):
By the unitary group property U R ( t + s ) = U R ( t ) U R ( s ) and U R ( 0 ) = I (Lemma 106),
α t + s ( A ) = U R ( t + s ) A U R ( t + s ) = U R ( s ) U R ( t ) A U R ( t ) U R ( s ) = α s ( α t ( A ) ) .
Also α 0 ( A ) = A .
(A2): For products,
α t ( A B ) = U R ( t ) A B U R ( t ) = ( U R ( t ) A U R ( t ) ) ( U R ( t ) B U R ( t ) ) = α t ( A ) α t ( B ) .
For adjoints,
α t ( A ) = U R ( t ) A U R ( t ) = U R ( t ) A U R ( t ) = α t ( A ) .
(A3): For any ρ T 1 ( H ) and A B ( H ) , by cyclicity of the trace (Lemma 71),
Tr ρ α t ( A ) = Tr ρ U R ( t ) A U R ( t ) = Tr U R ( t ) ρ U R ( t ) A .
If · 1 -continuity in t holds for the unitary conjugation U R ( t ) ρ U R ( t ) on T 1 ( H ) (isomorphic to Lemma 74 in § 3 . 5 ), then σ -weak continuity follows. Here, using Definition 65-(F4), U R ( t ) is strongly continuous on H, and hence, by the same finite-rank approximation argument as in that lemma, ρ U R ( t ) ρ U R ( t ) is strongly continuous on T 1 , so α t is σ -weakly continuous (normal).
(A4): Unitality follows from α t ( I ) = U R ( t ) I U R ( t ) = I . Complete positivity is shown directly on ampliations. For any n N , U ˜ R ( t ) : = I n U R ( t ) is unitary on C n H . Therefore for any positive operator X B ( C n H ) ,
( Id n α t ) ( X ) = U ˜ R ( t ) X U ˜ R ( t ) 0
(which can be checked by inner products). Hence Id n α t preserves positivity. Since n is arbitrary, α t is completely positive. □
(4)
Schrödinger transport: definition and explicit formula of the CPTP semigroup T R ( t )
We define the predual of the normal UCP semigroup α t on the observable side as the time evolution on the state side. Under a unitary implementation, the state-side evolution is also explicitly given by unitary conjugation.
Definition 68 (CPTP transport semigroup (Schrödinger picture)).
Let the state space be X : = T 1 ( H ) , and let α t be defined by Definition 67. For each t 0 , define the predual map T R ( t ) : X X by
Tr T R ( t ) [ ρ ] A = Tr ρ α t ( A ) ( ρ X , A B ( H ) )
(existence and uniqueness follow from Lemma 102 in § 5 . 2 ).
Lemma 108 (Explicit formula: T R ( t ) [ ρ ] = U R ( t ) ρ U R ( t ) ).
For T R ( t ) in Definition 68, for any ρ X ,
T R ( t ) [ ρ ] = U R ( t ) ρ U R ( t )
holds.
Proof. 
Take arbitrary ρ X and A B ( H ) . By cyclicity of the trace (Lemma 71),
Tr U R ( t ) ρ U R ( t ) A = Tr ρ U R ( t ) A U R ( t ) = Tr ρ α t ( A ) .
Since the right-hand side is the right-hand side of Definition 68, the element of X satisfying (5.3-S) is unique (Lemma 101 in § 5 . 2 ). Therefore T R ( t ) [ ρ ] = U R ( t ) ρ U R ( t ) . □
(5)
Main theorem: T R ( t ) is a strongly continuous CPTP transport semigroup and is trace-norm isometric
Theorem 25 (Basic properties of the CPTP transport semigroup).
The family { T R ( t ) } t 0 determined by Definition 68 satisfies the following:
(T1) 
(Semigroup property) T R ( 0 ) = Id and T R ( t + s ) = T R ( t ) T R ( s ) ( t , s 0 ).
(T2) 
(CPTP) For each t 0 , T R ( t ) is CPTP.
(T3) 
(Trace-norm isometry) For any ρ X , T R ( t ) [ ρ ] 1 = ρ 1 .
(T4) 
(Strong continuity) For any ρ X , lim t 0 T R ( t ) [ ρ ] ρ 1 = 0 .
Therefore { T R ( t ) } is a strongly continuous CPTP transport semigroup on X and is isometric.
Proof. (T1) Semigroup property: 
Use the explicit formula in Lemma 108. Since U R ( t ) is a unitary group (Lemma 106),
T R ( t + s ) [ ρ ] = U R ( t + s ) ρ U R ( t + s ) = U R ( t ) U R ( s ) ρ U R ( s ) U R ( t ) = T R ( t ) T R ( s ) [ ρ ] .
Also T R ( 0 ) [ ρ ] = U R ( 0 ) ρ U R ( 0 ) = ρ .
(T2) CPTP: TP: By Lemma 71 and U R ( t ) U R ( t ) = I ,
Tr ( T R ( t ) [ ρ ] ) = Tr ( U R ( t ) ρ U R ( t ) ) = Tr ( ρ U R ( t ) U R ( t ) ) = Tr ( ρ ) .
CP: Fix any n and set U ˜ R ( t ) : = I n U R ( t ) . For any positive trace-class operator Σ T 1 ( C n H ) ,
( Id n T R ( t ) ) [ Σ ] = U ˜ R ( t ) Σ U ˜ R ( t )
holds (it holds on simple tensors and extends by linear continuous extension). For any ξ , by inner products, ξ , U ˜ R Σ U ˜ R ξ = U ˜ R ξ , Σ U ˜ R ξ 0 , so the right-hand side is positive. Hence Id n T R ( t ) preserves positivity. Since n is arbitrary, T R ( t ) is completely positive. Thus T R ( t ) is CPTP.
(T3) Isometry: This follows by a computation isomorphic to Lemma 73 in § 3 . 5 . Using the square root | ρ | of ρ ρ ,
| U R ρ U R | = U R | ρ | U R
holds, hence
T R ( t ) [ ρ ] 1 = Tr ( | U R ρ U R | ) = Tr ( U R | ρ | U R ) = Tr ( | ρ | ) = ρ 1 .
(T4) Strong continuity: Since U R ( t ) is strongly continuous on H (Definition 65-(F4)), the same finite-rank approximation argument as Lemma 74 in § 3 . 5 implies that U R ( t ) ρ U R ( t ) ρ 1 0 as t 0 on T 1 ( H ) . This proves (T1)–(T4). □
(6)
“Localization” implementation for connecting to the zero-area specification (minimal organization in this section)
Under the specification of this paper ( § 2 . 6 ), selective localization of transport by the resonance projection Π R is required. In this section, we prepare, as a definition, a standard implementation of localized transport semigroups (verification of the zero-area condition itself is treated in subsequent sections).
Definition 69 (Localized transport unitaries ( Π R -localization)).
Let Π R be a self-adjoint projection ( Π R = Π R , Π R 2 = Π R ). A unitary group { U R ( t ) } is said to be Π R -localizedif
U R ( t ) Π R = Π R U R ( t ) ( t ) , U R ( t ) ( I Π R ) = ( I Π R ) ( t )
holds.
Lemma 109 ( Π R -localization preserves the CPTP property and isometry).
For { U R ( t ) } satisfying Definition 69, T R ( t ) [ ρ ] = U R ( t ) ρ U R ( t ) satisfies the conclusions of Theorem 25 (CPTP, isometry, strong continuity). Moreover, on ( I Π R ) , T R ( t ) coincides with the identity:
( I Π R ) T R ( t ) [ ρ ] ( I Π R ) = ( I Π R ) ρ ( I Π R ) .
Proof. 
CPTP, isometry, and strong continuity follow because the proof of Theorem 25 depends only on unitarity and strong continuity of { U R ( t ) } . For the last identity, by (5.3-LOC), using U R ( t ) ( I Π R ) = ( I Π R ) and U R ( t ) ( I Π R ) = ( I Π R ) ,
( I Π R ) T R ( t ) [ ρ ] ( I Π R ) = ( I Π R ) U R ( t ) ρ U R ( t ) ( I Π R ) = ( I Π R ) ρ ( I Π R )
holds. □
(7)
Conclusion of this section: T R ( t ) has been primarily defined as a CPTP transport semigroup, and the foundation for the subsequent discussion (the generator R) in § 5 has been fixed
In this section, using the Koopman unitary group { U R ( t ) } induced by a measure-preserving flow, we defined the normal -*automorphism group on the Heisenberg side α t ( A ) = U R ( t ) A U R ( t ) , and defined the Schrödinger-side transport semigroup T R ( t ) as its predual (Definitions 67, 68). We further derived the explicit formula T R ( t ) [ ρ ] = U R ( t ) ρ U R ( t ) (Lemma 108), and completely proved within the main text that T R ( t ) is a strongly continuous CPTP semigroup and is trace-norm isometric (Theorem 25). Finally, we minimally organized the Π R -localization implementation to connect to the zero-area specification (Definition 69, Lemma 109). In the next section, we define R as the generator of this T R ( t ) and prove basic identities such as the differential form of conservation laws.
Preprints 193851 i026

5.4. Definition of the Generator R (Strong Derivative) and Basic Identities

(1)
Aim of this section: define the generator R as the strong derivative of T R ( t ) , and fix within the main text the conservation laws, -*compatibility, and tangent-cone compatibility of the positive cone
In the previous section ( § 5 . 3 ), we established that the transport semigroup { T R ( t ) } t 0 is a strongly continuous CPTP semigroup on the state space X = T 1 ( H ) (in fact, it is the restriction of an isometric group). In this section, following the general theory of § 3 . 1 , we define the generator R as the strong derivative of T R ( t ) , and completely prove and fix within the main text the following basic identities:
1.
The domain Dom ( R ) of the generator and uniqueness of the action R [ ρ ] (fixing the definition).
2.
The differential form of trace preservation Tr ( R [ ρ ] ) = 0 , which follows from T R ( t ) being TP.
3.
∗-compatibility derived from CPTP (the differential form of Hermiticity preservation): R [ ρ ] = R [ ρ ] .
4.
The tangent-cone compatibility of the positive cone (tangent cone property) as the differential form of positivity preservation: if ρ 0 , then R [ ρ ] belongs to the tangent cone of the positive cone. (This is a technical point that ensures that positivity does not break in the componentwise composition in § 6 .)
All definitions and proofs are completed within this section.
(2)
Definition 5.6: generator R (strong derivative)
Definition 70 (Generator R (strong derivative)).
Let X be a Banach space (in this chapter, X = T 1 ( H ) ), and let { T R ( t ) } t 0 B ( X ) be a C 0 -semigroup ( § 5 . 3 ). Define the domain of the generator R by
Dom ( R ) : = ρ X : σ X such that lim t 0 T R ( t ) [ ρ ] ρ t σ 1 = 0 .
For ρ Dom ( R ) , the element σ obtained by the above limit is unique, and we define
R [ ρ ] : = lim t 0 T R ( t ) [ ρ ] ρ t .
We call this the generator of { T R ( t ) } .
Lemma 110 (Uniqueness, closedness, and density (general properties of generators)).
The operator R defined by Definition 70 is linear, and the following hold:
1.
Dom ( R ) is dense in X,
2.
R is a closed operator,
3.
for t 0 and ρ Dom ( R ) , one has T R ( t ) [ ρ ] Dom ( R ) and R T R ( t ) [ ρ ] = T R ( t ) R [ ρ ] .
Proof. 
By Theorem 25 in § 5 . 3 , { T R ( t ) } is a C 0 -semigroup. Therefore the conclusion follows by directly applying the general results of § 3 . 1 (linearity of the generator: Lemma 49, closedness: Lemma 51, density of the domain: Lemma 52, compatibility with the semigroup: Lemma 50). □
(3)
Lemma 5.7: TP Tr ( R [ ρ ] ) = 0 (differential form of information conservation)
Lemma 111 (Differential form of trace preservation (TP Tr ( R [ ρ ] ) = 0 )).
Assume that { T R ( t ) } is trace-preserving (TP), i.e.,
Tr ( T R ( t ) [ ρ ] ) = Tr ( ρ ) ( t 0 , ρ X ) .
Then for any ρ Dom ( R ) ,
Tr ( R [ ρ ] ) = 0
holds.
Proof. 
Take an arbitrary ρ Dom ( R ) . By assumption, for any t > 0 ,
Tr ( T R ( t ) [ ρ ] ) Tr ( ρ ) = 0 .
Dividing both sides by t gives
Tr T R ( t ) [ ρ ] ρ t = 0 .
Let t 0 . By Definition 70, T R ( t ) [ ρ ] ρ t R [ ρ ] in · 1 . Since the trace is continuous with respect to · 1 (Lemma 16 in § 2 . 2 ), we may pass the limit outside the trace and obtain
0 = lim t 0 Tr T R ( t ) [ ρ ] ρ t = Tr ( R [ ρ ] ) .
Hence the conclusion follows. □
(4)
∗-compatibility: ( R [ ρ ] ) = R [ ρ ] (differential form of Hermiticity preservation)
Lemma 112 (∗-preservation of T R ( t ) and -*compatibility of the generator).
Assume that { T R ( t ) } is CPTP (Theorem 25 in § 5 . 3 ). Then the following hold:
1.
For any t 0 and any ρ X ,
T R ( t ) [ ρ ] = T R ( t ) [ ρ ]
holds.
2.
Moreover, for any ρ Dom ( R ) , one has ρ Dom ( R ) and
R [ ρ ] = R [ ρ ]
holds.
Proof. Proof of (i):
Since T R ( t ) is CP, it preserves positivity. Decompose any ρ X as ρ = ρ + i ρ :
ρ : = ρ + ρ 2 , ρ : = ρ ρ 2 i .
Then ρ and ρ are self-adjoint. A CPTP map is linear, and positivity preservation implies that it preserves self-adjointness: indeed, a self-adjoint S = S can be written as S = S + S with S ± 0 , hence T R ( t ) S = T R ( t ) S + T R ( t ) S is a difference of positive operators and therefore self-adjoint. Thus T R ( t ) [ ρ ] and T R ( t ) [ ρ ] are self-adjoint, and
T R ( t ) [ ρ ] = T R ( t ) [ ρ ] + i T R ( t ) [ ρ ] = T R ( t ) [ ρ ] i T R ( t ) [ ρ ]
= T R ( t ) [ ρ i ρ ] = T R ( t ) [ ρ ] .
This proves (5.4-∗).
Proof of (ii): Let ρ Dom ( R ) . By Definition 70,
R [ ρ ] = lim t 0 T R ( t ) [ ρ ] ρ t in · 1 .
First we show that ρ Dom ( R ) . Using (5.4-∗),
T R ( t ) [ ρ ] ρ t = ( T R ( t ) [ ρ ] ) ρ t = T R ( t ) [ ρ ] ρ t .
The right-hand side converges in · 1 to ( R [ ρ ] ) as t 0 (the adjoint is · 1 -continuous: X Y 1 = X Y 1 ). Hence the difference-quotient limit exists, so ρ Dom ( R ) and
R [ ρ ] = ( R [ ρ ] )
holds. This is exactly (5.4-∗∗). □
(5)
Lemma 5.8: differential form of positivity preservation (tangent-cone compatibility of the positive cone)
Here we formulate and fix the “differential form of positivity preservation” in terms of the standard notion of the contingent cone.
Definition 71 (Positive cone and contingent cone).
Let X = T 1 ( H ) and define the positive cone by
X + : = { ρ X : ρ 0 }
(where ρ 0 means positive semidefinite as an operator). Define the contingent cone (Bouligand/contingent cone) T X + ( ρ ) X at a point ρ X + by
T X + ( ρ ) : = v X : t k 0 , ρ k X + s . t . ρ k ρ 1 0 , ρ k ρ t k v 1 0 .
Lemma 113 (Tangent-cone compatibility: positivity preservation R [ ρ ] T X + ( ρ ) ).
Assume that { T R ( t ) } t 0 preserves positivity (i.e., ρ 0 T R ( t ) [ ρ ] 0 ). For ρ X + Dom ( R ) ,
R [ ρ ] T X + ( ρ )
holds.
Proof. 
Take ρ X + Dom ( R ) . Set t k : = 1 / k and define
ρ k : = T R ( t k ) ρ .
By positivity preservation, ρ k X + for each k. Since T R is strongly continuous, ρ k ρ 1 = T R ( t k ) ρ ρ 1 0 as k . Moreover, since ρ Dom ( R ) ,
ρ k ρ t k R [ ρ ] 1 = T R ( t k ) ρ ρ t k R [ ρ ] 1 0 ( k )
holds. This satisfies the condition of Definition 71, hence R [ ρ ] T X + ( ρ ) . □
(6)
Immediate corollary: ρ ( t ) = T R ( t ) [ ρ 0 ] stays inside the positive cone, and the tangent is given by R [ ρ ]
Theorem 26 (Positivity invariance and tangent (geometric interpretation of the mild solution)).
Let ρ 0 X + . Then t ρ ( t ) : = T R ( t ) [ ρ 0 ] stays in X + (i.e., ρ ( t ) X + ). Moreover, if ρ 0 Dom ( R ) , then the tangent at t = 0 is R [ ρ 0 ] , and
lim t 0 ρ ( t ) ρ 0 t R [ ρ 0 ] 1 = 0 , R [ ρ 0 ] T X + ( ρ 0 )
hold.
Proof. 
Positivity preservation follows from CP as part of CPTP, hence ρ 0 0 T R ( t ) [ ρ 0 ] 0 . Therefore ρ ( t ) X + . If ρ 0 Dom ( R ) , then by Definition 70 the difference quotient converges to R [ ρ 0 ] , and Lemma 113 yields the tangent-cone inclusion. □
(7)
Conclusion of this section: R has been defined as a strong derivative, and the identities needed for componentwise composition in § 6 have been fixed
In this section, we defined the generator R of the CPTP transport semigroup T R ( t ) as the strong derivative (Definition 70), and rigorously derived from TP the differential form of trace preservation Tr ( R [ ρ ] ) = 0 (Lemma 111). We further established the ∗-compatibility derived from CPTP as a difference-quotient limit and fixed ( R [ ρ ] ) = R [ ρ ] (Lemma 112). Finally, we formulated the differential form of positivity preservation in terms of the contingent cone and proved that if ρ 0 then R [ ρ ] belongs to the tangent cone of the positive cone (Lemma 113). These are the basic identities ensuring that “positivity and trace preservation do not break” in the composite generation in § 6 .
Preprints 193851 i027

5.5. Zero-Area Specification

(1)
Aim of this section: fix zero-area as a “measure-theoretic dimension condition,” and complete within the main text a sufficient condition (line support) to avoid vacuity of the definition
In this section, we fix the geometric specification zero-area imposed on the resonance projection Π R as a dimension condition on the support set based on the two-dimensional Hausdorff measure. The aim of this section is “fixing the specification as an analytical foundation,” and we do not reprove in this section physical consequences such as elimination of boundary terms (area-term cancellation). That is, in this section we:
1.
rigorously define the support set supp ( Π R ) Σ of the resonance projection Π R ,
2.
declare the zero-area condition H Σ 2 ( supp ( Π R ) ) = 0 as a specification,
3.
prove line-by-line, as a sufficient condition frequently used later, that “if the support is line support (one-dimensional flow support) then zero-area holds automatically,” thereby showing that the definition is not vacuous,
and complete these within the main text.
(2)
Geometric stage: boundary Σ and the two-dimensional Hausdorff measure H Σ 2
Definition 72 (Boundary metric space and the two-dimensional Hausdorff measure (recap)).
Let Σ be a metric space equipped with a distance d Σ , and define the diameter by
diam ( U ) : = sup { d Σ ( x , y ) : x , y U } .
For E Σ and δ > 0 , define
H Σ , δ 2 ( E ) : = inf j = 1 diam ( U j ) 2 : E j = 1 U j , diam ( U j ) δ ,
and define
H Σ 2 ( E ) : = lim δ 0 H Σ , δ 2 ( E )
and call it the two-dimensional Hausdorff measure.
(3)
Support of the resonance projection Π R : definition via an operator-valued Radon measure
Definition 73 
(Operator-valued Radon measure and representation of a projection). Let Σ be a locally compact Hausdorff space and let its Borel σ-algebra be B ( Σ ) . Let H Σ be a Hilbert space, and write B Σ : = B ( H Σ ) . A map μ Π : B ( Σ ) B Σ is called an operator-valued Radon measure if:
(M1) 
For any countable disjoint family { E j } B ( Σ ) , one has, in the weak operator topology,
μ Π j = 1 E j = j = 1 μ Π ( E j )
(countable additivity).
(M2) 
For any u , v H Σ , the complex measure
ν u , v ( E ) : = u , μ Π ( E ) v H Σ
is a finite Radon measure.
Moreover, if Π R B Σ satisfies
u , Π R v = Σ d ν u , v ( x ) ( u , v H Σ )
then we say that Π R is representable by μ Π .
Definition 74 (Support of a projection operator).
Assume that the representation in Definition 73 is given. An open set U Σ is said to be  μ Π -nullif
μ Π ( U ) = 0 ( the zero operator )
holds. Define the support set supp ( Π R ) Σ by
supp ( Π R ) : = Σ { U Σ : U is open and μ Π ( U ) = 0 }
(Equivalently, x supp ( Π R ) means that every neighborhood U x satisfies μ Π ( U ) 0 .)
Lemma 114 (Closedness: supp ( Π R ) is closed).
The set supp ( Π R ) in Definition 74 is closed in the topology of Σ.
Proof. By (5.5-SUP),
Σ supp ( Π R ) = { U Σ : U is open and μ Π ( U ) = 0 } .
The right-hand side is a union of open sets and hence is open. Therefore its complement supp ( Π R ) is closed. □
(4)
Definition of the zero-area condition and a basic equivalence (characterization by coverings)
Definition 75 (zero-area specification (dimension condition on the support set)).
For the support set supp ( Π R ) Σ of the resonance projection Π R , if
H Σ 2 supp ( Π R ) = 0
holds, then we say that Π R (and the associated resonance mechanism) is zero-area .
Theorem 27 (Basic property of zero-area sets: squared-diameter coverings with arbitrary precision).
Assume that a set E Σ satisfies
H Σ 2 ( E ) = 0 .
Then for any ε > 0 , there exists a countable open cover { U j } j 1 such that
E j = 1 U j , j = 1 diam ( U j ) 2 < ε
holds. Conversely, if for any ε > 0 there exists a cover satisfying (5.5-COV), then H Σ 2 ( E ) = 0 holds.
Proof. (i) H Σ 2 ( E ) = 0 existence of a cover: By the assumption H Σ 2 ( E ) = 0 and Definition 72, for any δ > 0 we have H Σ , δ 2 ( E ) = 0 . Fix δ : = 1 . Since H Σ , 1 2 ( E ) = 0 , the infimum in Definition 72 is 0, hence for any ε > 0 there exists a cover { U j } j 1 such that
E j 1 U j , diam ( U j ) 1 , j 1 diam ( U j ) 2 < ε .
In particular, (5.5-COV) follows.
(ii) existence of a cover H Σ 2 ( E ) = 0 : Assume that for any ε > 0 there exists a cover satisfying (5.5-COV). Take an arbitrary δ ( 0 , 1 ] , and first refine the cover in (5.5-COV) to a cover satisfying the diameter condition diam ( U j ) δ . Concretely, since each U j is open, U j can be covered by a countable family of open sets of diameter δ : for each point x U j , take an open ball B ( x , δ / 2 ) U j , then diam ( B ( x , δ / 2 ) ) δ holds. Since Σ is a separable metric space (in this paper, we assume locally compact and second countable as a boundary), by the Lindelöf property one can extract a countable subcover. Thus each U j is covered by countably many open sets of diameter δ .
Perform this refinement for all j, and denote the resulting overall countable cover by { V k } k 1 . Then E k V k and diam ( V k ) δ hold. Moreover, since the refinement replaces each U j by a cover with smaller diameters, the squared-diameter sum can be controlled from above (by standard procedures, e.g., approximating each U j by finitely many balls, one can ensure that for any η > 0 , k diam ( V k ) 2 j diam ( U j ) 2 + η ). Therefore, for any ε > 0 ,
H Σ , δ 2 ( E ) k = 1 diam ( V k ) 2 < ε + η
holds. Letting η 0 yields H Σ , δ 2 ( E ) ε . Since ε > 0 is arbitrary, H Σ , δ 2 ( E ) = 0 . Finally, taking the limit δ 0 yields H Σ 2 ( E ) = 0 . □
(5)
Lemma 5.10: one-dimensional flow support (line support) ⇒ zero-area (a sufficient condition to avoid vacuity of the definition)
Lemma 115 (One-dimensional flow support ⇒ zero-area).
Assume that E Σ is contained in a union of the images of countably many C 1 curves: namely, assume that there exist C 1 maps γ k : [ 0 , 1 ] Σ ( k N ) such that
E k = 1 γ k ( [ 0 , 1 ] )
holds. Then
H Σ 2 ( E ) = 0
holds. Consequently, if supp ( Π R ) E , then the zero-area specification (ZA) holds.
Proof. 
Step 1 ( C 1 curve images are Lipschitz): Fix k. Since γ k is C 1 on [ 0 , 1 ] , its derivative γ ˙ k is continuous, and by compactness sup s [ 0 , 1 ] γ ˙ k ( s ) < (norm in local coordinates). Therefore, by a mean-value estimate, there exists a constant L k < such that
d Σ ( γ k ( s ) , γ k ( t ) ) L k | s t | ( s , t [ 0 , 1 ] )
holds. That is, γ k is Lipschitz.
Step 2 ( H Σ 2 of a Lipschitz curve image is zero): For fixed k, set Γ k : = γ k ( [ 0 , 1 ] ) . Take an arbitrary δ > 0 . Let m : = L k δ , and partition the interval into m equal parts, I j = [ j 1 m , j m ] . Let U k , j : = γ k ( I j ) . Then for any s , t I j , | s t | 1 / m , hence
diam ( U k , j ) = sup s , t I j d Σ ( γ k ( s ) , γ k ( t ) ) sup s , t I j L k | s t | L k m δ .
Therefore { U k , j } j = 1 m is a δ -cover of Γ k . Hence, by Definition 72,
H Σ , δ 2 ( Γ k ) j = 1 m diam ( U k , j ) 2 m L k m 2 = L k 2 m L k 2 L k / δ = L k δ .
Letting δ 0 , the right-hand side converges to 0, hence
H Σ 2 ( Γ k ) = lim δ 0 H Σ , δ 2 ( Γ k ) = 0 .
Step 3 (nullness under countable unions): By (5.5-LINE), E k 1 Γ k . Since Hausdorff measure is countably subadditive,
H Σ 2 ( E ) H Σ 2 k = 1 Γ k k = 1 H Σ 2 ( Γ k ) = k = 1 0 = 0 .
Therefore H Σ 2 ( E ) = 0 . The final claim ( supp ( Π R ) E zero-area) follows from monotonicity in Definition 75 ( A B H Σ 2 ( A ) H Σ 2 ( B ) ). □
(6)
Conclusion of this section: zero-area has been fixed as a measure-theoretic specification, and a sufficient condition via line support has been proved within the main text
In this section, we defined the geometric specification zero-area associated with the resonance projection Π R as vanishing of the two-dimensional Hausdorff measure of the support set, H Σ 2 ( supp ( Π R ) ) = 0 (Definition 75), and established closedness of the support set (Lemma 114). We further derived, as a basic consequence of the zero-area condition, that “squared-diameter coverings with arbitrary precision” are possible, directly from the definition of Hausdorff measure (Theorem 27). Finally, we proved line-by-line that if the support is contained in a union of countably many C 1 curve images (line support, one-dimensional flow support), then zero-area holds automatically (Lemma 115), thereby excluding vacuity of the definition.
Preprints 193851 i028

5.6. Sufficient Condition via a Lindblad Representation

(1)
Aim of this section: prove in a self-contained manner within the main text that if R is given in GKLS (Lindblad) form, then { e t R } t 0 is a CPTP semigroup
In § 5 . 3 § 5 . 4 , we defined the generator R from the transport semigroup T R ( t ) constructed as transport. However, one may often ask:
“Can one also show, by another (standard) sufficient condition, that R is indeed the generator of a CPTP semigroup?”
In this section we provide such a sufficient condition: if R is represented in GKLS (Lindblad) form (under appropriate boundedness), then the exponential semigroup { e t R } t 0 is a strongly continuous CPTP semigroup.
The basic proof strategy is as follows:
1.
From the GKLS form, construct a Kraus representation of a “small time-step” map (hence CPTP).
2.
Show in · 1 that the step map is tangent to R.
3.
Represent e t R as a strong limit of CPTP maps via a power limit, and derive CPTP-ness of e t R from closure of CPTP ( § 3 . 3 ).
This section is a “sufficient condition” and does not depend on the origin of R (transport or dissipation).
(2)
Setup: Hilbert space and state space, finitely many Lindblad operators
Definition 76 (Lindblad data (finite sum)).
Let H be a complex Hilbert space, and set
M : = B ( H ) , X : = T 1 ( H ) .
We call the following the Lindblad data:
(L0) 
A bounded self-adjoint operator H = H M (Hamiltonian part).
(L1) 
A finite family of bounded operators { L k } k = 1 M M ( M < ).
(L2) 
A positive operator
C : = k = 1 M L k L k M .
(3)
GKLS (Lindblad) form: definition and boundedness of the resonance generator R
Definition 77 (Generator R GKLS in GKLS (Lindblad) form).
For the Lindblad data ( H , { L k } ) in Definition 76, define the linear map R GKLS : X X by
R GKLS [ ρ ] : = i [ H , ρ ] + k = 1 M L k ρ L k 1 2 { L k L k , ρ } ( ρ X )
(where the commutator is [ H , ρ ] = H ρ ρ H and the anticommutator is { A , ρ } = A ρ + ρ A ).
Lemma 116 (Boundedness: R GKLS B ( X ) ).
R GKLS is a bounded linear map on X, and for any ρ X ,
R GKLS [ ρ ] 1 2 H + 2 C ρ 1
holds. Consequently, R GKLS 1 1 2 H + 2 C .
Proof. 
Take an arbitrary ρ X . First, for the reversible (Hamiltonian) part, by the two-sided multiplication estimate (Lemma 17 in § 2 . 2 ),
H ρ 1 H ρ 1 , ρ H 1 ρ 1 H = H ρ 1 ,
hence
[ H , ρ ] 1 H ρ 1 + ρ H 1 2 H ρ 1 .
Therefore
i [ H , ρ ] 1 = [ H , ρ ] 1 2 H ρ 1 .
Next, for the dissipative (Lindblad) part, for each k the same estimate yields
L k ρ L k 1 L k ρ 1 L k = L k 2 ρ 1 .
Also, since L k L k C (order of positive operators), we have L k L k C . Hence
L k L k ρ 1 L k L k ρ 1 C ρ 1 , ρ L k L k 1 C ρ 1 .
Thus, for each k,
L k ρ L k 1 2 { L k L k , ρ } 1 L k ρ L k 1 + 1 2 L k L k ρ 1 + 1 2 ρ L k L k 1 L k 2 ρ 1 + C ρ 1 .
Since the sum is finite,
k = 1 M L k ρ L k 1 2 { L k L k , ρ } 1 k = 1 M L k 2 ρ 1 + M C ρ 1 .
Moreover, since k = 1 M L k 2 k = 1 M L k L k M C , the right-hand side is bounded by 2 M C ρ 1 . More sharply, using C = k L k L k ,
k = 1 M L k ρ L k 1 k = 1 M L k 2 ρ 1 k = 1 M L k L k ρ 1 = C ρ 1
(using subadditivity of the operator norm for a finite sum and L k L k L k 2 ). Similarly, the anticommutator term satisfies C ρ 1 + ρ C 1 2 C ρ 1 , hence the whole dissipative part is bounded by 2 C ρ 1 . Combining yields
R GKLS [ ρ ] 1 2 H ρ 1 + 2 C ρ 1 = ( 2 H + 2 C ) ρ 1 ,
as claimed. □
(4)
CPTP approximation for small times (Kraus form): Chernoff approximation of the dissipative part
Next, we approximate the dissipative part
D [ ρ ] : = k = 1 M L k ρ L k 1 2 { L k L k , ρ }
to first order by a family of CPTP maps.
Lemma 117 (Existence of the square root: sufficient condition for I h C 0 ).
Let C 0 be a bounded positive operator. If h [ 0 , 1 / C ] (and if C = 0 , any h 0 ), then
I h C 0
holds, and hence the square root of the positive operator
K 0 ( h ) : = I h C
exists uniquely in M .
Proof. 
Since C 0 , we have 0 C C I (spectral radius estimate for positive operators). If h [ 0 , 1 / C ] , then
0 h C h C I I ,
hence I h C 0 . The square root of a positive operator exists uniquely by continuous functional calculus in a C * -algebra. □
Definition 78 (Small-time Kraus map (dissipative part)).
Let h [ 0 , 1 / C ] , and let K 0 ( h ) = I h C be as in Lemma 117. For k = 1 , , M , define
K k ( h ) : = h L k .
Define the map Φ h : X X by
Φ h ( ρ ) : = k = 0 M K k ( h ) ρ K k ( h ) ( ρ X )
Lemma 118 ( Φ h is CPTP (hence trace-norm contractive)).
The map Φ h in Definition 78 is CPTP for any h [ 0 , 1 / C ] . In particular,
Φ h ( ρ ) 1 ρ 1 ( ρ X )
holds.
Proof. 
Complete positivity (CP) follows immediately from the Kraus form (5.6-PHI) (the same Kraus operators give positivity preservation on ampliations).
For trace preservation (TP), it suffices to show the Kraus completeness relation
k = 0 M K k ( h ) K k ( h ) = I
Indeed, for ρ X , by cyclicity of the trace (Lemma 71),
Tr ( Φ h ( ρ ) ) = k = 0 M Tr K k ρ K k = k = 0 M Tr ρ K k K k = Tr ρ k = 0 M K k K k ,
so if (5.6-K) holds then Tr ( Φ h ( ρ ) ) = Tr ( ρ ) .
We verify (5.6-K):
K 0 ( h ) K 0 ( h ) = I h C , k = 1 M K k ( h ) K k ( h ) = k = 1 M h L k L k = h C .
Summing gives I h C + h C = I . Hence Φ h is CPTP.
Finally, trace-norm contractivity follows by applying Lemma 63 in § 3 . 3 . □
(5)
Tangency: Φ h agrees with the dissipative generator D to first order
Lemma 119 (Difference-quotient limit for the square root).
Let C 0 be a bounded positive operator and let h ( 0 , 1 / C ] . Let K 0 ( h ) = I h C . Then
K 0 ( h ) I h = C ( I + I h C ) 1
holds. Consequently,
lim h 0 K 0 ( h ) I h + 1 2 C = 0 .
Proof. 
First apply the scalar identity 1 u 1 = u / ( 1 + 1 u ) via continuous functional calculus with u = h C . Since C and I h C commute,
I h C I = ( h C ) ( I + I h C ) 1 ,
and dividing both sides by h yields (5.6-SQ)
Next, as h 0 , I h C I holds in operator norm (continuity of the function 1 u ). Hence I + I h C 2 I , and therefore the inverse also converges in norm:
( I + I h C ) 1 ( 2 I ) 1 .
Thus the right-hand side of (5.6-SQ) converges to C ( 2 I ) 1 = 1 2 C , proving (5.6-LIM). □
Lemma 120 
(Tangency: ( Φ h Id ) / h D (in · 1 )). For Φ h in Definition 78 and
D [ ρ ] : = k = 1 M L k ρ L k 1 2 { L k L k , ρ }
for any ρ X ,
lim h 0 Φ h ( ρ ) ρ h D [ ρ ] 1 = 0
holds.
Proof. 
Take an arbitrary ρ X . By Definition 78,
Φ h ( ρ ) ρ = K 0 ( h ) ρ K 0 ( h ) ρ + h k = 1 M L k ρ L k .
Therefore
Φ h ( ρ ) ρ h = K 0 ( h ) ρ K 0 ( h ) ρ h + k = 1 M L k ρ L k .
Hence it suffices to show
K 0 ( h ) ρ K 0 ( h ) ρ h h 0 1 2 ( C ρ + ρ C ) in · 1 .
Let E ( h ) : = K 0 ( h ) I , so that K 0 ( h ) = I + E ( h ) . Then
K 0 ( h ) ρ K 0 ( h ) ρ = ( I + E ) ρ ( I + E ) ρ = E ρ + ρ E + E ρ E .
Therefore,
K 0 ( h ) ρ K 0 ( h ) ρ h = E ( h ) h ρ + ρ E ( h ) h + E ( h ) ρ E ( h ) h .
Step 1 (limit of the linear terms): By Lemma 119, E ( h ) h 1 2 C in operator norm. By the two-sided multiplication estimate (Lemma 17),
E ( h ) h + 1 2 C ρ 1 E ( h ) h + 1 2 C ρ 1 0 ,
and similarly,
ρ E ( h ) h + 1 2 C 1 ρ 1 E ( h ) h + 1 2 C 0 .
Hence the linear terms in (5.6-SPLIT) satisfy
E ( h ) h ρ + ρ E ( h ) h 1 2 ( C ρ + ρ C ) in · 1 .
Step 2 (vanishing of the quadratic term): By the identity (5.6-SQ) in Lemma 119,
E ( h ) = K 0 ( h ) I = h C ( I + I h C ) 1 h C ( I + I h C ) 1 .
For 0 h 1 / C , we have 0 I h C I , hence I h C 0 , so I + I h C I and therefore ( I + I h C ) 1 1 . Thus
E ( h ) h C .
By the two-sided multiplication estimate,
E ( h ) ρ E ( h ) h 1 1 h E ( h ) ρ 1 E ( h ) 1 h ( h C ) ρ 1 ( h C ) = h C 2 ρ 1 0 .
Hence the quadratic term vanishes.
Step 3 (conclusion): Combining (5.6-SPLIT), (5.6-L1), and (5.6-Q) yields (5.6-K0). Therefore,
Φ h ( ρ ) ρ h k = 1 M L k ρ L k 1 2 ( C ρ + ρ C ) = D [ ρ ]
in · 1 , which is (5.6-TAN)). □
(6)
First-order approximation of the Hamiltonian part: tangency of unitary conjugation
Lemma 121 
(Tangency of unitary conjugation: ( U h Id ) / h i [ H , · ] (in · 1 )). Let H = H B ( H ) and define U ( h ) : = e i h H . Define U h : X X by
U h ( ρ ) : = U ( h ) ρ U ( h ) .
Then for any ρ X ,
lim h 0 U h ( ρ ) ρ h + i [ H , ρ ] 1 = 0
holds.
Proof. 
Since H is bounded, U ( h ) = e i h H is differentiable in operator norm, and
lim h 0 U ( h ) I h + i H = 0 , lim h 0 U ( h ) I h i H = 0 .
(For example, using U ( h ) I = i 0 h H e i s H d s immediately yields ( U ( h ) I ) / h + i H 0 .)
For any ρ X ,
U h ( ρ ) ρ = U ( h ) ρ U ( h ) ρ = ( U ( h ) I ) ρ U ( h ) + ρ ( U ( h ) I ) .
Dividing by h gives
U h ( ρ ) ρ h + i [ H , ρ ] = U ( h ) I h + i H ρ U ( h ) + ρ U ( h ) I h i H + i H ρ ( U ( h ) I ) .
Estimate each term in · 1 . By the two-sided multiplication estimate (Lemma 17) and U ( h ) = 1 ,
U ( h ) I h + i H ρ U ( h ) 1 U ( h ) I h + i H ρ 1 U ( h ) = U ( h ) I h + i H ρ 1 0
(by (5.6-Ud)). The second term converges to 0 by the same argument.
For the third term, since U ( h ) I h H (a basic estimate for exponentials),
i H ρ ( U ( h ) I ) 1 H ρ 1 U ( h ) I H ρ 1 h H = h H 2 ρ 1 ,
and since the term appears as i H ρ ( U ( h ) I ) in (5.6-SPLU), it converges to 0 as h 0 . Therefore (5.6-U) holds. □
(7)
Main theorem: GKLS form e t R GKLS is a CPTP semigroup (sufficient condition)
Theorem 28 
(GKLS form makes { e t R GKLS } t 0 a CPTP semigroup (sufficient condition)). Consider R GKLS B ( X ) in Definition 77. Then the exponential semigroup
T ( t ) : = e t R GKLS ( t 0 )
is a strongly continuous semigroup, and moreover for each t 0 , T ( t ) is CPTP. Hence { T ( t ) } t 0 is a strongly continuous CPTP semigroup.
Proof. Step 1 (existence of the exponential semigroup: strongly continuous semigroup):
By Lemma 116, R GKLS B ( X ) . Hence by § 3 . 4 (exponential semigroups of bounded generators), T ( t ) = e t R GKLS is a strongly continuous semigroup on X.
Step 2 (construction of a CPTP approximating family): Let h ( 0 , 1 / C ] , and define the dissipative approximation Φ h by Definition 78. Also define the unitary approximation U h ( ρ ) = e i h H ρ e i h H , and set
F h : = U h Φ h ( h ( 0 , 1 / C ] ) .
By Lemma 118 and the CPTP property of unitary conjugation in § 3 . 5 (Lemma 72), F h is CPTP (closure under composition: Lemma 64). Therefore, for each n, F t / n n is also CPTP.
Step 3 (tangency: F h = Id + h R GKLS + o ( h ) ): For any ρ X ,
F h ( ρ ) ρ h = U h ( Φ h ( ρ ) ) Φ h ( ρ ) h + Φ h ( ρ ) ρ h .
The second term satisfies, by Lemma 120,
Φ h ( ρ ) ρ h D [ ρ ] ( h 0 ) .
For the first term, apply Lemma 121 not to ρ but to Φ h ( ρ ) to obtain
U h ( Φ h ( ρ ) ) Φ h ( ρ ) h + i [ H , Φ h ( ρ ) ] 1 0 .
Moreover, since Φ h ( ρ ) ρ (indeed, Φ h is C 0 and in particular Φ h ( ρ ) ρ 1 = O ( h ) ), by continuity of two-sided multiplication,
[ H , Φ h ( ρ ) ] [ H , ρ ] 1 2 H Φ h ( ρ ) ρ 1 0 .
Hence
U h ( Φ h ( ρ ) ) Φ h ( ρ ) h i [ H , ρ ] .
Substituting into (5.6-SPL) gives
F h ( ρ ) ρ h i [ H , ρ ] + D [ ρ ] = R GKLS [ ρ ] ( h 0 ) .
Step 4 (power limit: F t / n n ρ e t R GKLS ρ ): Since R GKLS is bounded, the exponential semigroup is given by a series and satisfies
e h R GKLS = I + h R GKLS + O ( h 2 ) in · 1 1 .
On the other hand, (5.6-TANF) means F h = I + h R GKLS + o ( h ) . Therefore,
F h e h R GKLS 1 1 = o ( h ) ( h 0 ) .
Applying the telescoping identity for differences of powers ( § 3 . 6 (3.6-TEL)) with S = F t / n and B = e ( t / n ) R GKLS , for any ρ X ,
F t / n n ρ e t R GKLS ρ 1 n F t / n e ( t / n ) R GKLS 1 1 ρ 1 sup 0 k n 1 e k ( t / n ) R GKLS 1 1 .
Since R GKLS is bounded, e s R GKLS 1 1 e s R GKLS 1 1 holds, hence the right-hand side is
n F t / n e ( t / n ) R GKLS 1 1 e t R GKLS 1 1 ρ 1 .
By (5.6-ERR), F t / n e ( t / n ) R GKLS 1 1 = o ( t / n ) , hence the whole expression satisfies n · o ( t / n ) 0 . Therefore
F t / n n ρ e t R GKLS ρ ( n )
for any ρ X .
Step 5 (CPTP property: applying closure): For each n, F t / n n is CPTP (Step 2), and (5.6-LIM) is pointwise · 1 convergence. Hence, by closure under limits in § 3 . 3 (Theorem 12), the limit map e t R GKLS is CPTP. This proves the conclusion. □
(8)
Remark: Π R -localized Lindblad data is consistent with the zero-area specification (an optional sufficient condition)
Since this section is a “sufficient condition,” it is not essential; however, in order to make consistency with the zero-area specification explicit, we record one localization condition.
Lemma 122 
(Invariance under Π R -localized Lindblad data). Let Π R = Π R = Π R 2 B ( H ) be a projection, and assume that
H = Π R H Π R , L k = Π R L k Π R ( k = 1 , , M )
holds. Then R GKLS acts trivially on the complement ( I Π R ) H , and for any ρ X ,
( I Π R ) e t R GKLS [ ρ ] ( I Π R ) = ( I Π R ) ρ ( I Π R ) ( t 0 )
holds.
Proof. 
By (5.6-LOC), H ( I Π R ) = 0 , ( I Π R ) H = 0 , and L k ( I Π R ) = 0 , ( I Π R ) L k = 0 . Hence C = k L k L k also satisfies C ( I Π R ) = 0 and ( I Π R ) C = 0 .
For any ρ X , consider the block ρ 00 : = ( I Π R ) ρ ( I Π R ) . For the commutator part,
( I Π R ) [ H , ρ 00 ] ( I Π R ) = 0
(since H does not act on the complement). For the dissipative part, L k ρ 00 L k = 0 (because L k ( I Π R ) = 0 on both sides) and { L k L k , ρ 00 } = 0 (because C does not act on the complement), hence
( I Π R ) R GKLS [ ρ 00 ] ( I Π R ) = 0 .
Since R GKLS is bounded, the exponential semigroup is given by a series:
e t R GKLS [ ρ 00 ] = n = 0 t n n ! R GKLS n [ ρ 00 ] = ρ 00
(all terms with n 1 vanish). Therefore (5.6-INV) holds. □
(9)
Conclusion of this section: the GKLS form guarantees CPTP-ness of e t R
In this section, under the sufficient condition that R is given in the GKLS (Lindblad) form (5.6-GKLS), we proved in a self-contained manner within the main text that the exponential semigroup { e t R } becomes a strongly continuous CPTP semigroup (Theorem 28). The key points of the proof are: constructing the small-time Kraus approximation Φ h (Definition 78), showing that it is tangent to the dissipative generator (Lemma 120), showing that unitary conjugation is tangent to the commutator generator (Lemma 121), and deriving CPTP-ness of e t R by using closure under composition and closure under limits for CPTP maps ( § 3 . 3 ). Thus, independently of the transport construction, we have provided a standard sufficient condition for R being a generator of a CPTP semigroup.
Preprints 193851 i029

6. Total Generator L tot = L 0 + L Δ + R : Semigroup Generation by CPTP Componentwise Composition and Well-Posedness

6.1. Goal of This Section

(1)
Position of this chapter: define the total generator L tot as a “limit of componentwise composition,” and establish well-posedness while preserving CP/TP
This chapter is the final destination as the analytical foundation of this paper. So far, we have established within the main text:
1.
that the reversible part (unitary conjugation) T 0 ( t ) is a strongly continuous CPTP group ( § 3 . 5 ),
2.
that the dissipative part T Δ ( t ) = e t L Δ is a strongly continuous CPTP semigroup ( § 4 . 4 ),
3.
that the resonance (transport) part T R ( t ) is a strongly continuous CPTP semigroup and that the generator R is defined ( § 5 . 3 § 5 . 4 ),
4.
that CPTP maps are closed under composition and limits ( § 3 . 3 ),
5.
that the Chernoff/Trotter-type product formula (a theorem identifying a product limit with a known semigroup) holds ( § 3 . 6 ).
In this chapter, we integrate these results, construct the full time evolution of the UEE as
T ( t ) : = lim n T 0 ( t / n ) T Δ ( t / n ) T R ( t / n ) n ,
and show that this T ( t ) :
1.
is a strongly continuous CPTP semigroup (hence preserves the state set),
2.
has generator equal to the closure of L tot : = L 0 + L Δ + R ,
3.
and therefore yields that the UEE is well posed in the sense of mild solutions (existence, uniqueness, and continuous dependence).
The proofs in this chapter are completely unrelated to “cryptographic inverse problems,” etc., and close purely as an analytic semigroup generation problem.
(2)
Methodology of this chapter: CPTP componentwise composition + (i) CPTP propagation by closure, (ii) generator identification by a product formula
The strategy of this chapter consists of two independent pillars:
(A) 
Preservation of CPTP (closure): For each n,
T ( n ) ( t ) : = T 0 ( t / n ) T Δ ( t / n ) T R ( t / n ) n
is immediately guaranteed to be CPTP by closure of CPTP under composition. If, moreover, T ( n ) ( t ) ρ T ( t ) [ ρ ] in · 1 , then by closure of CPTP under limits, T ( t ) is also CPTP. Hence, once “existence of the limit” is established, the CPTP property propagates automatically.
(B) 
Identification of the limit semigroup (Chernoff/Trotter): Apply the product formula ( § 3 . 6 ) and show, on a dense core, that
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t )
is tangent to the generator A : = L 0 + L Δ + R , thereby obtaining
lim n F ( t / n ) n = e t A ¯
(a known semigroup). Since the dissipative part is bounded, the common-core condition is reduced essentially to conditions on L 0 and R ( § 4 . 6 ).
Therefore, the most important technical points in this chapter are (i) the choice of a common core D and (ii) verification of the tangency condition
lim t 0 F ( t ) ρ ρ t ( L 0 + L Δ + R ) ρ 1 = 0 ( ρ D ) .
(3)
Main theorem to be proved in this chapter (fixing the formal goal)
We announce the main claims of this chapter as a theorem in a form referable by subsequent sections, thereby clarifying the proof obligations.
Theorem 29 (Main theorem of this chapter (announcement: composite limit, CPTP, generator identification, and well-posedness)).
In the standard realization X = T 1 ( H ) , let T 0 ( t ) be the unitary-conjugation CPTP group of § 3 . 5 , let T Δ ( t ) be the dissipative CPTP semigroup of § 4 . 4 , and let T R ( t ) be the resonance CPTP semigroup of § 5 . 3 . Define
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) , T ( n ) ( t ) : = F ( t / n ) n .
Assume that the tangency condition holds on a dense subspace D X . Then the following hold:
1.
For any t 0 and ρ X , the limit
T ( t ) [ ρ ] : = lim n T ( n ) ( t ) ρ
exists in · 1 , and { T ( t ) } t 0 is a strongly continuous semigroup.
2.
For each t 0 , T ( t ) is CPTP.
3.
The generator of this semigroup coincides with
L tot ¯ ( where L tot : = L 0 + L Δ + R ) .
4.
Therefore, for any initial state ρ 0 S ( H ) ,
ρ ( t ) : = T ( t ) [ ρ 0 ]
is the mild solution of the UEE and is unique. Moreover, ρ ( t ) S ( H ) holds for all t 0 .
Proof. 
This subsection is a declaration of the goal, and the proof is given in § 6 . 2 and thereafter. However, the proof strategy is as described in (2): (1) and (3) follow from the Chernoff-type product formula in § 3 . 6 , (2) follows from closure of CPTP in § 3 . 3 , and (4) follows from the solution concept (mild solution) in § 3 . 2 and state invariance under CPTP. □
(4)
Conclusion form of this chapter (summary of the “goal” for the reader)
This chapter finally fixes the standpoint that the UEE is “defined as a semigroup so as to avoid domain issues.” That is, the solution of the UEE is given by
ρ ( t ) = T ( t ) [ ρ 0 ] ,
and T ( t ) is constructed as the composite limit of component CPTP semigroups. This construction simultaneously satisfies the physical requirements (complete positivity and normalization preservation) and the mathematical requirements (strongly continuous semigroup and generator identification).
Preprints 193851 i030

6.2. Fixing the Three Component Semigroups (CPTP) and the Types of Generators

(1)
Aim of this section: type the objects of composition as “CPTP semigroups on the same state space X,” and rigorously fix that addition of the generators L 0 , L Δ , R is meaningful
In this chapter, we construct the full time evolution as
T ( t ) = lim n T 0 ( t / n ) T Δ ( t / n ) T R ( t / n ) n .
For this composition to be mathematically legitimate, the three components
T 0 ( t ) , T Δ ( t ) , T R ( t )
must be defined as bounded linear operators on the same Banach space X, and moreover the generators of the components
L 0 , L Δ , R
must be linear operators on the same space X so that they can be added.
The purpose of this section is to fix this “typing” completely by definitions and lemmas:
1.
Fix the state space as the standard realization X = T 1 ( H ) and confirm that all three components act on X.
2.
Define the reversible part L 0 not as D on the Hilbert space, but as the generator on the state space, L 0 [ ρ ] : = i [ D , ρ ] , thereby excluding type confusion (such as writing D + R ).
3.
Restate within this section, using the theorems and lemmas already established, that each component semigroup is CPTP and is · 1 -contractive (at least 1 ), and connect this to the assumptions (contraction family) of the product formula in § 6 .
(2)
Fixing the state space: X = T 1 ( H ) and the density-operator set
Definition 79 (State space and state set used in this chapter).
Let H be a complex Hilbert space, and set
X : = T 1 ( H )
as the state space (a Banach space). Define the set of density operators (state set) by
S ( H ) : = { ρ X : ρ 0 , Tr ( ρ ) = 1 } .
All time-evolution maps treated in this chapter are defined as bounded linear maps X X .
(3)
Fixing the types of component generators: L 0 , L Δ , R are all generators on X
Definition 80 (Reversible generator L 0 (definition on the state space)).
Take a self-adjoint operator D = D (on H ), and define the linear operator L 0 on the state space X by
L 0 [ ρ ] : = i [ D , ρ ] = i ( D ρ ρ D )
L 0 is understood as a generator on X and is not identified with D itself.
Definition 81 (Dissipative generator L Δ (definition on the state space)).
We use in this chapter the GKLS generator L Δ : X X defined in § 4 . 2 . Under the minimal specification,
L Δ = γ ( E * Id ) ( γ > 0 , E * 2 = E * )
holds ( § 4 . 2 ).
Definition 82 
(Resonance generator R (definition on the state space)). As defined in § 5 . 4 , define R as the generator of T R ( t ) by
R [ ρ ] : = lim t 0 T R ( t ) [ ρ ] ρ t ( ρ Dom ( R ) )
where R is a densely defined closed operator on X (Lemma 110).
Lemma 123 (Type consistency: L tot = L 0 + L Δ + R is meaningful as an operator on X (with a domain)).
Under Definitions 80–82,
L tot : = L 0 + L Δ + R
can be defined as a linear operator on X. Concretely, setting
Dom ( L tot ) : = Dom ( L 0 ) Dom ( R )
(since L Δ is bounded, its domain is all of X), for any ρ Dom ( L tot ) ,
L tot [ ρ ] = L 0 [ ρ ] + L Δ [ ρ ] + R [ ρ ]
is well-defined.
Proof. 
L Δ is a bounded linear operator, hence Dom ( L Δ ) = X . On the other hand, L 0 is in general unbounded (when D is unbounded) and comes with a domain, and R is also a densely defined closed operator and comes with a domain (Lemma 110). Therefore, by taking the sum on the intersection Dom ( L 0 ) Dom ( R ) , L tot is well-defined as a linear operator on X. □
(4)
Definition of the component semigroups: T 0 ( t ) , T Δ ( t ) , T R ( t )
Definition 83 (The three component semigroups (on the state space)).
Define the families of maps on the state space X as follows:
(C0) 
Reversible part (unitary conjugation):
T 0 ( t ) [ ρ ] : = U ( t ) ρ U ( t ) , U ( t ) : = e i t D , t R .
() 
Dissipative part (exponential semigroup):
T Δ ( t ) : = e t L Δ , t 0 .
(CR) 
Resonance part (transport semigroup): Let T R ( t ) be given by the construction in § 5 . 3 (or an equivalent construction), and assume that its generator is R.
(5)
The component semigroups are CPTP (hence contractive): confirming the assumptions needed for the product formula in § 6
Theorem 30 (CPTP property and contractivity of the three components (reconfirmation in this chapter)).
For the component semigroups in Definition 83, the following hold.
(i) 
T 0 ( t ) is CPTP for t R and is trace-norm isometric:
T 0 ( t ) ρ 1 = ρ 1 .
(ii) 
T Δ ( t ) is a strongly continuous CPTP semigroup for t 0 and is trace-norm contractive:
T Δ ( t ) ρ 1 ρ 1 .
(iii) 
T R ( t ) is a strongly continuous CPTP semigroup for t 0 , and in the minimal transport construction it is trace-norm isometric:
T R ( t ) [ ρ ] 1 = ρ 1 .
Consequently, for each t 0 , the composition
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t )
is CPTP and satisfies trace-norm contractivity.
Proof. (i) follows from Lemma 72 and Lemma 73 in § 3 . 5 . (ii) follows from Theorem 17 in § 4 . 4 and Lemma 63 in § 3 . 3 . (iii) follows from Theorem 25 in § 5 . 3 .
Finally, CPTP-ness of F ( t ) follows from closure of CPTP under composition (Lemma 64 in § 3 . 3 ), and contractivity follows from chaining (i)(ii)(iii):
F ( t ) ρ 1 T Δ ( t ) T R ( t ) [ ρ ] 1 T R ( t ) [ ρ ] 1 ρ 1 .
(6)
Preparation for composition in §6: minimal requirements for treating F ( t ) as a Chernoff approximating family
Lemma 124 ( F ( t ) is a contraction family (requirement for a Chernoff family)).
Let F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) ( t 0 ). Then
F ( 0 ) = Id , F ( t ) 1 1 1 ( t 0 ) , lim t 0 F ( t ) ρ ρ 1 = 0 ( ρ X )
hold. Hence F is a contraction family in the sense of Definition 52.
Proof. 
F ( 0 ) = T 0 ( 0 ) T Δ ( 0 ) T R ( 0 ) = Id is immediate from the initial conditions of the semigroups. F ( t ) 1 1 1 follows from contractivity in Theorem 30.
For strong continuity, for any ρ X ,
F ( t ) ρ ρ 1 T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] T Δ ( t ) T R ( t ) [ ρ ] 1 + T Δ ( t ) T R ( t ) [ ρ ] T R ( t ) [ ρ ] 1 + T R ( t ) [ ρ ] ρ 1 .
The first term converges to 0 by strong continuity of T 0 ( t ) ( § 3 . 5 ) and isometry. The second term converges to 0 by strong continuity of T Δ ( t ) ( § 4 . 4 ) and contractivity. The third term converges to 0 by strong continuity of T R ( t ) ( § 5 . 3 ). Hence the whole expression converges to 0 as t 0 . □
(7)
Conclusion of this section: the types of the three component semigroups and generators have been fixed, and the “contraction family F” needed to apply the product formula in § 6 has been prepared
In this section, we defined the three component generators L 0 , L Δ , R all as operators on the state space X, and fixed the domain on which the sum L tot = L 0 + L Δ + R is meaningful (Lemma 123). We also reconfirmed that the component semigroups T 0 , T Δ , T R are CPTP and hence contractive, and showed that the composition F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) is a Chernoff approximating family (contraction family) (Theorem 30, Lemma 124). Hereafter, in § 6 , the remaining core task is to verify the tangency condition on a common core and identify the composite limit as the correct semigroup by the product formula in § 3 . 6 .
Preprints 193851 i031

6.3. Definition of the Composite Approximation (Trotter/Chernoff Type)

(1)
Aim of this section: rigorously define the “composite approximation sequence” T ( n ) ( t ) for defining the full time evolution T ( t ) , and fix within this section CPTP-ness, contractivity, and basic consistency
In this section, we rigorously define the composite approximation
T ( n ) ( t ) : = T 0 ( t / n ) T Δ ( t / n ) T R ( t / n ) n ,
which is the central construction of § 6 , and prove and fix within this section the properties that can be determined at this stage (CPTP-ness, contractivity, invariance of states). Since this approximating sequence is the starting point for showing (i) existence of the limit and (ii) generator identification in the subsequent sections, it is necessary to eliminate ambiguity of the definition (in particular, order of action, domain, and the norm used for estimates).
The deliverables of this section are the following three points:
1.
Fix the definitions of the Chernoff approximating family F ( t ) and the n-partition approximation T ( n ) ( t ) .
2.
Prove immediately that each T ( n ) ( t ) is CPTP and hence preserves S ( H ) .
3.
Prove that each T ( n ) ( t ) is trace-norm contractive ( · 1 -contractive) and hence is compatible with stability under limit operations ( § 3 . 3 ).
(2)
Definition of the Chernoff approximating family F ( t ) (fixing the order)
In this paper, we fix, as the order of action in the Schrödinger picture,
F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) .
The order does not mean “apply resonance (transport) first, then dissipation (coarse-graining), and finally unitary conjugation,” but is simply the definition of the composition. No commutativity is assumed.
Definition 84 (Composite approximating family (Chernoff approximating family)).
Let the state space be X : = T 1 ( H ) , and let the component semigroups T 0 ( t ) ( t R ), T Δ ( t ) ( t 0 ), and T R ( t ) ( t 0 ) be as in Definition 83. Define the composite approximating family F : [ 0 , ) B ( X ) by
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) ( t 0 )
(where the product is operator composition).
Lemma 125 (Initial condition: F ( 0 ) = Id ).
The family F ( t ) in Definition 84 satisfies
F ( 0 ) = Id X .
Proof. 
By the initial conditions of the component semigroups T 0 ( 0 ) = T Δ ( 0 ) = T R ( 0 ) = Id ,
F ( 0 ) = T 0 ( 0 ) T Δ ( 0 ) T R ( 0 ) = Id .
(3)
Definition of the n-partition composite approximation T ( n ) ( t ) (fixing the meaning of powers)
Definition 85 
(n-partition composite approximation (Trotter/Chernoff type)). For t 0 and n N , define the n-partition composite approximation map T ( n ) ( t ) : X X by
T ( n ) ( t ) : = F ( t / n ) n ( t 0 , n N )
where F ( t / n ) n means the n-fold iteration of operator composition:
F ( t / n ) n : = F ( t / n ) F ( t / n ) F ( t / n ) n times .
Lemma 126 (Normalization: T ( 1 ) ( t ) = F ( t ) , T ( n ) ( 0 ) = Id ).
Under Definition 85,
T ( 1 ) ( t ) = F ( t ) , T ( n ) ( 0 ) = Id ( n N )
hold.
Proof. 
The case n = 1 is immediate from the definition. For t = 0 , Lemma 125 gives F ( 0 ) = Id , hence
T ( n ) ( 0 ) = F ( 0 ) n = Id n = Id .
(4)
Immediate properties of the composite approximation sequence: CPTP-ness and invariance of the state set
Lemma 127 
(The composite approximation T ( n ) ( t ) is CPTP). For any t 0 and any n N , T ( n ) ( t ) is CPTP.
Proof. 
By Theorem 30 in § 6 . 2 , each component T 0 ( t / n ) , T Δ ( t / n ) , T R ( t / n ) is CPTP (since t / n 0 ). Therefore, by closure of CPTP under composition (Lemma 64 in § 3 . 3 ),
F ( t / n ) = T 0 ( t / n ) T Δ ( t / n ) T R ( t / n )
is CPTP. Applying closure of CPTP under composition n times yields that F ( t / n ) n is also CPTP. That is, T ( n ) ( t ) is CPTP. □
Theorem 31 (State invariance along the approximation sequence (for each n)).
Let ρ 0 S ( H ) (a density operator), and define
ρ ( n ) ( t ) : = T ( n ) ( t ) ρ 0 .
Then for any t 0 and any n N ,
ρ ( n ) ( t ) S ( H ) that is ρ ( n ) ( t ) 0 , Tr ρ ( n ) ( t ) = 1
holds.
Proof. 
By Lemma 127, T ( n ) ( t ) is CPTP. Hence if ρ 0 0 , then T ( n ) ( t ) ρ 0 0 , and by trace preservation, Tr ( T ( n ) ( t ) ρ 0 ) = Tr ( ρ 0 ) = 1 . Therefore ρ ( n ) ( t ) S ( H ) . □
(5)
Contractivity: T ( n ) ( t ) ρ 1 ρ 1 (uniform bound)
Lemma 128 
(Trace-norm contractivity of the composite approximation sequence). For any t 0 , any n N , and any ρ X ,
T ( n ) ( t ) ρ 1 ρ 1
holds. Consequently, T ( n ) ( t ) 1 1 1 .
Proof. 
By Lemma 127, T ( n ) ( t ) is CPTP. By Lemma 63 in § 3 . 3 , any CPTP map is trace-norm contractive, hence
T ( n ) ( t ) ρ 1 ρ 1
follows immediately. The operator-norm estimate follows from the definition. □
(6)
Telescoping identity (estimating differences): preparation for the limit proof in § 6 . 5
To prove existence of the composite limit, one needs to estimate the Cauchy property of T ( n ) ( t ) . As a standard tool, we restate here the telescoping identity for differences of powers, preparing for the subsequent sections.
Lemma 129 (Telescoping identity for differences of powers).
For any bounded linear operators S , B B ( X ) and any n N ,
S n B n = k = 0 n 1 S n 1 k ( S B ) B k
holds. In particular, if S and B are contractions ( · 1 ), then
S n x B n x X n ( S B ) x X ( x X )
holds.
Proof. 
The identity (6.3-TEL) is a standard identity used in the proof of § 3 . 6 , and can be proved by induction. Here we give a line-by-line proof. The case n = 1 is trivial. Assume it holds for n. Then
S n + 1 B n + 1 = S n + 1 S n B + S n B B n + 1 = S n ( S B ) + ( S n B n ) B .
Substituting the induction hypothesis gives
S n + 1 B n + 1 = S n ( S B ) + k = 0 n 1 S n 1 k ( S B ) B k + 1 = k = 0 n S n k ( S B ) B k ,
which is (6.3-TEL) for n + 1 . Hence it holds for all n.
Next, if S and B are contractions, then by the triangle inequality and S m 1 , B k 1 ,
S n x B n x k = 0 n 1 S n 1 k ( S B ) B k x k = 0 n 1 ( S B ) B k x k = 0 n 1 ( S B ) x = n ( S B ) x ,
where the last step follows from the coarse estimate using B k x x and ( S B ) B k x ( S B ) B k x . (A sharper estimate is used in the subsequent sections.) □
(7)
Conclusion of this section: the composite approximation sequence is “CPTP, contractive, and state-invariant at each stage,” and the remaining tasks are only existence of the limit and generator identification
In this section, we rigorously defined the composite approximating family F ( t ) and the n-partition composite approximation T ( n ) ( t ) (Definitions 84, 85), and showed that each T ( n ) ( t ) is CPTP (Lemma 127) and preserves the density-operator set (Theorem 31). We also proved that T ( n ) ( t ) 1 1 1 holds for all n , t by CPTP contractivity (Lemma 128). Therefore, as long as the limit T ( t ) = lim n T ( n ) ( t ) exists, by closure of CPTP under limits ( § 3 . 3 ), T ( t ) is also CPTP. The remaining core tasks are: (i) existence of the limit (Cauchy property), and (ii) generator identification by verifying the Chernoff tangency condition. These are treated in the subsequent sections.
Preprints 193851 i032

6.4. The “Common Core” Assumption Required for Identifying the Generator

(1)
Aim of this section: fix the “common core” required to identify the generator via the product formula, as type and convergence conditions
The Chernoff/Trotter-type product formula established in § 3 . 6 guarantees that if the composite approximating family F ( t ) can be verified, on an appropriate core, to be tangent to a generator A, then
lim n F ( t / n ) n
coincides with the semigroup corresponding to A. In this chapter, the composite approximation is
F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) ( t 0 ) ,
and the formal total generator is
L tot = L 0 + L Δ + R
( § 6 . 2 ). However, since L 0 and R are generally unbounded and come with domains, generator identification requires that on a common dense subspace D X one can verify
F ( t ) ρ ρ t ( L 0 + L Δ + R ) ρ ( t 0 ) .
In this section, we fix, as a definition, the common core assumption for this purpose, and furthermore, as a lemma, rigorously show within the main text that (because the dissipative part is bounded) the assumption is reduced essentially to conditions on L 0 and R.
(2)
Organizing the domains: fixing the formal domain of the total generator as the intersection of the domains of L 0 and R
Definition 86 (Formal total generator and its domain).
Let the state space be X : = T 1 ( H ) . Let L 0 , L Δ , R be given by Definitions 80–82 in § 6 . 2 . Define the domain of the formal total generator L tot by
Dom ( L tot ) : = Dom ( L 0 ) Dom ( R ) ,
and for ρ Dom ( L tot ) define
L tot [ ρ ] : = L 0 [ ρ ] + L Δ [ ρ ] + R [ ρ ]
(where L Δ is bounded, hence Dom ( L Δ ) = X ).
Lemma 130 (Density of the domain).
Dom ( L tot ) = Dom ( L 0 ) Dom ( R ) is dense in X.
Proof. 
L 0 is the generator of the C 0 group T 0 ( t ) , and R is the generator of the C 0 semigroup T R ( t ) . Hence applying Lemma 52 in § 3 . 1 to each yields that Dom ( L 0 ) and Dom ( R ) are both dense in X. In general, in a topological space, the intersection of dense sets is dense, hence Dom ( L 0 ) Dom ( R ) is also dense. □
(3)
Common core assumption (fixed): the minimal package required to identify the generator via the product formula
Definition 87 (Common Core Assumption).
In order to identify the generator using the composite approximating family F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) of § 6 . 3 , assume that there exists a linear subspace D X satisfying the following:
(CC1) 
Density and common domain: D is dense in X, and
D Dom ( L 0 ) Dom ( R ) = Dom ( L tot ) .
(CC2) 
(If needed) core property: Consider the closure L tot ¯ of L tot , and assume that D is a core of it (i.e., L tot | D ¯ = L tot ¯ ).
(CC3) 
Chernoff tangency condition (central condition for generator identification): For any ρ D ,
lim t 0 F ( t ) ρ ρ t L tot [ ρ ] 1 = 0 .
(4)
Automaticity of the dissipative part: since L Δ is bounded, it is not a “constraint” for the common core
Lemma 131 (Difference quotient for a bounded generator: T Δ ( t ) is differentiable on the whole space).
Let T Δ ( t ) = e t L Δ and assume L Δ B ( X ) ( § 4 . 3 ). Then for any ρ X ,
lim t 0 T Δ ( t ) ρ ρ t L Δ [ ρ ] 1 = 0
holds. Hence the common-core condition is automatically satisfied for the dissipative part.
Proof. 
Since L Δ is bounded, by the exponential series,
T Δ ( t ) ρ ρ = k = 1 t k k ! L Δ k [ ρ ] = t L Δ [ ρ ] + k = 2 t k k ! L Δ k [ ρ ] .
Therefore,
T Δ ( t ) ρ ρ t L Δ [ ρ ] = k = 2 t k 1 k ! L Δ k [ ρ ] .
Taking the norm and using L Δ k [ ρ ] 1 L Δ 1 1 k ρ 1 gives
T Δ ( t ) ρ ρ t L Δ [ ρ ] 1 k = 2 t k 1 k ! L Δ 1 1 k ρ 1 = ρ 1 · e t L Δ 1 1 1 t L Δ 1 1 t .
The right-hand side converges to 0 as t 0 (Taylor expansion of the exponential). Hence (6.4-DQ) holds. □
(5)
Reduction of the tangency condition: if D Dom ( L 0 ) Dom ( R ) then (6.4-CT) can be decomposed automatically (excluding the dissipative part)
The present lemma shows mathematically that verification of (CC3) in Definition 87 concentrates not on the dissipative part but on the reversible and resonance parts.
Lemma 132 (Tangency decomposition of the three-component product (error splitting identity)).
Let ρ Dom ( L 0 ) Dom ( R ) and set
F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) .
Then for any t > 0 , the identity
F ( t ) ρ ρ t L tot [ ρ ] = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ t R [ ρ ] + T 0 ( t ) T Δ ( t ) R [ ρ ] R [ ρ ] + T 0 ( t ) T Δ ( t ) ρ ρ t L Δ [ ρ ] + T 0 ( t ) L Δ [ ρ ] L Δ [ ρ ] + T 0 ( t ) ρ ρ t L 0 [ ρ ]
holds.
Proof. 
First decompose F ( t ) ρ ρ into three terms:
F ( t ) ρ ρ = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] T 0 ( t ) T Δ ( t ) ρ + T 0 ( t ) T Δ ( t ) ρ T 0 ( t ) ρ + T 0 ( t ) ρ ρ .
Dividing by t gives
F ( t ) ρ ρ t = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ t + T 0 ( t ) T Δ ( t ) ρ ρ t + T 0 ( t ) ρ ρ t .
Subtract L 0 [ ρ ] + L Δ [ ρ ] + R [ ρ ] and split each term as
T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ t R [ ρ ] = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ t R [ ρ ] + T 0 ( t ) T Δ ( t ) R [ ρ ] R [ ρ ] ,
T 0 ( t ) T Δ ( t ) ρ ρ t L Δ [ ρ ] = T 0 ( t ) T Δ ( t ) ρ ρ t L Δ [ ρ ] + T 0 ( t ) L Δ [ ρ ] L Δ [ ρ ] .
This yields (6.4-DEC) (it is merely addition and subtraction). □
(6)
Practical choice of a common core (example): a finite-rank common core
The common-core assumption is abstract, but in the standard situations of this paper there is a natural choice. To demonstrate that it can exist, we present one typical candidate based on finite rank, and prove within the main text its density and domain inclusion (the core property itself depends on the situation and is left as an assumption).
Definition 88 (Candidate finite-rank common core).
Let K 0 H be a dense subspace with respect to D such that
K 0 Dom ( D )
(e.g., if D is a differential operator, C c ). Also, let K R H be, with respect to T R ( t ) ,
K R : = ψ H : ψ ˙ H such that lim t 0 U R ( t ) ψ ψ t ψ ˙ H = 0
(i.e., the strongly differentiable vectors for U R ( t ) ), and assume that this is dense. Set
K : = K 0 K R ,
and define the linear span of finite-rank operators by
D fr : = span { | ψ ϕ | : ψ , ϕ K } X ,
and call it a common-core candidate.
Lemma 133 
(Density: D fr is dense in X). The set D fr in Definition 88 is dense in X = T 1 ( H ) .
Proof. 
The set of all finite-rank operators F ( H ) is dense in X ( § 2 . 2 ). Hence for any ρ X and any ε > 0 , there exists a finite-rank operator
ρ ε = j = 1 m | ψ j ϕ j |
such that ρ ρ ε 1 < ε / 2 . Next, since K is dense in H (the intersection of dense sets is dense), for each j choose ψ j , ϕ j K such that
ψ j ψ j H < δ , ϕ j ϕ j H < δ
(where δ > 0 is chosen later). Using the trace norm of a rank-one operator | ψ ϕ | 1 = ψ ϕ , we obtain
| ψ j ϕ j | | ψ j ϕ j | 1 | ψ j ψ j ϕ j | 1 + | ψ j ϕ j ϕ j | 1 = ψ j ψ j ϕ j + ψ j ϕ j ϕ j .
Since ψ j ψ j + δ , the right-hand side is bounded by δ ϕ j + ( ψ j + δ ) δ . Choosing δ sufficiently small makes this quantity less than ε / ( 2 m ) for each j. Then
ρ ε j = 1 m | ψ j ϕ j | 1 j = 1 m | ψ j ϕ j | | ψ j ϕ j | 1 < ε / 2 .
The sum j | ψ j ϕ j | belongs to D fr . Therefore,
ρ j = 1 m | ψ j ϕ j | 1 ρ ρ ε 1 + ρ ε j | ψ j ϕ j | 1 < ε .
Hence D fr is dense. □
Lemma 134 (Domain inclusion: D fr Dom ( L 0 ) Dom ( R ) ).
The set D fr in Definition 88 satisfies
D fr Dom ( L 0 ) Dom ( R ) .
Proof. 
By linearity, it suffices to prove the claim for rank-one operators ρ = | ψ ϕ | with ψ , ϕ K .
(i) ρ Dom ( L 0 ) : Since ψ , ϕ K Dom ( D ) , we have D ψ , D ϕ H . Then
D ρ = D | ψ ϕ | = | D ψ ϕ | , ρ D = | ψ D ϕ |
are both rank-one and hence trace class. Therefore [ D , ρ ] = D ρ ρ D is trace class, and by Definition 80, ρ Dom ( L 0 ) .
(ii) ρ Dom ( R ) : Since ψ , ϕ K K R , there exist ψ ˙ , ϕ ˙ H such that
U R ( t ) ψ ψ t ψ ˙ , U R ( t ) ϕ ϕ t ϕ ˙ ( t 0 ) in H .
Use the explicit formula in § 5 . 3 , T R ( t ) [ ρ ] = U R ( t ) ρ U R ( t ) = | U R ( t ) ψ U R ( t ) ϕ | . Decompose the difference as
| U R ( t ) ψ U R ( t ) ϕ | | ψ ϕ | = | U R ( t ) ψ ψ U R ( t ) ϕ | + | ψ U R ( t ) ϕ ϕ | ,
and divide by t:
T R ( t ) [ ρ ] ρ t = U R ( t ) ψ ψ t U R ( t ) ϕ + ψ U R ( t ) ϕ ϕ t .
Using the trace norm of rank-one operators | a b | 1 = a b and unitarity of U R ( t ) , U R ( t ) ϕ = ϕ , the right-hand side converges in · 1 to
ψ ˙ ϕ | + | ψ ϕ ˙ | .
Hence the difference-quotient limit exists and ρ Dom ( R ) . Since this holds for rank-one operators, it holds for the whole linear span D fr . □
(7)
Conclusion of this section: the common-core assumption has been fixed, and the boundedness of the dissipative part reduces the assumption essentially to the common domain of L 0 and R
In this section, we fixed the “common core assumption” required for generator identification as Definition 87. Its core is the Chernoff tangency condition (6.4-CT) on a dense subspace D Dom ( L 0 ) Dom ( R ) . Since the dissipative generator L Δ is bounded,
T Δ ( t ) ρ ρ t L Δ [ ρ ] ( ρ X )
holds on the whole space (Lemma 131), and verification of the tangency condition reduces essentially to the terms involving L 0 and R (Lemma 132). We further presented a concrete common-core candidate D fr based on finite rank, and proved within the main text that it is dense and is contained at least in Dom ( L 0 ) Dom ( R ) (Lemmas 133, 134). In the subsequent sections, under the assumptions fixed in this section, we apply the product formula of § 3 . 6 and identify the composite limit as the full semigroup.
Preprints 193851 i033

6.5. Main Theorem: The Limit Semigroup of CPTP Componentwise Composition and Generation by L tot ¯

(1)
Aim of this section: rigorously establish that the limit of the composite approximation T ( n ) ( t ) = F ( t / n ) n exists, that the limit is a CPTP semigroup, and that its generator coincides with L tot ¯
In § 6 . 3 , we defined the composite approximation sequence
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) , T ( n ) ( t ) : = F ( t / n ) n ,
and showed that each T ( n ) ( t ) is CPTP and · 1 -contractive. In this section, after fixing the assumptions in a form suitable for applying the Chernoff-type product formula of § 3 . 6 , we fix, with proofs, that
T ( t ) [ ρ ] : = lim n T ( n ) ( t ) ρ
defines a strongly continuous CPTP semigroup on X = T 1 ( H ) , and that its generator coincides with the closure L tot ¯ of the formal total generator L tot = L 0 + L Δ + R . Here the CPTP property propagates mechanically from “closure under composition and limits” ( § 3 . 3 ), and generator identification follows from the “tangency condition on a common core” ( § 6 . 4 ) together with the Chernoff product formula ( § 3 . 6 ).
(2)
Generator-known route (A4-i): fixing the assumption that L tot ¯ generates a contraction C 0 -semigroup
The product formula of this paper (Theorem 14) was established in the form that assumes “the target semigroup already exists and F is tangent to its generator,” and then concludes convergence. Accordingly, in this section, in order to perform generator identification safely, we fix as an assumption that L tot ¯ generates a contraction C 0 -semigroup (an assumption verifiable via Lumer–Phillips or bounded-perturbation theory).
Definition 89 (Generator-known route assumption (existence of a contraction semigroup)).
Take a dense subspace D X satisfying the common core assumption of § 6 . 4 (Definition 87). Set A 0 : = L tot | D , and define
A : = A 0 ¯
as the · 1 -graph closure (a closed operator). In this section, we assume the following:
(K1) 
A generates a contraction C 0 -semigroup { T ( t ) } t 0 on X.
(K2) 
D is a core of A (automatic from the definition, but stated explicitly for later reference).
We call this semigroup the total semigroup .
(3)
Lemma: A = L tot ¯ (identification of closures)
Lemma 135 (Identification of closures).
Under Definition 89, A = A 0 ¯ can be identified with the closure of the formal total generator L tot . That is, if we define L tot ¯ by
L tot ¯ : = L tot | D ¯ ,
then
A = L tot ¯
holds.
Proof. 
Since A 0 = L tot | D , its closure A 0 ¯ coincides by definition with L tot | D ¯ . Hence A = L tot ¯ . □
(4)
Main theorem: the limit of T ( n ) ( t ) = F ( t / n ) n coincides with T ( t ) = e t L tot ¯ , hence is CPTP
Theorem 32 (Limit semigroup of CPTP componentwise composition and generator identification).
On the state space X = T 1 ( H ) , define
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t ) , T ( n ) ( t ) : = F ( t / n ) n
as in Definitions 84, 85. If the common core assumption (Definition 87) and the generator-known route assumption (Definition 89) hold, then the following hold:
(i) 
(Existence and identification of the limit) For any t 0 and any ρ X ,
lim n T ( n ) ( t ) ρ = T ( t ) [ ρ ] in · 1
holds, where { T ( t ) } t 0 is the contraction C 0 -semigroup generated by A = L tot ¯ .
(ii) 
(CPTP property) For each t 0 , T ( t ) is CPTP and, in particular, preserves S ( H ) .
(iii) 
(Generator) The generator of T ( t ) coincides with
L tot ¯ .
Hence one may write T ( t ) = e t L tot ¯ .
Proof. Step 1 (Chernoff family conditions):
By Lemma 124, F is a contraction family:
F ( 0 ) = Id , F ( t ) 1 1 1 , lim t 0 F ( t ) ρ ρ 1 = 0 ( ρ X ) .
Moreover, by Definition 85, T ( n ) ( t ) = F ( t / n ) n .
Step 2 (tangency: F is tangent to the generator A ): By the common core assumption (Definition 87), for any ρ D ,
lim t 0 F ( t ) ρ ρ t L tot [ ρ ] 1 = 0 .
On the other hand, in Definition 89 we set A 0 = L tot | D and take the semigroup { T ( t ) } whose generator is A = A 0 ¯ . Hence for ρ D , A ρ = A 0 ρ = L tot [ ρ ] holds. Therefore (6.5-Tan0) is equivalent to
lim t 0 F ( t ) ρ ρ t A ρ 1 = 0 ( ρ D ) .
That is, F is tangent to the generator A .
Step 3 (applying the product formula: convergence and identification): By Definition 89-(K1), { T ( t ) } is a contraction C 0 -semigroup with generator A . By (K2), D is a core of A . Therefore, applying Theorem 14 (Chernoff product formula) with
X ( the state space in this sec tion ) , T ( t ) ( the known contraction semigroup ) , A = A , D = D ,
F ( satisfying ( 6.5 - Fam ) and ( 6.5 - TanA ) ) ,
we obtain
lim n F ( t / n ) n ρ = T ( t ) [ ρ ] ( t 0 , ρ X )
in · 1 . This is (6.5-LIM), proving (i).
Step 4 (CPTP property: closure under composition and limits): By Lemma 127 in § 6 . 3 , for each n and t, T ( n ) ( t ) = F ( t / n ) n is CPTP. By Step 3, T ( n ) ( t ) ρ T ( t ) [ ρ ] holds in · 1 for every ρ X . Hence, applying closure of CPTP under pointwise · 1 limits (Theorem 12 in § 3 . 3 ), we conclude that T ( t ) is CPTP. This proves (ii).
Step 5 (identification of the generator): By Definition 89, the generator of { T ( t ) } is A = A 0 ¯ . By Lemma 135, A can be identified with L tot ¯ . Therefore, the generator of T ( t ) coincides with L tot ¯ , proving (iii). □
(5)
Direct corollary: well-posedness of the UEE (existence and uniqueness of mild solutions) and state invariance
Theorem 33 
(Well-posedness and state invariance of the UEE). Under the assumptions of Theorem 32, for any initial value ρ 0 X ,
ρ ( t ) : = T ( t ) [ ρ 0 ]
is the mild solution of the abstract Cauchy problem
ρ ˙ ( t ) = L tot ¯ ρ ( t ) , ρ ( 0 ) = ρ 0 ,
and is unique. In particular, if ρ 0 S ( H ) , then ρ ( t ) S ( H ) holds for any t 0 .
Proof. 
By Theorem 32-(i)(iii), { T ( t ) } t 0 is a strongly continuous semigroup with generator L tot ¯ . Hence, by Definition 45-(iii) in § 3 . 2 , ρ ( t ) = T ( t ) [ ρ 0 ] is a mild solution. Uniqueness is immediate from the fact that “solutions are defined as semigroup orbits” (Definition 45) (a mild solution with the same initial value for the same semigroup { T ( t ) } must coincide).
We prove state invariance. By Theorem 32-(ii), each T ( t ) is CPTP. Therefore, if ρ 0 0 , then T ( t ) [ ρ 0 ] 0 , and by trace preservation, Tr ( T ( t ) [ ρ 0 ] ) = Tr ( ρ 0 ) . In particular, if ρ 0 S ( H ) , then Tr ( ρ 0 ) = 1 , hence ρ ( t ) S ( H ) . □
(6)
Conclusion of this section: the limit of CPTP componentwise composition yields a strongly continuous CPTP semigroup, and its generator coincides with L tot ¯
In this section, under the tangency condition on a common core (Definition 87) and the generator-known route assumption (Definition 89), we established as Theorem 32 that the composite approximation sequence T ( n ) ( t ) = F ( t / n ) n converges strongly in · 1 to the limit semigroup T ( t ) , that the limit is CPTP, and that its generator coincides with L tot ¯ . Consequently, the UEE is well posed in the sense of mild solutions, and the density-operator set is invariant for all times (Theorem 33).
Preprints 193851 i034

6.6. Simplified Forms in the Commuting Case

(1)
Aim of this section: rigorously show that when the component semigroups commute (in a strong sense), the composite approximation reduces to a closed form “without taking a limit”
In § 6 . 3 § 6 . 5 , in the general case we constructed the total semigroup as
T ( t ) = lim n T 0 ( t / n ) T Δ ( t / n ) T R ( t / n ) n
and obtained the CPTP property and generator identification. In this section, as an additional assumption, we consider the case where the component semigroups commute (the commuting case) and show that the composite approximation simplifies drastically. There are two key points:
(A) 
(Semigroup-level simplification) If the component semigroups commute for all times, then the product
F ( t ) : = T 0 ( t ) T Δ ( t ) T R ( t )
is itself a semigroup, and therefore
F ( t / n ) n = F ( t )
holds for any n. Hence the composite approximation does not require taking a limit and agrees exactly.
(B) 
(Factorization of exponentials) In particular, if bounded generators commute with each other, then by the usual power-series calculation one has
e t ( A + B ) = e t A e t B = e t B e t A .
This is the “strongest simplified form” in the commuting case.
In this section, we prove (A) rigorously in the framework of C 0 -semigroups, and furthermore give a complete proof of (B) in the bounded-generator case.
(2)
Definition of commutativity: commutativity at all times (strong commutativity)
Definition 90 
(Strong commutativity of semigroup families). Let X be a Banach space, and let { S ( t ) } t 0 and { U ( t ) } t 0 be families of operators on X. We say that the two strongly commute if
S ( t ) U ( s ) = U ( s ) S ( t ) ( t 0 , s 0 )
holds. Similarly, we say that the three families { T 0 ( t ) } t 0 , { T Δ ( t ) } t 0 , and { T R ( t ) } t 0 strongly commute if for any distinct pair ( i , j ) ,
T i ( t ) T j ( s ) = T j ( s ) T i ( t ) ( t , s 0 )
holds (where i , j { 0 , Δ , R } ).
(3)
Two-component simplification: the product of two strongly commuting semigroups is a semigroup
Lemma 136 
(The product of commuting semigroups is a semigroup). Let X be a Banach space, and let { S ( t ) } t 0 and { U ( t ) } t 0 be semigroups on X. Assume further the strong commutativity (6.6-COM2). Then the family { W ( t ) } t 0 defined by
W ( t ) : = S ( t ) U ( t ) ( t 0 )
is a semigroup. That is,
W ( 0 ) = Id , W ( t + s ) = W ( t ) W ( s ) ( t , s 0 )
hold.
Proof. 
W ( 0 ) = S ( 0 ) U ( 0 ) = Id · Id = Id is trivial. Next, we prove the semigroup property. For any t , s 0 ,
W ( t + s ) = S ( t + s ) U ( t + s ) = S ( t ) S ( s ) U ( t ) U ( s ) .
By strong commutativity, S ( s ) U ( t ) = U ( t ) S ( s ) holds, hence
S ( t ) S ( s ) U ( t ) U ( s ) = S ( t ) U ( t ) S ( s ) U ( s ) = W ( t ) W ( s ) .
Therefore W ( t + s ) = W ( t ) W ( s ) . □
Lemma 137 
(Propagation of strong continuity and contractivity). In the setting of Lemma 136, assume furthermore that { S ( t ) } and { U ( t ) } are C 0 -semigroups and satisfy
S ( t ) 1 , U ( t ) 1 ( t 0 ) .
Then { W ( t ) } is a contraction C 0 -semigroup, and
W ( t ) 1 ( t 0 )
holds.
Proof. 
Contractivity follows from (6.6-W) and (6.6-CON):
W ( t ) = S ( t ) U ( t ) S ( t ) U ( t ) 1 .
Strong continuity follows by taking arbitrary x X and decomposing
W ( t ) x x = S ( t ) U ( t ) x x + S ( t ) x x ,
hence
W ( t ) x x S ( t ) U ( t ) x x + S ( t ) x x U ( t ) x x + S ( t ) x x 0 ( t 0 )
(by strong continuity of S and U). □
Lemma 138 (Propagation of CPTP (on the state space)).
Let X = T 1 ( H ) , and assume that { S ( t ) } and { U ( t ) } are CPTP at each time. Then W ( t ) = S ( t ) U ( t ) is also CPTP at each time.
Proof. 
CPTP at each time follows immediately from closure of CPTP maps under composition (Lemma 64 in § 3 . 3 ). Commutativity is not needed. □
(4)
Exponential factorization when bounded generators commute (the strongest simplified form)
Lemma 139 
(Exponential factorization for commuting bounded generators). Let X be a Banach space and let A , B B ( X ) be bounded linear operators. If
A B = B A
holds, then for any t R ,
e t ( A + B ) = e t A e t B = e t B e t A
holds.
Proof. 
The operator series
e t A = m = 0 t m m ! A m , e t B = n = 0 t n n ! B n
converge absolutely in B ( X ) ( § 3 . 4 ). Computing the product (a Fubini-type justification is permitted by absolute convergence) gives
e t A e t B = m = 0 n = 0 t m + n m ! n ! A m B n .
From (6.6-AB), A m B n = B n A m holds, so reordering is allowed. In particular, by the binomial theorem,
( A + B ) k = m = 0 k k m A m B k m ( k N )
holds. Therefore,
e t ( A + B ) = k = 0 t k k ! ( A + B ) k = k = 0 t k k ! m = 0 k k m A m B k m = k = 0 m = 0 k t k m ! ( k m ) ! A m B k m = m = 0 n = 0 t m + n m ! n ! A m B n = e t A e t B .
Similarly, e t B e t A coincides with the same double series, hence (6.6-EXP) holds. □
(5)
When the three components strongly commute: the Chernoff approximation agrees exactly for each n
Theorem 34 
(Complete simplification under strong commutativity: T ( n ) ( t ) = F ( t ) ). Consider the composite approximating family in § 6 . 3 ,
F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) ( t 0 ) .
Assume that the three component semigroups strongly commute (Definition 90, (6.6-COM3)). Then the following hold:
(i) 
{ F ( t ) } t 0 is a semigroup on X (i.e., F ( t + s ) = F ( t ) F ( s ) ).
(ii) 
For any n N and t 0 ,
T ( n ) ( t ) = F ( t / n ) n = F ( t )
holds. Hence lim n T ( n ) ( t ) = F ( t ) holds trivially.
(iii) 
For each t 0 , F ( t ) is CPTP (hence preserves S ( H ) ).
Proof. (i): 
For any t , s 0 , by the semigroup properties of each component,
F ( t + s ) = T 0 ( t + s ) T Δ ( t + s ) T R ( t + s ) = T 0 ( t ) T 0 ( s ) T Δ ( t ) T Δ ( s ) T R ( t ) T R ( s ) .
By strong commutativity, one can move the factors on the right-hand side as follows:
move T 0 ( s ) to the right of T Δ ( t ) , T R ( t ) , and move T Δ ( s ) to the right of T R ( t )
(commutativity at all times). Therefore,
T 0 ( t ) T 0 ( s ) T Δ ( t ) T Δ ( s ) T R ( t ) T R ( s ) = T 0 ( t ) T Δ ( t ) T R ( t ) T 0 ( s ) T Δ ( s ) T R ( s ) = F ( t ) F ( s ) .
Hence the semigroup property holds.
(ii): By the semigroup property, F ( t ) = F ( t / n + + t / n ) = F ( t / n ) n holds for any n. Since Definition 85 gives T ( n ) ( t ) = F ( t / n ) n , (6.6-EX) follows.
(iii): Since each component is CPTP (Theorem 30 in § 6 . 2 ), the composition F ( t ) = T 0 ( t ) T Δ ( t ) T R ( t ) is also CPTP (closure under composition in § 3 . 3 ). □
(6)
Simplification of the generator: under strong commutativity, tangency agrees with the formal sum
Under strong commutativity, the composite approximation becomes an exact semigroup, hence verification of the tangency condition is formally shortened (not because cross terms “vanish completely,” but because the semigroup property makes the limit unique).
Lemma 140 (Difference-quotient limit under strong commutativity (formal sum)).
Under the assumptions of Theorem 34, let moreover ρ Dom ( L 0 ) Dom ( R ) . Then the difference-quotient limit
lim t 0 F ( t ) ρ ρ t ( L 0 + L Δ + R ) ρ 1 = 0
holds. That is, under strong commutativity, F is tangent to the formal total generator.
Proof. 
Take ρ Dom ( L 0 ) Dom ( R ) . Use the identity
F ( t ) ρ ρ = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ + T 0 ( t ) T Δ ( t ) ρ ρ + T 0 ( t ) ρ ρ
(which is merely addition and subtraction). Divide by t and subtract L 0 ρ + L Δ ρ + R [ ρ ] :
F ( t ) ρ ρ t ( L 0 + L Δ + R ) ρ = T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ t R [ ρ ] + T 0 ( t ) T Δ ( t ) R [ ρ ] R [ ρ ]
+ T 0 ( t ) T Δ ( t ) ρ ρ t L Δ ρ + T 0 ( t ) L Δ ρ L Δ ρ + T 0 ( t ) ρ ρ t L 0 ρ .
We estimate each term as t 0 .
Term 1: Since ρ Dom ( R ) , the difference quotient converges in · 1 to R [ ρ ] . Meanwhile T 0 ( t ) T Δ ( t ) is contractive with T 0 ( t ) T Δ ( t ) 1 1 1 and converges strongly to I as t 0 . Hence
T 0 ( t ) T Δ ( t ) T R ( t ) [ ρ ] ρ t R [ ρ ] 1 T R ( t ) [ ρ ] ρ t R [ ρ ] 1 0 .
Term 2: Since R [ ρ ] X and T 0 ( t ) T Δ ( t ) is strongly continuous and converges to I,
T 0 ( t ) T Δ ( t ) R [ ρ ] R [ ρ ] 1 0 .
Term 3: Since L Δ is bounded, T Δ ( t ) ρ ρ t L Δ ρ holds for all ρ X (Lemma 131). Since T 0 ( t ) 1 1 = 1 ,
T 0 ( t ) T Δ ( t ) ρ ρ t L Δ ρ 1 T Δ ( t ) ρ ρ t L Δ ρ 1 0 .
Term 4: Since L Δ ρ X and T 0 ( t ) I strongly,
T 0 ( t ) L Δ ρ L Δ ρ 1 0 .
Term 5: Since ρ Dom ( L 0 ) , T 0 ( t ) ρ ρ t L 0 ρ .
Therefore the · 1 norm of the whole right-hand side converges to 0 as t 0 , and (6.6-TAN) holds. □
(7)
Conclusion of this section: commutativity yields “no need for limits” and “factorization of exponentials”
In this section, we showed that when the component semigroups strongly commute, the composite approximation simplifies exactly. For two components, under strong commutativity the product becomes a semigroup (Lemma 136), and strong continuity, CPTP-ness, and contractivity propagate (Lemmas 137, 138). If bounded generators commute, the exponential factorizes (Lemma 139). If the three components strongly commute, then the composite approximation sequence already coincides with the exact value for each n,
T ( n ) ( t ) = F ( t ) ( n ) ,
(Theorem 34). Hence the Chernoff limit required in the general case becomes unnecessary, and commutativity yields the strongest simplified form.
Preprints 193851 i035

7. Conclusion

7.1. Summary

(1)
Reconfirming what is proposed in the UEE: abstract form (UEE_01) and standard form (UEE_05 and later)
The aim of this paper is to fix the UEE as analytic input without breakdown. To this end, in this paper (UEE_01) we presented the UEE in the abstract form on the predual state space M * (1), and, in order to avoid domain issues of the generator, we adopted the standpoint that the time evolution is defined as the action of a strongly continuous CPTP semigroup { T ( t ) } t 0 ,
ρ ( t ) = T ( t ) [ ρ 0 ]
(a mild solution) (§1.0, Definition 45). On the other hand, in the density-operator representation frequently used in the subsequent papers (UEE_05 and later), the UEE is written in the standard form that juxtaposes the reversible (commutator), dissipative (GKLS), and transport (resonance) parts, (2). This paper made explicit, with the abstract form as the reference, “what is fixed as input and what is guaranteed as a theorem,” so that no type confusion arises between these two representations.
(2)
What this paper fixed: state space, CPTP, and UEE analytic data (input contract)
The analytic contract (input) fixed in this paper is summarized in the following three points.
1.
Type of the state space: We set the observable algebra to be a von Neumann algebra M , the state space to be its predual M * , and took the normal state set S ( M ) as the reference (Definition 1).
2.
Definition of physically admissible time evolution: We defined Schrödinger-side maps as the preduals of normal, unital, completely positive maps on the Heisenberg side, and established within the main text that they preserve the normal state set and are closed under composition (Lemmas 1, 2).
3.
Fixing the UEE analytic data: As the minimal input for describing the UEE, we defined
D = ( M , M * , D , L Δ , R )
(Definition 2), and stipulated that L 0 = i [ D , · ] , L Δ , and R are to be treated as generators (superoperators) on the state space (prohibition of type confusion: §1.1, §2).
(3)
What this paper guaranteed: semigroup generation by CPTP componentwise composition and well-posedness
Under the above input contract, this paper showed the following.
1.
Construction of the component semigroups: The reversible part T 0 ( t ) , the dissipative part T Δ ( t ) , and the resonance (transport) part T R ( t ) were constructed as strongly continuous CPTP (group/semigroup) on the same state space X = T 1 ( H ) , and each was shown to be contractive (e.g., Theorem 30; dissipative part: Theorem 17; transport part: Theorem 25).
2.
Componentwise composition and generator identification: We identified, via the Chernoff/Trotter-type product formula, the limit of the composite approximation sequence
T ( n ) ( t ) : = T 0 ( t / n ) T Δ ( t / n ) T R ( t / n ) n ,
and showed that the limit semigroup T ( t ) is a strongly continuous CPTP semigroup and that its generator coincides with L tot ¯ (where L tot = L 0 + L Δ + R ) (Theorem 32).
3.
Well-posedness of the UEE and state invariance: Consequently, for any initial value ρ 0 ,
ρ ( t ) = T ( t ) [ ρ 0 ]
gives the mild solution of the UEE and is unique. In particular, if the initial value is a state, then the state set is invariant for all times (Theorem 33).
Moreover, when the component semigroups strongly commute, we also showed that the composite approximation agrees exactly without taking a limit and reduces to a closed form (Theorem 34).
(4)
Clarifying what is not claimed (out of scope)
As a foundational analytical paper, this paper separated the following as out of scope1.1):
  • The derivation of equivalence between representations (operator form, variational form, field form, etc.) (in this paper the operator form is fixed as analytic input).
  • Concrete phenomenology, numerical fits, and identification of physical constants (this paper focuses on establishing well-posedness).
  • Details of geometric constructions (concrete flows on spacetime, measure-theoretic constructions, etc.) are introduced only as necessary abstract specifications.
These are left to subsequent papers that treat specific modeling, derivations, and applications of the UEE.
(5)
Connection to the series (positioning as a foundational analysis)
The “input contract” and “well-posedness as a semigroup” established in this paper provide the analytical foundation of the common schema used in the UEE series. In subsequent papers, concrete physical modeling based on the standard form (2) (choice of dissipative data, construction of a zero-area resonance kernel, and geometric/phenomenological connections) will be discussed; this paper provides a reference point ensuring that those discussions do not lose the type of the state space, the CPTP requirements, and the unambiguity of the solution concept.
Preprints 193851 i036

8. References

A. Semigroups, generators, and product formulas (C0 semigroups, Hille–Yosida, Lumer–Phillips, Trotter/Chernoff)

  • Standard references for C0 semigroups, generation theorems, and perturbation theory: [1,2,3,4]
  • Trotter/Lie–Trotter and Chernoff-type product formulas: [5,6,7]

B. Operator theory, self-adjointness, and spectral theory (Stone’s theorem, etc.)

  • Self-adjointness, Stone’s theorem, and fundamentals of unbounded operators: [8,9]

C. Trace-class operators and Schatten norms (foundations of · 1 contractivity)

  • Trace ideals and analysis of · 1 / · 2 : [10]

D. C*-algebras, von Neumann algebras, and preduals (normality and the type of the state space)

  • Foundations of C*/W* algebras, preduals, and normal states: [11,12,13,14]
  • Physical background in quantum statistics and operator algebras: [15]

E. Completely positive maps and quantum channels (Stinespring/Kraus/Choi, operator spaces)

  • Completely positive maps and dilations (Stinespring representation): [16]
  • Kraus representation (semigroups of quantum operations): [17]
  • Choi matrices and CP criteria: [18]
  • Standard references for CP/CB maps and operator spaces: [19,20]

F. GKLS (Lindblad) form, open quantum systems, and quantum dynamical semigroups

  • Original sources for GKLS generators: [21,22]
  • Standard references for quantum dynamical semigroups of open systems: [23,24,25]

G. UEE series (related papers and primary sources of this research)

  • UEE_01 (this paper, analytical foundation): [26]
  • Derivation of the zero-area resonance kernel R (UEE_02): [27]
  • Physical skeleton of IFT/UEE (UEE_05, UEE_06): [28,29]
  • Fractals and scaling laws (UEE_07): [30]
  • Geometric implementation via PCM/SFF (UEE_08): [31]

References

  1. Pazy, A. Semigroups of Linear Operators and Applications to Partial Differential Equations; Applied Mathematical Sciences; Springer-Verlag: New York, 1983; Vol. 44. [Google Scholar] [CrossRef]
  2. Engel, K.J.; Nagel, R. One-Parameter Semigroups for Linear Evolution Equations; Graduate Texts in Mathematics; Springer: New York, 2000; Vol. 194. [Google Scholar] [CrossRef]
  3. Hille, E.; Phillips, R.S. Functional Analysis and Semi-Groups; American Mathematical Society Colloquium Publications; American Mathematical Society: Providence, RI, 1957; Vol. 31, Revised edition. [Google Scholar]
  4. Kato, T. Perturbation Theory for Linear Operators, 2 ed.; Classics in Mathematics; Springer-Verlag: Berlin, Heidelberg, 1995. [Google Scholar] [CrossRef]
  5. Trotter, H.F. On the product of semi-groups of operators. Proceedings of the American Mathematical Society 1959, 10, 545–551. [Google Scholar] [CrossRef]
  6. Chernoff, P.R. Note on product formulas for operator semigroups. Journal of Functional Analysis 1968, 2, 238–242. [Google Scholar] [CrossRef]
  7. Chernoff, P.R. Product Formulas, Nonlinear Semigroups, and Addition of Unbounded Operators; Number 140 in Memoirs of the American Mathematical Society; American Mathematical Society: Providence, RI, 1974. [Google Scholar]
  8. Reed, M.; Simon, B. Methods of Modern Mathematical Physics I: Functional Analysis; Revised and enlarged edition; Academic Press: New York, 1980. [Google Scholar]
  9. Reed, M.; Simon, B. Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness; Academic Press: New York, 1975. [Google Scholar]
  10. Simon, B. Trace Ideals and Their Applications, 2 ed.; Mathematical Surveys and Monographs; American Mathematical Society: Providence, RI, 2005; Vol. 120. [Google Scholar] [CrossRef]
  11. Sakai, S. *-Algebras and W*-Algebras; Originally published in 1971; Classics in Mathematics, Springer-Verlag: Berlin, Heidelberg, 1998. [Google Scholar] [CrossRef]
  12. Takesaki, M. Theory of Operator Algebras I; Springer-Verlag: New York, 1979. [Google Scholar] [CrossRef]
  13. Kadison, R.V.; Ringrose, J.R. Fundamentals of the Theory of Operator Algebras, Volume I: Elementary Theory; Academic Press: New York, 1983. [Google Scholar]
  14. Kadison, R.V.; Ringrose, J.R. Fundamentals of the Theory of Operator Algebras, Volume II: Advanced Theory; Academic Press: New York, 1986. [Google Scholar]
  15. Bratteli, O.; Robinson, D.W. Operator Algebras and Quantum Statistical Mechanics 1: C*- and W*-Algebras. Symmetry Groups. Decomposition of States; Theoretical and Mathematical Physics, Springer-Verlag: Berlin, Heidelberg, 1987. [Google Scholar] [CrossRef]
  16. Stinespring, W.F. Positive functions on C*-algebras. Proceedings of the American Mathematical Society 1955, 6, 211–216. [Google Scholar] [CrossRef]
  17. Kraus, K. General state changes in quantum theory. Annals of Physics 1971, 64, 311–335. [Google Scholar] [CrossRef]
  18. Choi, M.D. Completely positive linear maps on complex matrices. Linear Algebra and its Applications 1975, 10, 285–290. [Google Scholar] [CrossRef]
  19. Paulsen, V.I. Completely Bounded Maps and Operator Algebras; Cambridge University Press: Cambridge, 2002; Vol. 78, Cambridge Studies in Advanced Mathematics. [Google Scholar]
  20. Watrous, J. The Theory of Quantum Information; Cambridge University Press: Cambridge, 2018. [Google Scholar] [CrossRef]
  21. Gorini, V.; Kossakowski, A.; Sudarshan, E.C.G. Completely positive dynamical semigroups of N-level systems. Journal of Mathematical Physics 1976, 17, 821–825. [Google Scholar] [CrossRef]
  22. Lindblad, G. On the generators of quantum dynamical semigroups. Communications in Mathematical Physics 1976, 48, 119–130. [Google Scholar] [CrossRef]
  23. Davies, E.B. Quantum Theory of Open Systems; Academic Press: London, 1976. [Google Scholar]
  24. Breuer, H.P.; Petruccione, F. The Theory of Open Quantum Systems; Oxford University Press: Oxford, 2002. [Google Scholar]
  25. Alicki, R.; Lendi, K. Quantum Dynamical Semigroups and Applications; Lecture Notes in Physics; Springer-Verlag: Berlin, Heidelberg, 1987; Vol. 286. [Google Scholar] [CrossRef]
  26. Shimizu, Y. Unified Evolution Equation, v1.4, 2026; Released; CC BY 4.0., 02 01 2026. [Google Scholar] [CrossRef]
  27. Shimizu, Y. Deriving the Area-Term Cancelling Operator and Axiomatizing Information-Flux Mechanics; Released; CC BY 4.0., 2026; Volume v1.2. [Google Scholar] [CrossRef]
  28. Shimizu, Y. Information Flux Theory: Reinterpretation of the Standard Model and Origin of Gravity from a Single Fermion. Released. CC BY 4.0., 2026; v1.6. [CrossRef]
  29. Shimizu, Y. Driving Principle of Life: Vortex-Type Dynamics of Self-Replicators and Relation to Gravity. CC BY 4.0. Released. 2026, v1.1. [CrossRef]
  30. Shimizu, Y. Extended Information Flux Theory: Fractal Scaling Law, v1.2, 2026; Released; CC BY 4.0., 09 01 2026. [Google Scholar] [CrossRef]
  31. Shimizu, Y. Stationary Fluid Field Hypothesis via Point-Contact Mechanics of Background Particles; Released; CC BY 4.0., 2026; Volume v1.3. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated