Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 quantum mutual, conditional, and conditional mutual information

Definition

For a finite bipartite state ρAB on the ordered product HA⊗HB, write ρA=Tr⁡BρAB and ρB=Tr⁡AρAB, using the partial traces in Partial trace over a finite tensor factor and Partial trace over the first tensor factor. They are states by Partial traces of a finite bipartite state are states. Define

S(A)ρ:=S(ρA),S(A∣B)ρ:=S(ρAB)−S(ρB),I(A:B)ρ:=S(ρA)+S(ρB)−S(ρAB).

For a finite tripartite state ρABC on the ordered product HA⊗HB⊗HC, set ρAB:=Tr⁡HCρABC after identifying the factors as (HA⊗HB)⊗HC, and ρBC:=Tr⁡HAρABC after identifying them as HA⊗(HB⊗HC). Let P:HA⊗HB⊗HC→HA⊗HC⊗HB be the wire permutation taking factor order A,B,C to A,C,B (Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations) whose unique adjoint P∗ exists by Every linear map between finite-dimensional inner product spaces has a unique adjoint, and set ρAC:=Tr⁡HB(PρABCP∗), tracing out the last factor. Because P is unitary, PρABCP∗ is a state: unitary conjugation preserves non-negativity by the adjoint identity (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Non-negative and positive operators) and preserves trace by cyclicity (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)). Finally set ρC:=Tr⁡HBρBC. All these marginals are density operators by applying Partial traces of a finite bipartite state are states after grouping factors. Define

I(A:B∣C)ρ:=S(ρAC)+S(ρBC)−S(ρC)−S(ρABC).

These are finite-dimensional definitions only; no non-negativity of conditional entropy or conditional mutual information is part of the notation.

Depends on

Used by

Dependency tree · two levels

43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources