How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite reduced dynamics, memory and quantum trajectories
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite completely positive trace-preserving maps
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal density states and spectral moments
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Strongly Continuous Semigroups and Hille Yosida
- Subspaces, Products, and Quotients
- Suprema and Infima
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trace-class bounded-observable response
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Finite channel families, semigroups, and CP-divisibility
Definition
Let and let be a family of finite quantum channels indexed by , where “finite quantum channel” has the meaning in Finite completely positive trace-preserving maps. The family obeys the semigroup law when and for every .
The family is CP-divisible when for every there exists a finite quantum channel such that . CP-divisibility is this specified factorization property; the definition does not assert that it is a universal meaning of “Markovian”.
Definition references
Remarks
The source literature distinguishes divisibility and time-homogeneous semigroup conditions and discusses several meanings of quantum Markovianity. This item fixes only the map properties used on this page.
Continuous finite-dimensional ordered-simplex integrals
Statement
Let , let be an integer, and let be a finite-dimensional real or complex vector space with a specified finite ordered basis and its coordinate topology. Put , with . Let have continuous coordinates. Set . For , write and put if , and . Define recursively
integrating real coordinates, and real and imaginary parts of complex coordinates. Every integral exists and every is continuous on its remaining parameter domain. Write ; equivalently this is the iterated integral with limits . Degenerate one-variable integrals are zero. For , set ; for and , .
These integrals are linear, independent of the chosen finite basis, and commute with finite-dimensional linear maps. For any norm on , the corresponding one-variable integral satisfies for continuous and . If on , where , then
Here the factor for is , including . For scalar , with this convention. For real scalar , every partial integral is nonnegative. No differentiability of or choice principle is assumed.
Statement references
Facts & Assumptions
Given: and the ordered-coordinate domains in the Statement. A norm on is needed only for its norm estimates.
Continuous real functions on nondegenerate closed intervals are Darboux integrable; the equal-endpoint oriented integral is zero (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation , The integral with oriented limits: and , A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion).
The scalar integral is linear and monotone (Integrable functions on form a set closed under sums and scalar multiples, and , If on and both are integrable then ; and ). For an integrable function its tagged Riemann sums converge to its Darboux integral as mesh tends to zero, uniformly over the tags (The Darboux and Riemann definitions agree: a bounded on is Darboux integrable with integral if and only if for every real there is a real such that for every tagged partition of mesh below ).
If is continuous on a nondegenerate interval containing the image of a differentiable map with integrable derivative, affine substitution gives (Substitution: if is differentiable on with integrable and is continuous on an interval containing , then ).
Closed bounded subsets of finite-dimensional Euclidean space are compact, and continuous maps from compact metric spaces to metric spaces are uniformly continuous (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).
Newton–Leibniz applies to a continuous primitive with an integrable extension of its interior derivative, and for every integer (Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative, For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term).
Proof
First consider a continuous curve . In a real basis , its coordinate functions are integrable by [F1], and define its integral by their integrals. For a complex basis use the underlying real basis ; this is exactly the real-and-imaginary convention. The zero-dimensional space is immediate. In either case the triangle inequality gives . Thus coordinate convergence implies convergence in any chosen norm, without assuming norm equivalence. By [F2], tagged sums of converge in that norm to its coordinate integral. The reverse triangle inequality and the same finite-coordinate bound show that is continuous, so it too is integrable. For each tagged partition, the norm of the vector sum is at most the corresponding sum of the scalar norms. Taking limits by [F2] proves when ; for both integrals are zero. A coordinate change or a linear map has entries given by a finite matrix, so scalar linearity [F2] proves that integration commutes with it, and hence proves basis independence. This also proves linearity, and [F2] proves that a nonnegative real curve has nonnegative integral. All statements concern finite lists of coordinates, and require only finitely many simultaneous estimates.
Suppose is continuous on , as is true initially for . For each , the curve is continuous for and is integrable by step 1.1. Set and
The evaluation map is continuous and lands in , because and the coordinates of are ordered. Thus is coordinate-continuous. The parameter domain is closed and bounded in a finite-dimensional Euclidean space, hence compact by [F4]; when there are no remaining coordinates it is just . The finite-coordinate inequality of step 1.1 shows that is also continuous into any chosen norm on . Apply [F4] with the Euclidean metric on the parameter domain and that norm metric on . Uniform continuity gives, as within its parameter domain,
Indeed the Euclidean distance from to is , independently of . This conclusion also holds coordinate by coordinate if no norm was initially specified, by using the explicitly defined coordinate norm .
If , apply [F3] in each real coordinate with and on . All its scalar continuity and differentiability hypotheses hold, and is constant and integrable. This gives
If , both sides are zero by [F1], so the same identity holds. By linearity and step 1.1, for any fixed its difference at satisfies
The first term tends to zero by step 2.1 and the second by continuity of . Thus is continuous, including at parameters with . If there are no remaining coordinates this is continuity on a singleton. Induction proves existence and continuity at every recursive stage. When and , already the first integration has equal endpoints, so all later integrals are zero; the specified value needs no integration.
Apply the linearity, linear-map commutation and basis independence of step 1.1 successively at each stage. Every resulting coordinate curve is continuous by step 3.1, so these operations are legitimate at every stage and prove the corresponding claims for . Likewise a nonnegative real has nonnegative , then nonnegative , and so on by scalar monotonicity. No exchange of integration order or assertion of differentiability is involved.
Suppose . At the first stage step 1.1 and scalar monotonicity give . If and the previous bound is , the same integral inequality bounds by . The monomial primitive and integral evaluation follow from [F1] and [F5] when the endpoint is positive; equal endpoints give the same value zero. Induction gives the stated final bound. For scalar the same recursion is an equality at every stage, yielding . For both assertions follow directly from and the factor convention.
Finite GKSL jump-trajectory branches
Definition
Let , let be an integer, let have units joules, let have units joule-seconds, and let have units , with the finite GKSL convention of Finite GKSL generators and units. Put and for , with the exponential defined by its norm-convergent power series. For a density matrix , meaning and , define the no-jump branch at time by and its branch state by .
All time variables are measured in seconds. For , a jump-history label is and its jump times are seconds . Define the corresponding branch operator by and the unnormalized branch state by . Its branch-weight density is the real-valued scalar function . For , let and . Use the same formula for on ; it is continuous there because is continuous for . If is a finite-dimensional real or complex vector space and has continuous coordinates in a basis, define as exactly the repeated one-variable Riemann integral over the closed limits shown here , integrating each real coordinate; for complex coordinates, integrate their real and imaginary parts separately. This value is independent of the basis because a change of basis is a finite linear combination and scalar Riemann integration is linear. For this defines the scalar integral of the density ; the same convention applies to branch-state integrands with values in and to integrands with values in the finite-dimensional complex vector space of complex-linear maps . The full recursion is well-defined for these arbitrary continuous integrands by Continuous finite-dimensional ordered-simplex integrals: every inner integral is continuous in all remaining ordered parameters, so the next integral exists. That lemma also proves basis independence, linear-map commutation, the norm bound by the supremum times , and positivity for nonnegative real scalar integrands. Set for a degenerate interval; hence every ordered-simplex integral at is zero. Let and define ; in the expansion, the contribution is the no-jump branch already defined above. For , has units and has units ; integrating over the time variables gives a dimensionless weight. If , there are no branches with . This definition alone does not assert that the branch weights sum to one.
Definition references
Remarks
The definition supplies formal finite jump labels, times, branch operators, and branch weights. The ensemble identity and normalization are proved separately; a branch is not asserted to be a detector record.
Finite system-environment and Markov model assignments
A finite-dimensional non-relativistic quantum system and finite environment with a fixed product initial assignment and a declared joint unitary family. A time-homogeneous finite GKSL model is an optional, separately adopted approximation. No initial system-environment correlations, continuum reservoir limit, microscopic Markov derivation, apparatus realization, or experimental observation is asserted.
Postulate
Work with finite-dimensional system and environment spaces and , where , using the ordered tensor product with the system factor first. A system or environment state is a positive semidefinite Hermitian matrix of trace one; these state matrices are dimensionless. At the initial time, for every allowed system state , adopt the joint preparation , where the fixed environment state does not depend on . For each , choose a declared unitary on , meaning , with . The reduced system dynamics is the map , where for the fixed product basis the finite partial trace has entries . This assignment excludes initially correlated joint states. It imposes no one-parameter group, continuity, or semigroup law on .
A time-homogeneous finite GKSL model may instead be selected as a separate approximation: choose a fixed finite-dimensional Hamiltonian matrix in joules, a constant in joule-seconds, and finitely many jump matrices in , and use for with . Here is complex-linear, , , and is conjugate transpose. The exponential means , with and powers given by composition. This series converges absolutely in the operator norm induced by the finite matrix trace norm , as in the finite GKSL semigroup theorem cited below; its hypotheses are exactly the finite Hermitian , positive , and finite jump family specified here. Each application must state its rates and physical regime. Selecting this approximation is not a consequence of the finite unitary reduction, and this postulate claims no weak-coupling or reservoir limit.
In both alternatives, the parameter indexing or denotes elapsed physical time measured in SI seconds. Thus in the GKSL exponential is dimensionless, since the adopted finite GKSL generator has units .
Postulate references
Remarks
The diagram records only the defined finite-map composition. It supplies no proof of complete positivity or trace preservation.
diagram failed to render:
\rho \arrow[r, "{X\mapsto X\otimes\eta}"] \arrow[drr, "\Phi_t"'] &
\rho\otimes\eta \arrow[r, "{R\mapsto U_t R U_t^*}"] &
U_t(\rho\otimes\eta)U_t^* \arrow[d, "\operatorname{Tr}_E"] \\
& & \Phi_t(\rho)Product-state reduced evolution is a channel
Exact reduced maps of finite-dimensional system and environment models with a fixed product initial assignment and unitary joint evolution. The theorem permits neither an initial-correlation extension nor a continuum bath or Markov limit; its finite example is a conditional model calculation, not an experiment.
Statement
In the finite product-state model, fix any and define the complex-linear map by . Then is a finite quantum channel. The family need not obey the semigroup law and need not be CP-divisible. The terms “semigroup law” and “CP-divisible” have the definitions of Finite channel families, semigroups, and CP-divisibility.
Statement references
Facts & Assumptions
Given: Integers , time , system and environment density matrices and , and a unitary on with the system factor first.
Finite system-environment and Markov model assignments: is fixed independently of every allowed input , the joint initial state is , and the reduced map is ; the parameter indexing is elapsed physical time measured in seconds.
Partial trace over a finite tensor factor: in the ordered product basis, .
The partial trace is characterized by the trace pairing and is basis-independent: the finite partial trace is characterized by the trace pairing and its coordinate map is independent of the chosen environment orthonormal basis.
Finite matrix spectral and state calculus: every finite positive matrix has an orthonormal eigenbasis with nonnegative eigenvalues, and its trace is the sum of its diagonal entries in any orthonormal basis.
Finite completely positive trace-preserving maps: a finite channel is a complex-linear map that is completely positive on every finite ancilla extension and trace-preserving on every matrix input.
Complete finite Choi-Kraus equivalence: a finite map of Kraus form is completely positive, and it is trace-preserving exactly when .
Finite channel families, semigroups, and CP-divisibility: CP-divisibility requires a finite channel for every with ; the semigroup law requires and .
, and the complex exponential extends the real exponential: for complex .
, , and : for real , and .
is a bijection from onto the real unit circle: there exists with .
Proof
By [F3], choose an orthonormal environment eigenbasis with , , and . Use the fixed system basis from the model and its ordered product with this environment basis. By [F2], changing the environment basis does not change the partial-trace map in [F1]. For environment indices define the system matrix by . Expanding , conjugating by , and applying the coordinate formula [F1] gives, entry by entry, for every .
For a two-qubit instance take , in , with in joule-seconds, and where in the chosen environment eigenbasis. Put and for ; direct multiplication gives , , and . Define the matrix exponential for this instance by the power series . Since , the series converges entrywise by the scalar exponential definition [F7] and equals . In the ordered environment eigenbasis this is , where . By [F9], each scalar phase has modulus one, so is unitary and . The partial trace in [F1] therefore gives , so for the diagonal entries are unchanged and the off-diagonal entries are multiplied by .
By [F10], choose with and ; hence . Set . Euler's identity [F9] gives , and [F7]–[F8] give . Applying [F8] again yields and .
For system basis indices , unitarity of gives . Thus , so [F5] makes the Kraus map in step 1.1 completely positive and trace-preserving; by [F4], is a finite channel.
Let and . Since and , each is a projection; since , each has trace one. Steps 1.2 and 1.3 give , while and . Consequently , so the semigroup law in [F6] fails. If a channel satisfied , it would send the equal matrices and to equal outputs, contradicting the two distinct outputs at . By step 2.1, the family consists of channels, so this contradiction proves it is not CP-divisible by [F6].
Remarks
The two-qubit recurrence is a conditional prediction of a finite unitary model. It is not a reported observation and does not establish a physical Markov limit.
Amplitude damping with operational time units
The exact finite-dimensional qubit time-homogeneous GKSL model with one amplitude-damping jump operator. The formulas are conditional model predictions; no vacuum continuum, reservoir limit, detector record, or empirical decay rate is asserted.
Statement
For the separately selected qubit GKSL model, let with in and in joule-seconds, and let with in , so has units . For any initial density matrix in the ordered basis , the solution for satisfies , , , and .
Statement references
Finite system-environment and Markov model assignments
Finite GKSL generators and units
Finite GKSL generates CPTP semigroups
Every finite-dimensional normed space is Banach
Finite matrix trace-norm ideal inequalities
The exponential series of a bounded operator
Facts & Assumptions
Given: The selected finite GKSL model, , , and a qubit density matrix .
Finite system-environment and Markov model assignments: the time-homogeneous finite GKSL equation is a separately adopted approximation, not inferred from the finite system-environment reduction; its time parameter is elapsed physical time measured in seconds, so is dimensionless.
Finite GKSL generators and units: for the single-jump case.
Every finite-dimensional normed space is Banach and The exponential series of a bounded operator: the finite matrix space is complete and the bounded-operator exponential is its norm-convergent power series.
Finite matrix trace-norm ideal inequalities: for finite matrices.
Finite GKSL generates CPTP semigroups: is a finite channel for every .
Finite completely positive trace-preserving maps: a finite channel is completely positive and trace-preserving on all matrix inputs.
, and the complex exponential extends the real exponential: on real arguments, the complex exponential agrees with the real exponential .
Proof
Write , , so . In this basis, , , and . Direct multiplication in [F1] gives , , , and .
The matrix space is finite-dimensional and complete by [F2]. The trace-ideal estimate [F4] applied to the finitely many left and right multiplications in [F1] bounds by a finite constant times , so is bounded; [F2] therefore gives . Put . Step 1.1 gives and ; induction therefore gives for . Summing this scalar series using [F3] and the real-extension clause [F7] yields , including because both the added coefficient and every positive power term then vanish. Also step 1.1 gives for , while the two coherence matrix units are eigenvectors, so [F3] gives and . Applying these four identities linearly to gives all four formulas in the Statement.
By [F5] and [F6], the full evolution map is completely positive and trace-preserving for , so it carries each initial density matrix to a density matrix. These formulas are deductions within the selected approximation and assert no microscopic bath limit.
Remarks
The parameter is a model rate. Its numerical value and the regime in which this generator approximates a physical system must be supplied by a specific application; no measurement or statistical estimate is asserted here.
Finite jump expansion and ensemble equation
The exact finite-dimensional time-homogeneous GKSL approximation with finitely many bounded jump matrices. The jump expansion is one mathematical ensemble representation; it is not asserted to be unique, to identify an actual measurement record, or to arise from a microscopic reservoir.
Statement
Let , let have units joules, let have units joule-seconds, and let be a finite family with units , where . For the selected time-homogeneous finite GKSL model, put . With and the finite branch operators of Finite GKSL jump-trajectory branches, each no-jump operator is a contraction, each branch state is positive for , and for every density matrix and ,
where the term is and branches with are absent when . The series converges in trace norm, uniformly on each bounded time interval; the sum of all branch weights is one. This is an ensemble representation of the finite GKSL solution, not a unique microscopic trajectory or a claim about a particular detector.
Statement references
Facts & Assumptions
Given: Finite dimension , finite , , , jump matrices , a density matrix , and .
Finite system-environment and Markov model assignments: the time-homogeneous finite GKSL family is a separately selected approximation within the open-system model; it is not derived from the exact finite unitary reduction, and its time parameter is elapsed physical time measured in seconds.
Finite GKSL jump-trajectory branches: , , and is the ordered product of no-jump factors and jump matrices; the branch state is and its weight density is the real scalar . For , continuous functions on the ordered simplex with values in or in the finite-dimensional complex vector space of complex-linear maps are integrated by repeated componentwise Riemann integration, splitting complex coordinates into real and imaginary parts; the value is basis-independent. A degenerate interval has integral zero, so the simplex at contributes zero. The contribution is the no-jump branch.
Every finite-dimensional normed space is Banach: every finite-dimensional normed matrix space is complete.
The exponential series of a bounded operator: for a bounded operator on a Banach space, is norm-continuous, differentiable with derivative , and satisfies .
Finite matrix trace-norm ideal inequalities: the finite matrix trace norm is complete, satisfies , and .
Finite GKSL generates CPTP semigroups: is a trace-preserving finite channel for .
The operator norm as the least bound and as the unit-sphere or unit-ball supremum: for a bounded linear map between normed spaces, its operator norm is the supremum of the output norm over the input unit ball; here .
The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: continuous real functions on compact intervals have Riemann integrals, interpreted by the Darboux definition.
Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative: if a real function is continuous on a closed interval, differentiable in its interior, and its derivative has a Riemann-integrable extension, the integral of that extension is the endpoint increment.
For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term: for every integer , is differentiable with derivative ; constant scaling gives the corresponding monomial primitive.
Continuous finite-dimensional ordered-simplex integrals: every continuous finite-dimensional integrand on the closed ordered simplex has the recursive componentwise Riemann integrals in [F2], with every partial integral continuous in the remaining parameters. These integrals commute with linear maps and finite sums, preserve nonnegativity for real scalar integrands, and have norm at most the supremum norm of the integrand times , including the stated zero-variable and zero-time conventions.
Proof
Under [A1], put and . Then . The matrix space is complete by [F3], so [F4] differentiates . For every vector , . Since , the continuous derivative is integrable by [F8], and [F9] gives for , hence is a contraction.
On define , , and . By [F5], these finite sums of left and right matrix multiplications are bounded in trace norm. Expanding [F1] gives . Fix . Integrate finite-dimensional matrix and superoperator entries by their real and imaginary components, using the repeated Riemann convention in [F2]. The curve has continuously differentiable entries by [F4]; its real and imaginary derivative components are continuous and hence integrable by [F8]. Differentiation gives , since . Applying [F9] entrywise yields . This finite identity follows by induction on : the base case is the displayed variation-of-constants identity, and substituting that identity for the final in the remainder adds the next ordered-simplex term and a remainder with one more innermost time. Only finite linearity of the nested integrals is used; no integration order is exchanged. Thus, for each , , where , for , and for , where the product is ordered from left to right with descending , and the empty product is the identity. For the intermediate exponential factors are absent: , exactly the displayed variation-of-constants remainder. In particular there is no extra before . All these integrands are continuous in finite-dimensional coordinates on the closed ordered simplex; [F11] proves that every inner integral is continuous in its remaining parameters and hence the full repeated integral exists. The insertion of one further nested integral in the induction is therefore legitimate.
Left multiplication by and right multiplication by commute; multiplying their absolutely norm-convergent exponential series and grouping by total degree with the binomial formula yields . This establishes the no-jump superoperator formula used in the norm estimates below.
From [F5] and [F7], and , so the induced norms are finite. By step 2.1 and the contraction in step 1.1, [F5] gives for . The ordered-simplex volume is : the zero-variable volume is ; if the -variable volume is , then [F10] gives the primitive , and [F8] makes the integrand Riemann integrable, so [F9] evaluates the next repeated integral as . Induction proves the volume formula. The continuous-integrand norm bound in [F11], applied in the finite-dimensional superoperator space with norm , now bounds each integral by that volume times its pointwise norm bound. Thus . By [F4], , so . Replacing by any bound gives summable bounds for all and a remainder tending uniformly to zero. Thus the series converges in induced trace norm to , uniformly on bounded time intervals.
If , then and ; all positive-jump simplexes are empty, and the sole branch has weight . For , applying the operator identity from step 3.1 to and expanding each occurrence of in sums over labels . Step 2.1 turns each factor into the no-jump conjugation, so each integrand is by [F2]. This matrix is positive since for every vector ; this argument uses only , proving branch positivity for all positive inputs. All label sums at fixed are finite, and [F11] allows moving those sums and the finite-dimensional linear trace through the nested integrals. Trace-norm convergence from step 3.1 and the trace bound in [F5] then allow taking the trace of the infinite series. Each integrated branch weight is nonnegative: its continuous real trace integrand is pointwise nonnegative, and [F11] preserves this at every successive integration. For each vector , the finite-dimensional linear functional likewise commutes with these integrals by [F11]; its nonnegative integrand proves that every integrated branch state is positive. This positivity and convergence argument has not assumed the complete positivity of the final ensemble map. By [F6], , so the nonnegative integrated branch weights sum to one. If , then , all with vanish, and only the no-jump term remains.
Remarks
The derivation establishes a representation of the chosen finite GKSL equation. It does not identify the branches with unique physical paths, a unique unravelling, or observed detector events.
5 · Examples, experiments and counterexamples
None yet.
Sources
- Lin Lin and Nathan Wiebe, Quantum Algorithms for Scientific Computation, Chapter 21, §21.1
- Ángel Rivas, Susana F. Huelga, and Martin B. Plenio, Quantum Non-Markovianity: Characterization, Quantification and Detection, §3.2
- Riemann integration and affine substitution
- John Watrous, The Theory of Quantum Information, Chapter 2, §§2.1.3 and 2.2.2