Every noisy quantum process is a reversible process on a larger system with part of that system ignored, and in CSD the larger system is the constraint surface itself, so every channel the programme uses is the environment's marginal of a volume- preserving flow.
apply_eq_traceRight_stinespringThe basic evolution of quantum mechanics is reversible, so nothing is lost and running it backwards recovers the starting state exactly. Real processes aren't like that, as a qubit stored in a device gradually loses its coherence, a photon in a fibre is sometimes absorbed, and a measurement leaves the system changed in a way that can't be undone. The general description of such a process is a channel, a rule that turns states into states while respecting probabilities, and channels can lose information.
Stinespring's theorem reconciles the two pictures. Any channel, however lossy, is a reversible evolution of the system together with an environment, followed by ignoring the environment, where ignoring means averaging over everything the environment could be doing, an operation called the partial trace. The information isn't destroyed, as it has moved into correlations with the environment, where a description of the system alone can't see it. A bit flip that happens with some probability, for instance, is a reversible interaction with a single environment qubit that records whether the flip occurred, seen from the side that doesn't read that record.
The theorem is the hinge between the programme's ontic and operational layers. The constraint surface carries system and environment together, and its dynamics is a volume-preserving flow that lifts a reversible evolution of the joint state space. The corpus proves that when such a flow acts on a preparation whose environment starts in a ready state, the density operator of the flowed preparation, seen from the system alone, is a channel applied to the density operator of the original preparation, and it identifies which channel, the one Stinespring's construction assigns to the joint evolution and the ready state. So the channels of quantum information aren't introduced into the programme, as they're what its flows look like from inside. The measurement flow yields the de-isolation channel in this way, and the bit-flip errors of the three-qubit code arise from a flow on the register with a four-level environment. A mixed environment is covered as well, through the spectral decomposition of its density operator.
Channel.ofIsometry builds the channel Tr_env(V rho V^H) from an isometry V into system times environment, and apply_eq_traceRight_stinespring together with stinespringIsom_isom shows every Kraus channel arises this way, with the Kraus operators as the environment blocks of V. stinespringChannel U hU e_0 (LF2/FlowChannel.lean) is the channel of a joint unitary with a ready environment, and traceRight_barycenter_flow states that for a flow lifting U in the projector sense (IsUnitaryLift) and a preparation that is a product with the environment ready, almost everywhere in the representative, the reduced barycentre of the flowed preparation is that channel applied to the system's barycentre. isUnitaryLift_unitSection removes the section hypothesis for projective actions, stinespringChannelMixed handles a mixed environment, and channelEquiv (LF2/ChannelBridge.lean) transports the construction between the corpus's two channel structures.
W. Forrest Stinespring (1929-2012) taught at the University of Illinois at Chicago for most of his career. The dilation theorem is in a short 1955 paper in the Proceedings of the American Mathematical Society, written in the language of positive maps on operator algebras and generalising Naimark's dilation of a positive operator measure. Its reading as the statement that every quantum channel is a unitary on a larger space, with the environment traced away, came with Kraus's work on operator-sum representations in the 1970s and 1980s, long after the mathematics was settled.
CsdLean4/Mathlib/QuantumInfo/Stinespring.leanSource links are pinned to a commit, so they do not drift. The anchors above are checked mechanically against the Lean tree on every build. The mathematics is not, and cannot be: that is a human responsibility and it rests with the author.
Part of Constraint-Surface Dynamics · Formalised in csd-lean4.
Google Analytics counts visits to this page, which stores cookies in your browser. They record how the page was reached, not who you are, and nothing is passed on. Blocking cookies for this site breaks nothing here. Details.