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

Operator Norm Is Unchanged by Spectator Registers

Statement

Let S and R be nonzero finite-dimensional complex inner-product spaces with specified finite orthonormal bases, and let T:S→S be linear. With the product inner product on S⊗R,

∥T⊗IR∥=∥T∥.

If P is a unitary wire permutation on a finite ordered tensor register, then conjugating an endomorphism A by P preserves its operator norm: ∥PAP−1∥=∥A∥. Thus a one- or two-register gate has the same operator norm after identity factors are added on spectators and its wires are moved to their declared positions.

Facts & Assumptions

Given: Nonzero finite-dimensional complex inner-product spaces S,R with specified orthonormal bases, a linear endomorphism T of S, their ordered tensor register, and a unitary wire permutation P when the conjugation clause is used.

[F1]

The lexicographically ordered elementary product vectors form an orthonormal basis and their squared norms are computed by the product inner product (The product basis is orthonormal and tensor dimensions multiply).

[F2]

The tensor map T⊗IR acts on elementary tensors by s⊗r↦Ts⊗r (Tensor products of finitely many linear maps).

[F3]

The operator norm is 0 on a zero-dimensional domain; on a nonzero finite-dimensional domain, ∥T∥=max⁡∥s∥=1∥Ts∥ (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F4]

Compatible products satisfy ∥AB∥≤∥A∥∥B∥ (The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2).

[F5]

A wire permutation is unitary and therefore preserves vector norms (Finite wire permutations are unitary basis permutations).

Proof

technique · direct

Given: The spaces, map and register above.

1.1givenF1F2F3algebra

Write the specified orthonormal bases as f0,…,fa−1 for S and e0,…,ed−1 for R; a,d≥1. By [F1], fk⊗ej form an orthonormal basis of S⊗R. Expand v=∑k<a,j<dckjfk⊗ej and set vj=∑k<ackjfk. Grouping this finite sum gives v=∑j<dvj⊗ej, while orthonormality gives ∥v∥2=∑j<d∥vj∥2. By [F2], (T⊗IR)v=∑j<dTvj⊗ej. Hence [F3] gives ∥(T⊗IR)v∥2=∑j<d∥Tvj∥2≤∥T∥2∑j<d∥vj∥2=∥T∥2∥v∥2, so ∥T⊗IR∥≤∥T∥.

2.1givenF1F2F3step 1.1choosealgebra

Choose a unit vector s∈S attaining the maximum in [F3], and choose a unit vector e∈R. The product inner product gives ∥s⊗e∥=1, and [F2] gives ∥(T⊗IR)(s⊗e)∥=∥Ts∥=∥T∥. Thus ∥T⊗IR∥≥∥T∥, proving the first equality.

3.1givenF3F4F5algebra∎

If the tensor register is zero-dimensional, both A and PAP−1 have operator norm 0 by [F3], proving the conjugation equality. Otherwise [F5] shows that P and P−1 preserve norms, so each has operator norm 1 by [F3]. Submultiplicativity [F4] gives ∥PAP−1∥≤∥A∥. Applying the same inequality to A=P−1(PAP−1)P gives the reverse inequality. Therefore ∥PAP−1∥=∥A∥ in every case.

Depends on

Used by

Dependency tree · two levels

21 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