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

All measurements may be moved to terminal readout

Statement

Let a finite measurement history tree be as defined in Finite measurement branches and classical control, with a finite terminal POVM (Fzh)z∈Z for a common finite nonempty outcome set Z at each leaf h. A complete history is the ordered list of observed labels along a root-to-leaf path. For every density operator at the root, the joint law of the complete history h and the leaf's terminal outcome z is unchanged when all node instruments are coherently deferred to terminal readout, with each recorded history controlling its declared later operations. More strongly, for every finite-dimensional reference R and every operator X on the root data and R, the unnormalized data-reference branch operator at each complete history h is the same in the measured and coherently deferred constructions. Any history-controlled dilation or block operation used in that construction must be explicitly supplied and charged by the operation model.

Facts & Assumptions

Given: A finite measurement tree, its finite instruments and branch-controlled gates, an input state (possibly entangled with a finite reference), and a designated final POVM.

[F1]

Finite measurement branches and classical control: a finite history tree has finitely many observed outcomes at each internal node, branch maps X↦Sh,aIah(X)Sh,a†, and orthogonal records contain only observed labels.

[F2]

Finite instruments can be coherently deferred: for one finite instrument stage and any finite reference, the coherent construction preserves each data-reference branch operator and retains the observed outcome in its own orthogonal label register after the hidden Kraus and padding registers are discarded.

[F3]

The outcome law and outputs of a measured circuit: a branch weight is the trace of its unnormalized instrument output, and a conditional state is formed only for a positive weight.

[F4]

Finite POVMs and their outcome law: a finite POVM assigns outcome weight tr⁡(ρFz) to density operator ρ.

[F5]

The principle of mathematical induction: a statement true at zero stages and preserved by adding one stage holds for every finite number of stages.

Proof

1.1givenF1F4base

Give a finite history tree height 0 when its root is a leaf; otherwise give it height one plus the maximum height of its finitely many child subtrees. For height 0, there is a single empty history, no instrument is applied, and the leaf's terminal POVM is unchanged. Thus the branch-operator invariant holds at height 0.

1.2givenF1F2ih

Let the root be internal and suppose the invariant holds for all trees of height at most k. For each root outcome a, [F2] replaces the root instrument and its edge unitary Sh,a by a coherent record with the same unnormalized operator Ya on the child input and the reference, for every input operator X, while retaining a separate orthogonal label register ea. The outcome set is finite by [F1].

2.1step 1.2F1F2ihalgebra

Each child subtree has height at most k, so apply the induction hypothesis to its input operator Ya with the already retained history labels included in the finite reference. The operator need not be normalized or positive because the invariant is stated for every operator. The child constructions are controlled on the root's observed record; distinct labels occupy orthogonal record subspaces by [F1]–[F2], so the continuations preserve each full-history branch separately and do not merge histories.

3.1step 1.1step 2.1F5discharge-induction

By finite induction [F5] from step 1.1 and the preservation argument in step 2.1, every finite history tree has equal measured and coherently deferred unnormalized branch operators for each complete history and every finite reference.

4.1step 3.1F3F4algebradischarge-induction: step 3.1∎

For a leaf history h and terminal outcome z, apply the same effect Fzh⊗IR to the equal branch operators from step 3.1 and take traces. This gives equal joint probabilities. The preterminal data-reference outputs conditioned on history h agree after dividing their equal branch operators by the common positive history probability; zero-probability branches are never normalized by [F3]. Equality of the operators for arbitrary R preserves reference correlations. Any required dilation and block controls remain explicit operation-model costs as stated.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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