A state on a represented ⋆-algebra #
The state calculus of MIPRE/Foundations/OpCalculus.lean is about operators on a Hilbert space.
The analyses write their operators in an algebra: matrices on ℂ^N, or elements of the players'
algebras. A state model (StateModel 𝒞) is the bridge: a complex Hilbert space H with a
state ψ, and a ⋆-algebra 𝒞 represented on H by a ⋆-homomorphism π. Its state norm,
bound and quadratic form are those of π T:
with the rules of the calculus restated in 𝒞, so that a chain of estimates about products and
sums in 𝒞 never has to push π through them by hand.
The matrix calculus of MIPRE/Foundations/OpBound.lean is this calculus in the model
StateModel.mat v: 𝒞 = M_N(ℂ) acting on EuclideanSpace ℂ N through Matrix.toEuclideanCLM,
with the state v. Its state norm is literally the matrix one (snorm_mat), and so are its
products and sums: a matrix statement is the generic statement in that model, with no operator
pushed through anything. This is why the algebra is a parameter rather than always H →L[ℂ] H:
the elaborator never has to move Matrix.toEuclideanCLM across a product.
A state model: a complex Hilbert space with a state, and a ⋆-algebra represented on it
by a ⋆-homomorphism.
- H : Type u
The Hilbert space.
- normedAddCommGroup : NormedAddCommGroup self.H
- innerProductSpace : InnerProductSpace ℂ self.H
- completeSpace : CompleteSpace self.H
- ψ : self.H
The state.
The representation of the algebra.
Instances For
The calculus #
‖π T ψ‖.
Equations
- M.snorm T = MIPRE.Op.snorm M.ψ (M.π T)
Instances For
Re ⟨ψ, π T ψ⟩.
Equations
- M.qform T = MIPRE.Op.qform M.ψ (M.π T)
Instances For
‖π T v‖ ≤ K ‖v‖ for every v.
Equations
- M.Bnd T K = MIPRE.Op.Bnd (M.π T) K
Instances For
Replacing an operator by an isometry it is close to, in front of anything.
An orthogonal projection of 𝒞 is bounded by one.
Triangle inequalities for families #
The triangle inequality for a family of deviations, at the usual cost of a factor two.
The three-term triangle inequality for a family of deviations.
Column contractions #
fact:add-a-proj of the paper: a family with ∑_i F_i† F_i ≤ 1 costs nothing in front of a
deviation. The hypothesis is stated on the represented operators, where it is an inequality of
operators on H: a player's algebra need not be ordered in a way that proves it, while for the
elements of a POVM it holds in B(H) because t² ≤ t there.
∑_i π(F_i)† π(F_i) ≤ 1: the family F is a contraction as a column of operators on H.
Instances For
A column contraction costs nothing in front (fact:add-a-proj): the family contributes
its index to the sum and the operator behind it is unchanged.
An ordered algebra #
When 𝒞 is a star-ordered ring, π is monotone (a ⋆-homomorphism of star-ordered rings is),
so an inequality in 𝒞 is one between operators.
A nonnegative element is represented by a positive operator.
The quadratic form is monotone.
An element with T* T ≤ 1 is represented by a contraction.
An inequality ∑ F_i* F_i ≤ 1 in 𝒞 makes F a column contraction.
fact:add-a-proj with the hypothesis in 𝒞.
A contraction in front costs nothing.
The matrix model #
The matrix model of a vector v of ℂ^N: matrices acting on EuclideanSpace ℂ N.
Equations
- One or more equations did not get rendered due to their size.