Physlib

PhyslibAlpha.ProbabilisticTheory.Channel.Operation

Operations

i. Overview

An operation is a positive linear map `op` with `op 1 ≤ 1`. It describes how a system changes when one particular outcome of a measurement occurs, and it may lose probability, but never gain any. A channel is an operation with `op 1 = 1`, and a finite family of operations whose values on `1` sum to `1` is an instrument.

ii. Key results

  • `Operation` : operations.
  • `Operation.comp` : composition of operations.
  • `Operation.outcomeEffect` : the effect `op 1` of the outcome.
  • `Operation.condition` : the state after the outcome, normalized.

iii. Table of contents

  • A. Operations
  • B. Outcome effects

A. Operations

B. Outcome effects

21 declarations

definition

Operation Φ\Phi on an order unit space EE with Φ(1)≤1\Phi(1) \le 1

Given an order unit space EE with an order unit denoted by 11, an operation is defined as a positive linear map Φ:E→E\Phi: E \to E such that Φ(1)≤1\Phi(1) \le 1. This condition ensures that the map never sends the certain event 11 to an element greater than itself, representing a process that may lose probability but never gain it.

instance

Coercion of an operation to a function E→EE \to E

For an order unit space EE, an operation Φ∈Operation(E)\Phi \in \text{Operation}(E) can be treated as a function Φ:E→E\Phi : E \to E. This allows the application of an operation Φ\Phi to an element x∈Ex \in E, denoted as Φ(x)\Phi(x), corresponding to its underlying positive linear map.

theorem

op1=op2op_1 = op_2 if op1(x)=op2(x)op_1(x) = op_2(x) for all xx

Let EE be an order unit space. For any two operations op1op_1 and op2op_2 on EE, if op1(x)=op2(x)op_1(x) = op_2(x) for all x∈Ex \in E, then op1=op2op_1 = op_2. An operation on EE is defined as a positive linear map Φ:E→E\Phi: E \to E such that Φ(1)≤1\Phi(1) \le 1, where 11 denotes the order unit of EE.

theorem

Operations Preserve Non-negativity

Let EE be an order unit space. For any operation Φ\Phi on EE and any element x∈Ex \in E, if x≥0x \ge 0, then Φ(x)≥0\Phi(x) \ge 0. In other words, an operation never sends a non-negative element to a negative one.

theorem

Φ(1)≤1\Phi(1) \le 1 for any operation Φ\Phi

Let EE be an order unit space with order unit 11. For any operation Φ\Phi on EE, the image of the certain event 11 under Φ\Phi is less than or equal to 11, i.e., Φ(1)≤1\Phi(1) \le 1. This implies that an operation never sends the certain event above itself.

abbrev

op\text{op} is normal

Let EE be an ordered real vector space with a unit 11. An operation op:E→E\text{op} : E \to E is **normal** if it is order-continuous, meaning that for any directed set {xi}\{x_i\} in EE that has a supremum xx, the supremum of the set {op(xi)}\{\text{op}(x_i)\} is op(x)\text{op}(x).

definition

Identity operation on EE

For an ordered real vector space EE with a unit element 11, the identity operation idE\text{id}_E is the identity map from EE to itself, defined by idE(x)=x\text{id}_E(x) = x for all x∈Ex \in E. This map qualifies as an operation because it is a positive linear endomorphism and satisfies the condition idE(1)≤1\text{id}_E(1) \le 1 (specifically, idE(1)=1\text{id}_E(1) = 1).

theorem

id(x)=x\text{id}(x) = x

Let EE be an ordered real vector space with a unit 11. For any element x∈Ex \in E, the identity operation id\text{id} satisfies id(x)=x\text{id}(x) = x.

theorem

The Identity Operation is Normal

Let EE be an order unit space. The identity operation idE:E→E\text{id}_E: E \to E is normal.

definition

Sequential composition of operations ψ∘ϕ\psi \circ \phi

Let EE be an order unit space with order unit 11. Given two operations ϕ,ψ:E→E\phi, \psi: E \to E (positive linear maps satisfying ϕ(1)≤1\phi(1) \le 1 and ψ(1)≤1\psi(1) \le 1), their sequential composition ψ∘ϕ\psi \circ \phi is the operation defined by (ψ∘ϕ)(x)=ψ(ϕ(x))(\psi \circ \phi)(x) = \psi(\phi(x)) for all x∈Ex \in E. This composition is itself an operation because the positivity of ψ\psi implies it is monotone, which ensures the subunital condition (ψ∘ϕ)(1)=ψ(ϕ(1))≤ψ(1)≤1(\psi \circ \phi)(1) = \psi(\phi(1)) \le \psi(1) \le 1 is satisfied.

theorem

(ψ∘ϕ)(x)=ψ(ϕ(x))(\psi \circ \phi)(x) = \psi(\phi(x))

Let EE be an order unit space. For any operations ψ\psi and ϕ\phi on EE and any element x∈Ex \in E, the application of the sequential composition ψ∘ϕ\psi \circ \phi to xx is equal to ψ(ϕ(x))\psi(\phi(x)).

theorem

id∘ϕ=ϕ\text{id} \circ \phi = \phi for operations ϕ\phi

Let EE be an order unit space. For any operation ϕ\phi on EE (defined as a positive linear map ϕ:E→E\phi: E \to E such that ϕ(1)≤1\phi(1) \le 1), the sequential composition of the identity operation id\text{id} with ϕ\phi is equal to ϕ\phi. That is, id∘ϕ=ϕ\text{id} \circ \phi = \phi.

theorem

Right identity of operation composition (ϕ∘id=ϕ\phi \circ \text{id} = \phi)

Let EE be an order unit space. For any operation ϕ:E→E\phi : E \to E (a positive linear map satisfying ϕ(1)≤1\phi(1) \le 1), the composition of ϕ\phi with the identity operation id\text{id} is equal to ϕ\phi itself, denoted as ϕ∘id=ϕ\phi \circ \text{id} = \phi.

theorem

Associativity of the Composition of Operations: (χ∘ψ)∘ϕ=χ∘(ψ∘ϕ)(\chi \circ \psi) \circ \phi = \chi \circ (\psi \circ \phi)

Let EE be an order unit space. For any operations ϕ,ψ,χ\phi, \psi, \chi on EE, the sequential composition of these operations is associative, such that (χ∘ψ)∘ϕ=χ∘(ψ∘ϕ)(\chi \circ \psi) \circ \phi = \chi \circ (\psi \circ \phi). Here, an operation is defined as a positive linear map Φ:E→E\Phi: E \to E satisfying Φ(1)≤1\Phi(1) \le 1.

theorem

The sequential composition of normal operations is normal

Let EE be an order unit space with order unit 11. Let ϕ\phi and ψ\psi be operations on EE (positive linear maps such that ϕ(1)≤1\phi(1) \le 1 and ψ(1)≤1\psi(1) \le 1). If ϕ\phi and ψ\psi are normal maps, then their sequential composition ψ∘ϕ\psi \circ \phi is also a normal operation.

definition

Post-measurement state ω∘Φω(Φ(1))\frac{\omega \circ \Phi}{\omega(\Phi(1))}

Given an operation Φ\Phi on an order unit space EE and a state ω\omega on EE, provided that the probability of the outcome occurring is non-zero (i.e., ω(Φ(1))>0\omega(\Phi(1)) > 0), the post-measurement state (or conditioned state) is defined as the normalized functional ω′\omega' such that for any x∈Ex \in E: ω′(x)=ω(Φ(x))ω(Φ(1))\omega'(x) = \frac{\omega(\Phi(x))}{\omega(\Phi(1))} This construction represents the updated state of a system after an operation Φ\Phi has been performed and a specific outcome has been observed.

theorem

Pointwise formula for the post-measurement state ω′(x)=ω(Φ(x))ω(Φ(1))\omega'(x) = \frac{\omega(\Phi(x))}{\omega(\Phi(1))}

Let EE be an order unit space, Φ\Phi be an operation on EE, and ω\omega be a state on EE. If the probability of the outcome occurring is strictly positive, i.e., ω(Φ(1))>0\omega(\Phi(1)) > 0, then for any x∈Ex \in E, the post-measurement state ω′\omega' (the result of conditioning ω\omega by Φ\Phi) is given by the pointwise formula: ω′(x)=ω(Φ(x))ω(Φ(1))\omega'(x) = \frac{\omega(\Phi(x))}{\omega(\Phi(1))}

theorem

The post-measurement state satisfies ω′(1)=1\omega'(1) = 1

Let EE be an order unit space with order unit 11. For any operation Φ\Phi on EE and any state ω\omega on EE such that the probability of the outcome is strictly positive (i.e., ω(Φ(1))>0\omega(\Phi(1)) > 0), the post-measurement state ω′\omega', defined by ω′(x)=ω(Φ(x))ω(Φ(1))\omega'(x) = \frac{\omega(\Phi(x))}{\omega(\Phi(1))}, satisfies ω′(1)=1\omega'(1) = 1

theorem

Conditioning a normal state by a normal operation preserves normality

Let EE be an order unit space. Let Φ:E→E\Phi: E \to E be an operation and ω\omega be a state on EE. If both the operation Φ\Phi and the state ω\omega are normal (meaning they preserve the suprema of directed sets) and the probability of the outcome is strictly positive, i.e., ω(Φ(1))>0\omega(\Phi(1)) > 0, then the conditioned state ω′\omega', defined by ω′(x)=ω(Φ(x))ω(Φ(1))\omega'(x) = \frac{\omega(\Phi(x))}{\omega(\Phi(1))} for all x∈Ex \in E, is also normal.

definition

Outcome effect Φ(1)\Phi(1) of an operation Φ\Phi

For an operation Φ\Phi on an order unit space EE, the outcome effect is defined as the image of the certain event 11 under the map Φ\Phi, denoted as Φ(1)\Phi(1). Since Φ\Phi is a positive linear map satisfying Φ(1)≤1\Phi(1) \le 1, the resulting value Φ(1)\Phi(1) is an effect in EE. This represents the probability of the operation "firing" in a given state.

theorem

The outcome effect of an operation Φ\Phi is Φ(1)\Phi(1)

For any operation Φ\Phi on an order unit space EE with order unit 11, the outcome effect of Φ\Phi viewed as an element of EE is equal to Φ(1)\Phi(1).