Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

A Controlled Global Phase Becomes a Relative Control Phase

Statement

Let H be a nonzero finite-dimensional complex-inner-product space and U:H→H a unitary. Let θ∈R, and suppose the model separately grants controlled access to both U and eiθU. There is a normalized eigenvector ϕ with Uϕ=μϕ and ∣μ∣=1. Let C=Q2=C2 be the control qubit with ordered computational basis ∣0⟩,∣1⟩; define ∣±⟩=(∣0⟩±∣1⟩)/2 and prepare (∣0⟩+μ‾∣1⟩)/2 with target ϕ. The two joint effects are E±=∣±⟩⟨±∣⊗IH. The E+ outcome has probability 1 after C(U) and cos⁡2(θ/2) after C(eiθU). Thus the two controlled maps give different outcome laws exactly when θ∉2πZ; when θ∈2πZ, the controlled maps coincide. This is a mathematical witness; it does not assert that controlled access or the witness-state preparation is free.

Facts & Assumptions

Given: The finite-dimensional target H, a unitary U, a real θ, separate controlled access to U and eiθU, and the finite control-state measurement specified in the Statement.

[L1]

Controlled Unitary Access defines C(U) as the control-first block map diag⁡(IH,U) and treats the capability as explicit. Its carrier is present in this batch.

[L2]

Finite POVMs and their outcome law defines a finite POVM and the density-operator weight pa=tr⁡(ρEa). Its current draft definition body was read.

[L3]

Ordered tensor registers, their inner product, and wire permutations defines the ordered product pairing after an ordered orthonormal basis is specified for each factor and proves that the pairing is independent of those choices.

[L4]

Tensor products of finitely many linear maps defines the tensor-map action on elementary tensors and its unique linear extension. Its current draft proof was read.

[L5]

The computational basis is orthonormal proves the control basis ∣0⟩,∣1⟩ is orthonormal. Its current draft proof was read.

[L6]

A unit-vector outer product is a density operator proves directly that the outer product of every unit vector in a nonzero finite-dimensional space is a density operator.

[L7]

Dirac Notation Conversion defines ∣v⟩⟨w∣z=⟨z,w⟩rootv in the root linear-first convention.

[L8]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[L10]

POVM outcome weights are probabilities states that finite POVM weights of a density operator form a probability distribution. Its current draft proof was read; its density-definition dependency is present in its current frontmatter.

[L11]

Density operator: a density operator is non-negative and has trace one.

[F1]

Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary is an invertible linear norm-preserving endomorphism.

[F3]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a normal endomorphism of a finite-dimensional complex-inner-product space has an orthonormal eigenbasis.

[F4]
[F6]

Real and complex inner-product spaces and their induced length: the root pairing is linear in its first argument and conjugate-linear in its second.

[F8]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in an orthonormal basis.

[F9]

Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form.

[F10]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: T∗ is characterized by ⟨Tv,w⟩=⟨v,T∗w⟩.

[F11]
[F12]

Proof

1.1givenF1F2F3F6F7choosealgebra

By [F1] and [F2], U satisfies UU∗=U∗U=I, hence is normal. The complex spectral theorem [F3] gives an orthonormal eigenbasis; since H is nonzero, choose one unit eigenvector ϕ and write Uϕ=μϕ. Norm preservation and [F6], [F7] give 1=∥Uϕ∥=∣μ∣∥ϕ∥=∣μ∣, so ∣μ∣=1. This chooses one vector from a finite nonempty basis and uses no choice axiom.

1.2L2L3L4L5L8F9F10F11choosealgebra

Choose an ordered orthonormal basis of H using [L8]. Together with the control basis from [L5], it supplies the factor bases required by [L3], whose proof shows the pairing is independent of this choice. Put P±=∣±⟩⟨±∣ on the control and E±=P±⊗IH on the joint register. By the Statement, ∣±⟩=(∣0⟩±∣1⟩)/2. Using [L3] and [L5], direct inner-product calculations give ⟨+,+⟩=⟨−,−⟩=1 and ⟨+,−⟩=0; also ∣0⟩=(∣+⟩+∣−⟩)/2 and ∣1⟩=(∣+⟩−∣−⟩)/2, so these vectors form an orthonormal basis. Every v∈C⊗H is a finite sum of elementary tensors; expanding each control factor in this basis and grouping terms writes v=∣+⟩⊗h++∣−⟩⊗h−. The product pairing [L3] makes these two summands orthogonal, and the tensor-map definition [L4] gives E+v=∣+⟩⊗h+ and E−v=∣−⟩⊗h−. Hence E++E−=I and ⟨E±v,v⟩=∥h±∥2≥0. Applying the same decomposition to v,w gives ⟨E±v,w⟩=⟨v,E±w⟩; the adjoint characterization [F10] and finite-dimensional existence/uniqueness [F11] imply each effect is self-adjoint. By [F9], each effect is non-negative; together with the two-element outcome set and E++E−=I, this is a finite POVM by [L2].

2.1givenL1L3L5F6F7step 1.1algebra

Set cμ=(∣0⟩+μ‾∣1⟩)/2. By [L5], [F6], and [F7], its squared norm is 12(⟨0,0⟩+∣μ∣2⟨1,1⟩)=1; the cross terms vanish by orthogonality. Since ϕ is unit, the product pairing [L3] makes cμ⊗ϕ unit. The controlled block rule [L1] gives C(U)(cμ⊗ϕ)=∣0⟩⊗ϕ+μ‾∣1⟩⊗Uϕ2=∣+⟩⊗ϕ.

2.2givenL1L5F1F4F6F7step 1.1algebra

Put α=eiθ. By [F4], ∣α∣=1. For every v∈H, [F6] and [F7] give ∥αUv∥2=∣α∣2∥Uv∥2=∥v∥2; since α≠0 and U is invertible, αU is invertible, so it is unitary by [F1]. For cμ=(∣0⟩+μ‾∣1⟩)/2, [L5], [F6], [F7] and step 1.1 give ∥cμ∥2=1. The separately granted controlled block gives C(eiθU)(cμ⊗ϕ)=∣0⟩+eiθ∣1⟩2⊗ϕ. Its control factor has squared norm 12(1+∣eiθ∣2)=1 by [F4], [F6], and [F7]. No access to this block is inferred from a call to C(U); it is part of the explicit model assumption in the Given.

3.1L2L3L4L6L7L8L9L10L11F8step 1.2step 2.1step 2.2choosealgebra

Let ω=χ⊗ϕ be either output in steps 2.1–2.2. Both factors are unit vectors, so the product norm [L3] makes ∥ω∥=1; [L6] makes ρω=∣ω⟩⟨ω∣ a density operator by [L11]. Choose a finite orthonormal basis (ej) of C⊗H by [L8]. From [L7] and [F8], tr⁡(ρωE+)=∑j⟨E+ej,ω⟩⟨ω,ej⟩=∑j⟨ej,E+ω⟩⟨ω,ej⟩=⟨ω,E+ω⟩, where self-adjointness from step 1.2 gives the middle equality and Parseval [L9] gives the last equality. By the product pairing [L3] and tensor-map action [L4], ⟨ω,E+ω⟩=⟨χ,P+χ⟩⟨ϕ,ϕ⟩=∣⟨χ,+⟩root∣2. The finite weights normalize by [L10], so this trace value is the probability of the plus outcome.

4.1step 2.1step 2.2step 3.1F12F4algebra

For the output in step 2.1, χ=∣+⟩, so p+=1. For the output in step 2.2, χ=(∣0⟩+eiθ∣1⟩)/2. Put z=eiθ/2. By [F12], z2=eiθ and z−1=e−iθ/2; [F4] gives ∣z∣=1 and z=cos⁡(θ/2)+isin⁡(θ/2), so z−1=z‾ and z+z−1=2cos⁡(θ/2). Hence 1+eiθ=z(z+z−1)=2zcos⁡(θ/2) and p+=∣1+eiθ∣2/4=cos⁡2(θ/2).

5.1step 4.1F4F5algebra

By [F5], θ∉2πZ means z=eiθ≠1. Since ∣z∣=1, ∣1+z∣2=2+2Re⁡z<4: equality would force Re⁡z=1 and then Im⁡z=0, hence z=1. Thus the probability from step 4.1 is strictly below one, while the other is one; the two outcome laws differ.

6.1givenL1F5algebra∎

If θ∈2πZ, [F5] gives eiθ=1, so the two controlled block maps are identical by [L1]. The operators therefore produce the same state for every common input and hence the same outcome law for the specified POVM.

Depends on

Used by

Dependency tree · two levels

85 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