Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Unitary conjugation is a channel

Statement

Let H,K be nonzero finite-dimensional complex inner-product spaces and let U:H→K be a unitary map. Then Ad⁡U is a channel. For any nonzero finite-dimensional complex inner-product space L and unitary map V:K→L, Ad⁡VU=Ad⁡V∘Ad⁡U; the inverse channel to Ad⁡U is Ad⁡U†.

Facts & Assumptions

Given: The finite-dimensional spaces and unitary maps specified in the Statement.

[F1]

Unitary conjugation map: Ad⁡U(X)=UXU†, and a unitary map is a surjective linear isometry satisfying U†U=IH and UU†=IK.

[F2]

A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.

[F3]

Trace preservation is Kraus normalization: a Kraus map is trace-preserving exactly when its adjoint-square sum is the input identity.

[F4]

Finite-dimensional quantum channel: a channel is completely positive and trace-preserving on all input operators.

Proof

1.1givenF1F2F3F4

The single-operator family (U) is a Kraus representation of Ad⁡U by [F1]. Hence the map is completely positive by [F2]; its adjoint-square sum is U†U=IH by [F1], so it is trace-preserving by [F3]. It is a channel by [F4].

2.1givenF1F5step 1.1algebra∎

The composite VU is surjective and norm-preserving because both U and V are; hence VU is a unitary map by [F1]. For every X∈L(H), [F1] and [F5] give Ad⁡V(Ad⁡U(X))=V(UXU†)V†=(VU)X(U†V†)=(VU)X(VU)†. Thus Ad⁡VU=Ad⁡V∘Ad⁡U. Also U† is a unitary map: for y=Ux, [F1] gives U†y=x, so U† preserves norms, and it is onto because U†(Ux)=x. Applying the composition identity to U and U† in both orders shows that Ad⁡U† is a two-sided inverse. It is a channel by step 1.1 applied to U†.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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