Submitted:
11 January 2026
Posted:
13 January 2026
You are already at the latest version
Abstract
Keywords:
1. Introduction
1.0. Proposal of the Unified Evolution Equation
- (1)
- Aim: What is the UEE?
- (2)
- Abstract form in UEE_01 (as an analytical contract)
- (3)
- Standard representation used from UEE_05 onward (density-matrix representation)
- (4)
- Standpoint of this paper: fixing the proposal as an analytical foundation
1.1. Role of This Paper
- (1)
- Contract as an analytical foundation: what this paper “fixes” and “guarantees”
- 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)
- 1.
- Positive functional: A functional is said to be positive if holds for any positive operator ().
- 2.
- Normal state: A functional is called a normal state if it is positive and satisfies . The set of all normal states is denoted by .
- 1.
- D is self-adjoint data generating the reversible (unitary) component, and is defined (as a linear operator on under an appropriate domain).
- 2.
- is the generator representing the dissipative component (measurement and coarse-graining), and generates, on , 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 .
- Remark (fixing of types)
- (3)
- Minimal definition of CPTP (completely positive and trace-preserving) and immediate consequences (with proofs)
- 1.
- Normality: The map α is said to be normal if, for any increasing bounded net of positive operators in , one has .
- 2.
- Complete positivity: The map α is said to be completely positive (CP) if, for any , maps positive operators on to positive operators.
- 3.
- Unitality: If holds, α is said to be unital.
- 4.
- Predual map: If α is normal, its predual is defined by
- (4)
- Destination of this paper (conclusion of this subsection) and connection to subsequent sections

1.2. Declaration of Analytical Objects
- (1)
- Position of this subsection: fixing the “types” and “objects” on which all subsequent discussions rely
- (2)
- Definition of the UEE-Analytic Datum: fixing the input contract
- 1.
- Observable algebra and state space: is a von Neumann algebra, and is its predual. The set of normal states is defined by
- 2.
- Reversible component:D is given (in the standard realization ) 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: is a linear operator on the state space , 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 , and generates a CPTP strongly continuous semigroup.
- Remark (prohibited type operations)
- (3)
- Time-evolution family and generator of the UEE: formulation as an abstract Cauchy problem
- 1.
-
The family is called a strongly continuous semigroup (-semigroup) ifand for every ,holds.
- 2.
-
The generator A of is defined by taking as its domain the set of all for which the limitexists.
- Abstract form of the UEE
- (4)
- Basic lemmas in the standard realization ( and trace class): CPTP property and strong continuity of the reversible component
- 1.
- (CPTP) For each t, is completely positive and trace-preserving.
- 2.
- (Group property), , and .
- 3.
- (Isometry) For each t, .
- 4.
- (Strong continuity) For any , as .
- (5)
- Conclusion of this subsection: analytical objects (types, time evolution, generators) have been fixed

1.3. Main Results
- (1)
- Aim of this subsection: explicitly stating the “minimal set” proved in this paper and fixing the dependency structure
- (2)
- Re-declaration of the main objects: component semigroups and composite approximations
- (3)
- Closure of CPTP: CPTP is not destroyed by composition or by pointwise strong limits (complete proofs)
- (4)
- Main theorem (existence of the component semigroups)
- 1.
- The reversible component yields a strongly continuous CPTP group on X.
- 2.
- The dissipative component yields a strongly continuous CPTP semigroup on X.
- 3.
- The transport (resonance) component R yields a strongly continuous CPTP semigroup on X.
- (5)
- Main theorem (total generation: generation of by CPTP componentwise composition)
- 1.
-
For any and , the limitexists in , and is a strongly continuous semigroup.
- 2.
- is CPTP.
- 3.
- The generator of this semigroup coincides with the closure of .
- (6)
- Immediate corollaries: well-posedness of the UEE and invariance of the state set

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
- 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).
- (2)
- Formalization of the responsibilities of each section (Section-Contract)
- (specification of common standards): Specify thetypesof the observable algebra and the predual , the set of normal states , the definition of CPTP (including the Heisenberg/Schrödinger correspondence), and the UEE analytic datum .
- (semigroup-theoretic tools): Establish, as theorems within this paper, -semigroups and generators, definitions of mild/strong solutions, basic lemmas on contractivity and strong continuity, and product formulas (Chernoff/Trotter type).
- (dissipative part ): Define in GKLS form (the specification of this paper), and prove that it generates a strongly continuous CPTP semigroup .
- (transport/resonance part R): Define R as the generator of a CPTP semigroup (e.g., construct it as the predual of a normal -*automorphism group), and prove that is a strongly continuous CPTP semigroup.
-
(generation of the total generator: componentwise composition): Usingafter establishing a tangency condition on an appropriate common core , prove thatyields a strongly continuous CPTP semigroup whose generator coincides with , and prove the well-posedness of the UEE (existence, uniqueness, and state invariance).
- (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
- (4)
- The unique path to the main theorem: section responsibilities imply the main results (logical consequence)
- Step 1.
- (Fixing of objects) By responsibility (i), the state space , the state set , the definition of CPTP, and the UEE analytic datum are fixed. Hence the stage and types of all subsequent discussions are determined.
- Step 2.
- (Establishing the component semigroups) By responsibilities (iii) and (iv), and are constructed as strongly continuous CPTP semigroups. Moreover, by responsibility (ii) together with the reversible-part discussion established in , 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), and are defined, and a tangency condition on a common core 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 limitexists for every , that forms a strongly continuous semigroup, and that its generator coincides with . Hence (ii) total semigroup generation by componentwise composition and identification of the generator hold.
- Step 5.
- (CPTP property and state invariance) Since each of , , and is CPTP, is CPTP for every n (by closure of CPTP under composition). Moreover, by the strong convergence in Step 4, holds, so by closure of CPTP under strong limits, is also CPTP. Therefore, for any initial state , preserves positivity and normalization for all , and the state set is invariant. Hence (iii) holds.
- (5)
- Conclusion of this subsection: the main text is assembled as an “acyclic proof chain”

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
- (2)
- Definition of the convention set (the “reference point” of this paper)
- 1.
- Spacetime, metric, and signature: Fix the spacetime dimension d, the signature convention of the Lorentz metric , and the relation between a local orthonormal basis (vierbein/tetrad) and the Minkowski metric .
- 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 , bounded operators , trace class , 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., , , ), 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 (or , 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., ).
- (3)
- Spacetime, metric, and indices: signature and raising/lowering conventions
- 1.
- Greek indices are coordinate indices, with .
- 2.
- Latin indices are tangent-space (local orthonormal basis) indices, with .
- 3.
-
The Minkowski metric is, unless otherwise specified in each chapter/section,and the metric is defined by the vierbein (tetrad) as(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.
- (4)
- Basic notations in differential geometry: connection, volume elements, and the Levi–Civita tensor
- 1.
- Define the d-dimensional volume element by
- 2.
- Take a smooth codimension-1 hypersurface with local coordinates , and let the induced metric be with determinant . Then define the area element by
- 1.
-
Define the totally antisymmetric tensor density byand perform raising/lowering of indices by according to Definition 9.
- 2.
- The Hodge dual is defined in the usual way by and .
- (5)
- Unit system and notation of dimensional analysis (natural units)
- (6)
- Operators, adjoints, and norms: basic notations used in analysis
- 1.
- We write the set of all bounded operators as , and denote the adjoint by (or ).
- 2.
- We write the set of all trace-class operators as , and denote the trace by .
- 3.
- We define the commutator and anticommutator by
- 4.
- We denote the operator norm of a bounded operator by , and the trace norm by .
- (7)
- Pictures and duality: observable maps and state maps (preduals)
- 1.
- Observable map: Let be (at least) a normal linear map.
- 2.
-
State map (predual): Define byWe regard this as the time-evolution map in the Schrödinger picture.
- 3.
- Time evolution: For an observable-side semigroup (or group) , write the state-side semigroup as and set
- (8)
- Conclusion of this subsection: the convention set has been declared

2.2. Operator Algebra and State Space
- (1)
- Aim of this subsection: fixing observables (operator algebra) and states (predual) within a single type system
- (2)
- Observable algebra: von Neumann algebra and predual (abstract specification)
- 1.
- is a -*algebra with unit and is closed in an appropriate topology (equivalently, in the weak operator topology).
- 2.
- is a Banach space, and is isomorphic to its dual Banach space:
- 3.
- We write the evaluation (dual pairing) of on as
- (3)
- Standard realization: and the trace class
- 1.
- .
- 2.
- .
- 3.
- (operator norm).
- 1.
- For rank one,
- 2.
- Extend linearly to a general finite-rank operator :
- (4)
- Trace norm and trace class: construction as a specification of this paper (completeness ensured by definition)
- (5)
- Ideal property (stability under two-sided multiplication): an estimate essential for subsequent dynamical semigroups
- (6)
- Concrete form of the state space: density operators and expectations (standard realization)
- (7)
- Identity of states: equality of density operators can be decided by expectations
- (8)
- Conclusion of this subsection: the types of observables and states ( and ) have been fixed

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
- (2)
- -weak topology and normality: definition based on the predual
- 1.
-
A sequence (more generally, a net) of operators is said to converge -weakly to if for every ,holds. We write this as .
- 2.
-
A linear map is said to be normal if it is continuous with respect to the σ-weak topology, i.e.,holds.
- (3)
- Complete positivity (CP) and CPTP: two-sided definitions for observable maps and state maps
- 1.
-
(Observable side: Heisenberg) For a linear map :
- (a)
- Positivity: .
- (b)
-
Complete positivity (CP): for every ,is positive.
- (c)
- Unitality: .
- 2.
-
(State side: Schrödinger) For a linear map :
- (a)
- Positivity: (positivity in Definition 23).
- (b)
-
Complete positivity (CP): for every ,is positive.
- (c)
-
Trace preservation (TP): for every ,holds.
- (d)
- CPTP: T is CP and TP.
- 1.
- Let be self-adjoint. Then
- 2.
- Let be self-adjoint. Then
- (⇒)
- Assume and take an arbitrary . Then exists, and . Hence .
- (⇐)
-
Assume for every . For any , is positive, andThus holds for all , so .
- (⇒)
- Assume and take an arbitrary . Then exists and . Since the trace of a positive trace-class operator is nonnegative,
- (⇐)
-
Assume for every . In particular, for arbitrary take , and thenHence holds for all , and .
- (4)
- Construction of the predual map (Heisenberg → Schrödinger)
- (5)
- Main lemma: Heisenberg (UCP) ⟺ Schrödinger (CPTP)
- (H)
- α is unital and completely positive (unital-CP).
- (S)
- is completely positive and trace-preserving (CPTP).
- (6)
- Conclusion of this subsection: the definition of CPTP and picture equivalence have been established

2.4. Dissipative Data as S5 (Common Specification):
- (1)
- Aim of this subsection: specify, as a specification, the “finite projection system” and “jump operators” responsible for dissipation (measurement/coarse-graining)
- (2)
- Finite projection resolution: definition of and basic identities
- (P1)
- (Projection) For each n,
- (P2)
- (Orthogonality) If , then
- (P3)
- (Completeness) As a finite sum,
- (3)
- Block decomposition (measurement-basis decomposition): decomposition formulas for operators and states
- (4)
- Dissipative jump operators: setting
- 1.
- (self-adjointness).
- 2.
- .
- 3.
- .
- 4.
-
The bounded positive operatorsatisfies
- (5)
- Measurement (coarse-graining) map: and its CPTP property
- 1.
- is normal (σ-weakly continuous).
- 2.
- is unital and completely positive (unital-CP).
- 3.
-
Therefore, the predual map is CPTP, and for any ,holds.
- (6)
- Definition of Born weights (measurement probabilities):
- (7)
- Conclusion of this subsection: has been fixed as the common specification

2.5. Specification of the Dissipative Generator
- (1)
- Aim of this subsection: define the dissipative component as a “GKLS generator” and close the Heisenberg/Schrödinger consistency within the paper
- 1.
- that 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 (), and are reduced by the pinching map, and the block action (diagonal invariance and off-diagonal decay) is derived rigorously.
- (2)
- Definition of the dissipative generator (Heisenberg picture): specification as GKLS standard form
- (3)
- Reduction under the minimal specification: coincides with the “pinching difference”
- (4)
- Basic properties of : boundedness, Hermiticity preservation, unit preservation, and invariance of pointer projections
- (5)
- Dissipative generator as the predual (Schrödinger picture) and the infinitesimal form of trace preservation
- (6)
- Block action (concrete implication of the specification): diagonal invariance and off-diagonal damping
- (7)
- Conclusion of this subsection: the type, conservation laws, and block action of have been fixed

2.6. Zero-Area Specification and the Type of R
- (1)
- Aim of this subsection: specify the projection and the “zero-area” condition responsible for boundary effects, and type R as a generator of a CPTP semigroup
- 1.
- the resonance projection (projection operator associated with R) and its geometric support set,
- 2.
- the zero-area condition (vanishing two-dimensional Hausdorff measure),
- 3.
- the flux-blocking condition for the information flux normal component at the boundary (a specification locally meaning ),
- 4.
- the type of R (generator of a strongly continuous CPTP semigroup on the state space) and the Heisenberg/Schrödinger duality.
- (2)
- Measure-theoretic basis of zero-area: definition of the two-dimensional Hausdorff measure
- (3)
- Resonance projection and geometric support set : definition via distribution kernels
- (4)
- A sufficient condition for zero-area: the case where the support is compressed onto lines (one-dimensional)
- (5)
- flux-blocking specification: vanishing of the boundary normal component (local and integral forms)
- (6)
- Type of R: generator of a strongly continuous CPTP semigroup on the state space (and the dual generator)
- (R1)
- R is a densely defined linear operator and is closed.
- (R2)
-
R is the generator of a strongly continuous semigroup :and
- (R3)
- For each , is CPTP (state-side definition in Definition 26).
- (7)
- Conclusion of this subsection: zero-area and the type (generator) of R have been fixed

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
- 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.
- (2)
- Two working modes: finite-dimensional mode (FD) and infinite-dimensional mode (ID)
- (FD)
- Finite-dimensional mode: assume . Then and are finite-dimensional linear spaces, and all linear operators are bounded, i.e., domain issues disappear.
- (ID)
- Infinite-dimensional mode: allow , 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
- (4)
- Issues unavoidable in infinite dimension: domain, closedness, strong continuity, and a common core
- (ID1)
- Unitary part (D): D is a self-adjoint operator on , and forms a strongly continuous unitary group on (Stone’s theorem). Moreover, is strongly continuous on (we adopt the property proved in ).
- (ID2)
- Dissipative part (): is a bounded linear map on X, and is a strongly continuous CPTP semigroup. (Boundedness is shown within the paper from the minimal specification and .)
- (ID3)
- Resonance part (R): R is a densely defined closed operator on X, and is the generator of a strongly continuous CPTP semigroup (consistent with Definition 38).
- (ID4)
-
Common core (tangency condition for product formulas): There exists a dense subspace such thatand for ,holds (Chernoff tangency condition).
- (5)
- Minimal consistency of the ID assumption package: automatic consequences (with proofs)
- (6)
- Connection between finite and infinite dimension: the main theorem holds unconditionally in FD and conditionally in ID
- (FD)
- If , then all generators are bounded and semigroups can be constructed by exponential series, so the claims holdwithout assumptions.
- (ID)
- If is allowed, then the claims hold as long as Definition 41 (ID basic assumptions) is satisfied.
- (7)
- Conclusion of this subsection: the two modes and the assumption package have been organized

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
- 1.
- to fix rigorously the definitions of strongly continuous semigroups (-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.
- (2)
- Definition of strongly continuous semigroups (-semigroups) and basic consequences
- (S1)
- (Semigroup property) (identity operator) and for all .
- (S2)
-
(Strong continuity) For every ,holds.
- (3)
- Definition of the generator: difference-quotient limit and domain
- 1.
- Define the domain by
- 2.
- For , the element y obtained by the above limit is unique, and we write it as , i.e.,
- (4)
- Basic properties of the generator: linearity, closedness, and consistency with the semigroup
- (5)
- Density of the generator domain (necessary condition) and its use in this paper
- (6)
- Conclusion of this subsection: the minimal analytical foundation for treating the UEE as a semigroup has been established

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
- 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 -semigroup , mild solutions exist uniquely, and that when the mild solution becomes a classical solution (regularization).
- (2)
- UEE as an abstract Cauchy problem (ACP): fixing the problem setting
- Comment (application to the UEE)
- (3)
- Definitions of solution concepts: mild, strong, and classical solutions
- (i)
- Classical solution: If , and for every one has , and (ACP) holds pointwise for each t, then x is called a classical solution.
- (ii)
-
Strong solution: If x is continuous and moreover x is locally absolutely continuous (i.e., for any , holds in the sense of X-valued Bochner integrals), and there exists a measurable function such thathold, then x is called a strong solution.
- (iii)
-
Mild solution: If A is the generator of a -semigroup , then the map given byis called a mild solution (existence depends on existence of the semigroup).
- (4)
- Banach-valued fundamental theorem of calculus (a tool to close the paper)
- (5)
- Regularity of mild solutions: if the initial value lies in , the mild solution becomes classical
- (6)
- Uniqueness of classical solutions: given the generating semigroup, the solution coincides with the semigroup orbit
- (7)
- Conclusion of this subsection: the solution concept of the UEE has been fixed based on semigroup theory

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
- 1.
- Compositions and convex combinations of CPTP maps preserve CPTP (algebraic closure).
- 2.
- Pointwise -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.
- (2)
- Preparations: duality, ampliations, and definitions of CPTP/UCP (minimal form used in this subsection)
- 1.
- T is completely positive (CP) if for every , preserves positivity (the positive cone of ).
- 2.
- T is trace-preserving (TP) if for every , holds.
- 3.
- T is CPTP if T is CP and TP.
- 1.
- α is completely positive (CP) if for every n, preserves positivity.
- 2.
- α is unital if .
- 3.
- α is UCP if it is CP and unital.
- (3)
- Closedness of the positive cone: positivity is not lost under limits
- (4)
- Kadison–Schwarz inequality and operator-norm contractivity of UCP (complete proofs)
- (5)
- Dual representation of the trace norm and trace-norm contractivity of CPTP (complete proofs)
- (6)
- Algebraic closure: CPTP is preserved under composition and convex combinations
- (7)
- Topological closure: CPTP is preserved under pointwise -limits (main theorem)
- (8)
- Conclusion of this subsection: closure of CPTP (composition, convex combination, and limits) has been established within the paper

3.4. Exponential Semigroups of Bounded Generators
- (1)
- Aim of this subsection: for a bounded generator , fully prove within the paper that the exponential semigroup yields a -semigroup
- 1.
- For any Banach space X and any bounded linear operator , the exponential seriesconverges absolutely in .
- 2.
- is a -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).
- (2)
- Convergence of the exponential series: absolute convergence in
- (3)
- Definition of the exponential semigroup:
- (4)
- Semigroup property: and (complete proof)
- (5)
- Strong continuity: is continuous (complete proof)
- (6)
- Identification of the generator: the generator of the exponential semigroup is A and the domain is the whole space
- (7)
- Growth bounds and Lipschitz-type bounds (used for product formulas in subsequent sections)
- (8)
- Conclusion of this subsection: a bounded generator automatically yields a -semigroup via the exponential, and the generator coincides

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 strong continuity
- 1.
- For each , is CPTP (completely positive and trace-preserving).
- 2.
- forms a group (invertible) and is trace-norm isometric, .
- 3.
- If is strongly continuous on , then is -strongly continuous on (a property needed for componentwise composition in ).
- (2)
- Setting: unitary group and conjugation actions
- 1.
- (State side) Define by
- 2.
- (Observable side) Define by
- (3)
- Lemma (cyclicity of the trace): the minimal fact needed to prove trace preservation
- (4)
- Lemma 3.8: unitary conjugation is CPTP and forms a CPTP group
- (5)
- Trace-norm isometry:
- (6)
- Lemma 3.9: strong continuity on
- (7)
- Conclusion of this subsection: the reversible component has been fixed as a CPTP group and properties needed for componentwise composition in have been secured

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
- 1.
- When a contractive family is tangent to a generator A, provide a complete proof thatcoincides with a (known) -semigroup (Chernoff-type product formula).
- 2.
- In particular, when is given as a product of several semigroups , show that the tangency condition reduces to the sum of generators (Trotter-type), and shape the result in a form directly applicable to subsequent componentwise composition ().
- (2)
- Definitions: contraction semigroups, contraction families, and the Chernoff tangency condition
- (3)
- Preparations: completeness of the graph-norm space and the uniform boundedness principle (used in this paper)
- (4)
- Boundedness of difference quotients for contraction semigroups and graph-norm continuity of orbits
- (5)
- Obtaining “uniform estimates” from the tangency condition: a uniform convergence lemma on compact sets
- (6)
- Main theorem: Chernoff-type product formula (tool theorem)
- (7)
- Trotter-type consequences: tangency of products of semigroups (sum of generators)
- (8)
- Conclusion of this subsection: the Chernoff/Trotter product formulas have been fixed as tool theorems

4. Dissipative Generator : GKLS Semigroup Based on the S5 Specification
4.1. Recap of the S5 Dissipative Data
- (1)
- Aim of this section: recapitulate the input data required for constructing the dissipative semigroup, and fix the “types” of the subsequent discussions
- 1.
- Recapitulate the orthogonality and completeness of the projector system , 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 (such as ).
- 3.
- Show within the main text that the “diagonalization (pinching) map” is CPTP, and guarantee that the basis of dissipation (pointer blocks) is mathematically stable.
- (2)
- Projector system : orthogonality and completeness (recap)
- (P1)
- and (orthogonal projection).
- (P2)
- If , then (orthogonality).
- (P3)
- (completeness; finite sum).
- (3)
- Block decomposition: finite block representation of observables and states
- (4)
- Jump operators and basic identities
- (5)
- Diagonalization (pinching) map and its CPTP property
- 1.
- For any , (positivity preservation).
- 2.
- For any ρ, (trace preservation).
- 3.
- For any , preserves positivity (complete positivity).
- (6)
- Immediate consequence on block action: is the diagonal-block projection
- (7)
- Conclusion of this section: the S5 dissipative data as the input to has been recapitulated, and the basic properties required for the analysis have been established within the main text

4.2. Definition of the GKLS Generator ()
- (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
- 1.
- define the state-side (Schrödinger picture) generator ,
- 2.
- define the observable-side (Heisenberg picture) generator ,
- 3.
-
rigorously prove within the main text that the two are consistent under the trace duality(i.e., that they are the two pictures of the same dynamics),
- (2)
- Definition 4.3: Schrödinger generator (state side)
- (3)
- Definition 4.4: Heisenberg generator (observable side)
- (4)
- Duality (two pictures of the same dynamics): consistency of and
- (5)
- Reduced form under the minimal S5 specification: ,
- (6)
- Conclusion of this section: the definition of the GKLS generator (both pictures) and the duality have been fixed

4.3. Basic Properties (TP, Hermiticity, Boundedness)
- (1)
- Aim of this section: establish the analytical soundness of (the GKLS generator) in a self-contained manner within this section
- 1.
- Differential form of TP (trace preservation): for any , .
- 2.
- Hermiticity preservation: if , then . Similarly, on the observable side, if , then is self-adjoint.
- 3.
- Boundedness: is a bounded linear operator on , and we give an explicit operator-norm estimate. In particular, under the minimal specification of this paper we obtain (or an equivalent estimate).
- (2)
- Differential form of TP:
- (3)
- Hermiticity preservation: state side and observable side
- (4)
- Boundedness: is a bounded linear operator on
- (5)
- Conclusion of this section: the minimal analyticity of (TP, Hermiticity, boundedness) has been fixed within the main text

4.4. Generation of a CPTP Semigroup
- (1)
- Aim of this section: prove in a self-contained manner within the main text that generates a strongly continuous CPTP semigroup
- 1.
- By the general result for bounded generators (), we establish that is a -semigroup and that its generator is .
- 2.
- We further show that 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 admits a unique mild solution , and that the set of density operators is invariant.
- (2)
- Semigroup generation (analysis): is a bounded generator
- (3)
- CPTP property (structure): closed form under the minimal specification
- (4)
- CPTP property (conclusion): is CPTP at each time and forms a strongly continuous CPTP semigroup
- (5)
- Reference: the same structure works for general GKLS (Euler limit plus closure)
- (6)
- Direct corollary: well-posedness of the dissipative equation and invariance of the state set
- (7)
- Conclusion of this section: generates a strongly continuous CPTP semigroup (core of this chapter)

4.5. Explicit Action on the Projector Basis
- (1)
- Aim of this section: fully visualize the action of the dissipative semigroup and the generator in terms of projector block components
- (2)
- Basic identity of block projections:
- (3)
- Block action of the generator: closed form of
- (4)
- Block equations: exact solution of each component of the dissipative equation
- (5)
- Block representation of the semigroup action: explicit block action of
- (6)
- Equivalent closed form (recap): agreement with
- (7)
- Conclusion of this section: the physical meaning of dissipation (dephasing) has been fixed as rigorous block equations

4.6. Handoff to (Organizing the Component Conditions)
- (1)
- Aim of this section: list the “verified conditions” under which the dissipative component can be fed into the componentwise composition (Chernoff/Trotter) in , and close the proof chain
- 1.
- that is a strongly continuous CPTP semigroup and, in particular, is trace-norm contractive,
- 2.
- that is a bounded generator whose domain is the whole space ,
- 3.
- that in the tangency condition for , the term originating from is automatically controlled,
- (2)
- Notation: component semigroups and component generators used in
- (3)
- Handoff proposition I: properties of the dissipative semigroup (CPTP, contractive, strongly continuous, closed form)
- (H1)
- Semigroup property and strong continuity:
- (H2)
- CPTP property: for any , is CPTP. In particular, , and .
- (H3)
- Trace-norm contractivity:
- (H4)
- Closed form:
- (4)
- Handoff proposition II: properties of the dissipative generator (boundedness, domain, conservation laws)
- (G1)
- Boundedness: , and
- (G2)
-
Domain: as the generator of an exponential semigroup,(i.e., no domain issue arises for the dissipative part).
- (G3)
- Differential form of trace preservation: for any ,
- (G4)
- Hermiticity preservation: for any ,
- (G5)
- Reduced form:
- (5)
- Handoff proposition III: automatic control of the dissipative part in the tangency condition in (reduction regarding a common core)
- 1.
- For any linear subspace , holds automatically.
- 2.
- Moreover, for any , holds automatically. In particular, the assumption “ is invariant under ” is,for the dissipative part alone, not an additional condition (it simply means that acts on the whole space).
- 3.
-
The difference appearing in the tangency condition,converges to 0 as for any .
- (6)
- Usage form in : checklist (proved items) for the dissipative part
- 1.
- that is contractive (),
- 2.
- that is strongly continuous,
- 3.
- that is CPTP (to propagate the CPTP property via closure under limits),
- 4.
- that the tangency condition holds on a dense set,
- (7)
- Conclusion of this section: the dissipative component satisfies the composition assumptions of (no unresolved issues remain for the dissipative part)

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
- 1.
- the resonance projection and its geometric support set ,
- 2.
- the zero-area condition ,
- 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,
- (2)
- Goal of this chapter: define R primarily as “the generator of a CPTP semigroup ,” and connect zero-area/flux-blocking as accompanying specifications
- (Layer A)
- Analytical layer (essential): Define 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 satisfies the zero-area condition and that flux-blocking holds as constraints on the construction (or admissible class) of , and connect them in a manner consistent with the analytical layer.
- (3)
- Detailed targets: theorem set to be established in this chapter (clarifying proof obligations)
- (D1)
- Definition as a semigroup: Define a strongly continuous semigroup on the state space , and prove that for each t, is CPTP.
- (D2)
- Introduction of the generator: Define R as the generator of in the sense of Definition 43, and show that is dense and that R is a closed operator.
- (D3)
-
Differential form of conservation laws: For any , prove within the main text that(the differential form of trace preservation).
- (D4)
-
Dual picture: Define by trace duality, establish that is a normal unital-CP semigroup, and introduce the generator so thatholds.
- (D5)
- Consistency of zero-area/flux-blocking: Show that the zero-area condition and the flux-blocking condition for the resonance projection do not contradict the above semigroup construction, and present at least one realizable sufficient condition (such as line-bundle support).
- (D5)
- Handoff to : Organize that 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
- 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 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.
- (5)
- Conclusion of this section: the roadmap (targets) of has been fixed

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 can be handled equivalently both as a normal UCP semigroup on the observable side and as a CPTP semigroup on the state side
- 1.
- For a normal UCP map , its predual exists uniquely, and is UCP ⟺ is CPTP; we restate this equivalence in the context of R.
- 2.
- We define that the semigroup (Heisenberg) and the semigroup (Schrödinger) are linked byand prove that this correspondence preserves the semigroup property, continuity, and contractivity.
- 3.
- We define the correspondence between the generator R and the dual generator byand establish within this section that the generator of and the generator of are dual.
- (2)
- Underlying spaces (recap): and
- (3)
- Normal maps and preduals (preadjoints): existence, uniqueness, and norm estimate
- (4)
- UCP ⟺ CPTP (fixing the equivalence in the context of this chapter)
- (5)
- Duality of semigroups: the Heisenberg semigroup and the Schrödinger semigroup
- (6)
- Propagation of contractivity and CPTP: UCP semigroup ⇒ CPTP semigroup
- (7)
- Dual generators: correspondence between R and (fixing the definition)
- (8)
- Conclusion of this section: the “underlying spaces” and the “two equivalent descriptions” needed to construct R have been fixed

5.3. Definition of as a CPTP Transport Semigroup
- (1)
- Aim of this section: define primarily as “transport,” and prove within the main text that it is CPTP, a semigroup, and strongly continuous
- 1.
- the semigroup property (),
- 2.
- CPTP (complete positivity and trace preservation),
- 3.
- strong continuity ( property),
- 4.
- a unitary implementation induced by a geometric flow (corresponding to the meaning of transport),
- (2)
- Transport data: measure-preserving flow and the Koopman unitary group
- (F1)
- (Group property) , and (for all ).
- (F2)
- (Measurability) For each t, is measurable.
- (F3)
-
(Measure preservation) For any ,holds.
- (F4)
- ( strong continuity) The Koopman operators (Definition 66) defined on form a strongly continuous group.
- (3)
- Heisenberg transport: definition of a normal -*automorphism group
- (A1)
- (Group property) , .
- (A2)
- (-*automorphism) , .
- (A3)
- (Normality) is σ-weakly continuous (hence normal).
- (A4)
- (UCP) is unital-CP (hence UCP).
- (4)
- Schrödinger transport: definition and explicit formula of the CPTP semigroup
- (5)
- Main theorem: is a strongly continuous CPTP transport semigroup and is trace-norm isometric
- (T1)
- (Semigroup property) and ().
- (T2)
- (CPTP) For each , is CPTP.
- (T3)
- (Trace-norm isometry) For any , .
- (T4)
- (Strong continuity) For any , .
- (6)
- “Localization” implementation for connecting to the zero-area specification (minimal organization in this section)
- (7)
- Conclusion of this section: has been primarily defined as a CPTP transport semigroup, and the foundation for the subsequent discussion (the generator R) in has been fixed

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 , and fix within the main text the conservation laws, -*compatibility, and tangent-cone compatibility of the positive cone
- 1.
- The domain of the generator and uniqueness of the action (fixing the definition).
- 2.
- The differential form of trace preservation , which follows from being TP.
- 3.
- ∗-compatibility derived from CPTP (the differential form of Hermiticity preservation): .
- 4.
- The tangent-cone compatibility of the positive cone (tangent cone property) as the differential form of positivity preservation: if , then 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 .)
- (2)
- Definition 5.6: generator R (strong derivative)
- 1.
- is dense in X,
- 2.
- R is a closed operator,
- 3.
- for and , one has and .
- (3)
- Lemma 5.7: TP (differential form of information conservation)
- (4)
- ∗-compatibility: (differential form of Hermiticity preservation)
- 1.
-
For any and any ,holds.
- 2.
-
Moreover, for any , one has andholds.
- (5)
- Lemma 5.8: differential form of positivity preservation (tangent-cone compatibility of the positive cone)
- (6)
- Immediate corollary: stays inside the positive cone, and the tangent is given by
- (7)
- Conclusion of this section: R has been defined as a strong derivative, and the identities needed for componentwise composition in have been fixed

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
- 1.
- rigorously define the support set of the resonance projection ,
- 2.
- declare the zero-area condition 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,
- (2)
- Geometric stage: boundary and the two-dimensional Hausdorff measure
- (3)
- Support of the resonance projection : definition via an operator-valued Radon measure
- (M1)
-
For any countable disjoint family , one has, in the weak operator topology,(countable additivity).
- (M2)
-
For any , the complex measureis a finite Radon measure.
- (4)
- Definition of the zero-area condition and a basic equivalence (characterization by coverings)
- (5)
- Lemma 5.10: one-dimensional flow support (line support) ⇒ zero-area (a sufficient condition to avoid vacuity of the definition)
- (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

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 is a CPTP semigroup
- 1.
- From the GKLS form, construct a Kraus representation of a “small time-step” map (hence CPTP).
- 2.
- Show in that the step map is tangent to R.
- 3.
- Represent as a strong limit of CPTP maps via a power limit, and derive CPTP-ness of from closure of CPTP ().
- (2)
- Setup: Hilbert space and state space, finitely many Lindblad operators
- (L0)
- A bounded self-adjoint operator (Hamiltonian part).
- (L1)
- A finite family of bounded operators ().
- (L2)
- A positive operator
- (3)
- GKLS (Lindblad) form: definition and boundedness of the resonance generator R
- (4)
- CPTP approximation for small times (Kraus form): Chernoff approximation of the dissipative part
- (5)
- Tangency: agrees with the dissipative generator D to first order
- (6)
- First-order approximation of the Hamiltonian part: tangency of unitary conjugation
- (7)
- Main theorem: GKLS form is a CPTP semigroup (sufficient condition)
- (8)
- Remark: -localized Lindblad data is consistent with the zero-area specification (an optional sufficient condition)
- (9)
- Conclusion of this section: the GKLS form guarantees CPTP-ness of

6. Total Generator : Semigroup Generation by CPTP Componentwise Composition and Well-Posedness
6.1. Goal of This Section
- (1)
- Position of this chapter: define the total generator as a “limit of componentwise composition,” and establish well-posedness while preserving CP/TP
- 1.
- that the reversible part (unitary conjugation) is a strongly continuous CPTP group (),
- 2.
- that the dissipative part is a strongly continuous CPTP semigroup (),
- 3.
- that the resonance (transport) part is a strongly continuous CPTP semigroup and that the generator R is defined (–),
- 4.
- that CPTP maps are closed under composition and limits (),
- 5.
- that the Chernoff/Trotter-type product formula (a theorem identifying a product limit with a known semigroup) holds ().
- 1.
- is a strongly continuous CPTP semigroup (hence preserves the state set),
- 2.
- has generator equal to the closure of ,
- 3.
- and therefore yields that the UEE is well posed in the sense of mild solutions (existence, uniqueness, and continuous dependence).
- (2)
- Methodology of this chapter: CPTP componentwise composition + (i) CPTP propagation by closure, (ii) generator identification by a product formula
- (A)
- Preservation of CPTP (closure): For each n,is immediately guaranteed to be CPTP by closure of CPTP under composition. If, moreover, in , then by closure of CPTP under limits, 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 () and show, on a dense core, thatis tangent to the generator , thereby obtaining(a known semigroup). Since the dissipative part is bounded, the common-core condition is reduced essentially to conditions on and R ().
- (3)
- Main theorem to be proved in this chapter (fixing the formal goal)
- 1.
-
For any and , the limitexists in , and is a strongly continuous semigroup.
- 2.
- For each , is CPTP.
- 3.
- The generator of this semigroup coincides with
- 4.
-
Therefore, for any initial state ,is the mild solution of the UEE and is unique. Moreover, holds for all .
- (4)
- Conclusion form of this chapter (summary of the “goal” for the reader)

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 is meaningful
- 1.
- Fix the state space as the standard realization and confirm that all three components act on X.
- 2.
- Define the reversible part not as D on the Hilbert space, but as the generator on the state space, , thereby excluding type confusion (such as writing ).
- 3.
- Restate within this section, using the theorems and lemmas already established, that each component semigroup is CPTP and is -contractive (at least ), and connect this to the assumptions (contraction family) of the product formula in .
- (2)
- Fixing the state space: and the density-operator set
- (3)
- Fixing the types of component generators: are all generators on X
- (4)
- Definition of the component semigroups: , ,
- (C0)
- Reversible part (unitary conjugation):
- (CΔ)
- Dissipative part (exponential semigroup):
- (CR)
- Resonance part (transport semigroup): Let be given by the construction in (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
- (i)
- is CPTP for and is trace-norm isometric:
- (ii)
- is a strongly continuous CPTP semigroup for and is trace-norm contractive:
- (iii)
- is a strongly continuous CPTP semigroup for , and in the minimal transport construction it is trace-norm isometric:
- (6)
- Preparation for composition in §6: minimal requirements for treating as a Chernoff approximating family
- (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 has been prepared

6.3. Definition of the Composite Approximation (Trotter/Chernoff Type)
- (1)
- Aim of this section: rigorously define the “composite approximation sequence” for defining the full time evolution , and fix within this section CPTP-ness, contractivity, and basic consistency
- 1.
- Fix the definitions of the Chernoff approximating family and the n-partition approximation .
- 2.
- Prove immediately that each is CPTP and hence preserves .
- 3.
- Prove that each is trace-norm contractive (-contractive) and hence is compatible with stability under limit operations ().
- (2)
- Definition of the Chernoff approximating family (fixing the order)
- (3)
- Definition of the n-partition composite approximation (fixing the meaning of powers)
- (4)
- Immediate properties of the composite approximation sequence: CPTP-ness and invariance of the state set
- (5)
- Contractivity: (uniform bound)
- (6)
- Telescoping identity (estimating differences): preparation for the limit proof in
- (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

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
- (2)
- Organizing the domains: fixing the formal domain of the total generator as the intersection of the domains of and R
- (3)
- Common core assumption (fixed): the minimal package required to identify the generator via the product formula
- (CC1)
- Density and common domain: is dense in X, and
- (CC2)
- (If needed) core property: Consider the closure of , and assume that is a core of it (i.e., ).
- (CC3)
- Chernoff tangency condition (central condition for generator identification): For any ,
- (4)
- Automaticity of the dissipative part: since is bounded, it is not a “constraint” for the common core
- (5)
- Reduction of the tangency condition: if then (6.4-CT) can be decomposed automatically (excluding the dissipative part)
- (6)
- Practical choice of a common core (example): a finite-rank common core
- (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 and R

6.5. Main Theorem: The Limit Semigroup of CPTP Componentwise Composition and Generation by
- (1)
- Aim of this section: rigorously establish that the limit of the composite approximation exists, that the limit is a CPTP semigroup, and that its generator coincides with
- (2)
- Generator-known route (A4-i): fixing the assumption that generates a contraction -semigroup
- (K1)
- generates a contraction -semigroup on X.
- (K2)
- is a core of (automatic from the definition, but stated explicitly for later reference).
- (3)
- Lemma: (identification of closures)
- (4)
- Main theorem: the limit of coincides with , hence is CPTP
- (i)
-
(Existence and identification of the limit) For any and any ,holds, where is the contraction -semigroup generated by .
- (ii)
- (CPTP property) For each , is CPTP and, in particular, preserves .
- (iii)
-
(Generator) The generator of coincides withHence one may write .
- (5)
- Direct corollary: well-posedness of the UEE (existence and uniqueness of mild solutions) and state invariance
- (6)
- Conclusion of this section: the limit of CPTP componentwise composition yields a strongly continuous CPTP semigroup, and its generator coincides with

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”
- (A)
- (Semigroup-level simplification) If the component semigroups commute for all times, then the productis itself a semigroup, and thereforeholds 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 hasThis is the “strongest simplified form” in the commuting case.
- (2)
- Definition of commutativity: commutativity at all times (strong commutativity)
- (3)
- Two-component simplification: the product of two strongly commuting semigroups is a semigroup
- (4)
- Exponential factorization when bounded generators commute (the strongest simplified form)
- (5)
- When the three components strongly commute: the Chernoff approximation agrees exactly for each n
- (i)
- is a semigroup on X (i.e., ).
- (ii)
-
For any and ,holds. Hence holds trivially.
- (iii)
- For each , is CPTP (hence preserves ).
- (6)
- Simplification of the generator: under strong commutativity, tangency agrees with the formal sum
- (7)
- Conclusion of this section: commutativity yields “no need for limits” and “factorization of exponentials”

7. Conclusion
7.1. Summary
- (1)
- Reconfirming what is proposed in the UEE: abstract form (UEE_01) and standard form (UEE_05 and later)
- (2)
- What this paper fixed: state space, CPTP, and UEE analytic data (input contract)
- 1.
- Type of the state space: We set the observable algebra to be a von Neumann algebra , the state space to be its predual , and took the normal state set 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
- (3)
- What this paper guaranteed: semigroup generation by CPTP componentwise composition and well-posedness
- 1.
- Construction of the component semigroups: The reversible part , the dissipative part , and the resonance (transport) part were constructed as strongly continuous CPTP (group/semigroup) on the same state space , 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 sequenceand showed that the limit semigroup is a strongly continuous CPTP semigroup and that its generator coincides with (where ) (Theorem 32).
- 3.
- Well-posedness of the UEE and state invariance: Consequently, for any initial value ,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).
- (4)
- Clarifying what is not claimed (out of scope)
- 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.
- (5)
- Connection to the series (positioning as a foundational analysis)

8. References
A. Semigroups, generators, and product formulas (C0 semigroups, Hille–Yosida, Lumer–Phillips, Trotter/Chernoff)
B. Operator theory, self-adjointness, and spectral theory (Stone’s theorem, etc.)
C. Trace-class operators and Schatten norms (foundations of contractivity)
- Trace ideals and analysis of /: [10]
D. C*-algebras, von Neumann algebras, and preduals (normality and the type of the state space)
- Physical background in quantum statistics and operator algebras: [15]
E. Completely positive maps and quantum channels (Stinespring/Kraus/Choi, operator spaces)
F. GKLS (Lindblad) form, open quantum systems, and quantum dynamical semigroups
References
- 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]
- 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]
- 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]
- Kato, T. Perturbation Theory for Linear Operators, 2 ed.; Classics in Mathematics; Springer-Verlag: Berlin, Heidelberg, 1995. [Google Scholar] [CrossRef]
- Trotter, H.F. On the product of semi-groups of operators. Proceedings of the American Mathematical Society 1959, 10, 545–551. [Google Scholar] [CrossRef]
- Chernoff, P.R. Note on product formulas for operator semigroups. Journal of Functional Analysis 1968, 2, 238–242. [Google Scholar] [CrossRef]
- 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]
- Reed, M.; Simon, B. Methods of Modern Mathematical Physics I: Functional Analysis; Revised and enlarged edition; Academic Press: New York, 1980. [Google Scholar]
- Reed, M.; Simon, B. Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness; Academic Press: New York, 1975. [Google Scholar]
- Simon, B. Trace Ideals and Their Applications, 2 ed.; Mathematical Surveys and Monographs; American Mathematical Society: Providence, RI, 2005; Vol. 120. [Google Scholar] [CrossRef]
- Sakai, S. *-Algebras and W*-Algebras; Originally published in 1971; Classics in Mathematics, Springer-Verlag: Berlin, Heidelberg, 1998. [Google Scholar] [CrossRef]
- Takesaki, M. Theory of Operator Algebras I; Springer-Verlag: New York, 1979. [Google Scholar] [CrossRef]
- Kadison, R.V.; Ringrose, J.R. Fundamentals of the Theory of Operator Algebras, Volume I: Elementary Theory; Academic Press: New York, 1983. [Google Scholar]
- Kadison, R.V.; Ringrose, J.R. Fundamentals of the Theory of Operator Algebras, Volume II: Advanced Theory; Academic Press: New York, 1986. [Google Scholar]
- 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]
- Stinespring, W.F. Positive functions on C*-algebras. Proceedings of the American Mathematical Society 1955, 6, 211–216. [Google Scholar] [CrossRef]
- Kraus, K. General state changes in quantum theory. Annals of Physics 1971, 64, 311–335. [Google Scholar] [CrossRef]
- Choi, M.D. Completely positive linear maps on complex matrices. Linear Algebra and its Applications 1975, 10, 285–290. [Google Scholar] [CrossRef]
- Paulsen, V.I. Completely Bounded Maps and Operator Algebras; Cambridge University Press: Cambridge, 2002; Vol. 78, Cambridge Studies in Advanced Mathematics. [Google Scholar]
- Watrous, J. The Theory of Quantum Information; Cambridge University Press: Cambridge, 2018. [Google Scholar] [CrossRef]
- 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]
- Lindblad, G. On the generators of quantum dynamical semigroups. Communications in Mathematical Physics 1976, 48, 119–130. [Google Scholar] [CrossRef]
- Davies, E.B. Quantum Theory of Open Systems; Academic Press: London, 1976. [Google Scholar]
- Breuer, H.P.; Petruccione, F. The Theory of Open Quantum Systems; Oxford University Press: Oxford, 2002. [Google Scholar]
- Alicki, R.; Lendi, K. Quantum Dynamical Semigroups and Applications; Lecture Notes in Physics; Springer-Verlag: Berlin, Heidelberg, 1987; Vol. 286. [Google Scholar] [CrossRef]
- Shimizu, Y. Unified Evolution Equation, v1.4, 2026; Released; CC BY 4.0., 02 01 2026. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- Shimizu, Y. Extended Information Flux Theory: Fractal Scaling Law, v1.2, 2026; Released; CC BY 4.0., 09 01 2026. [Google Scholar] [CrossRef]
- 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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).