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.
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.
Depends on
Finite system-environment and Markov model assignments
Finite channel families, semigroups, and CP-divisibility
Partial trace over a finite tensor factor
The partial trace is characterized by the trace pairing and is basis-independent
Finite completely positive trace-preserving maps
Complete finite Choi-Kraus equivalence
Finite matrix spectral and state calculus
The complex exponential by its power series
, and the complex exponential extends the real exponential
, , and
is a bijection from onto the real unit circle