Alphabeta Math
DefinitionDefinition: 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.

Projective braid gate and operator metric

Definition

Let V≠0 be a finite-dimensional complex inner-product space and let U(V) be its unitary group. Two unitaries are projectively equivalent when A=zB for some z∈C with ∣z∣=1; write [A]∈PU(V) for the equivalence class. Define dP([A],[B]):=min⁡∣z∣=1∥A−zB∥op. This is the distance after quotienting by one common scalar phase. The phase is minimized over the unit circle; it is not chosen independently in different charge blocks.

For the fixed-charge braid representation ρc in Braid action on a fixed-charge fusion space, the projective braid gate of a braid b∈Bn is [ρc(b)]∈PU(V(xn→c)).

Facts & Assumptions

Given: The finite-dimensional unitary group U(V) and the operator norm.

[F1]

The operator norm is the maximum of ∥Tx∥ over unit vectors. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||

[F3]

The multiplicative unit circle is compact and metrizable. The multiplicative unit circle is a compact metrizable topological abelian group

[F4]

A continuous real-valued function on a nonempty compact metric space attains its minimum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

[F5]

Under the hypotheses of the braid-action definition, its generator assignment extends to a well-defined unitary homomorphism ρc:Bn→U(V(xn→c)). Unitary Artin braid representation on fixed-charge fusion spaces

Proof

1.1F1F2algebra

The operator norm satisfies the triangle inequality: for every unit vector x, ∥(S+T)x∥≤∥Sx∥+∥Tx∥≤∥S∥op+∥T∥op, so taking the maximum gives ∥S+T∥op≤∥S∥op+∥T∥op. Scalar homogeneity follows from [F2] and the same maximum definition. Thus ∣∥S∥op−∥T∥op∣≤∥S−T∥op by applying the triangle inequality twice.

1.2givenF1algebra

The formula is independent of representatives. If A′=uA and B′=vB with ∣u∣=∣v∣=1, then inf⁡∣z∣=1∥A′−zB′∥=inf⁡∣z∣=1∥A−(u−1zv)B∥; as z runs over the unit circle, so does u−1zv.

2.1F1F2F3F4step 1.1algebra

The map z↦∥A−zB∥op is continuous: step 1.1 bounds ∣∥A−zB∥−∥A−wB∥∣≤∥(z−w)B∥=∣z−w∣∥B∥. By [F3] and [F4] it attains its minimum on the unit circle, so the infimum in the definition is a minimum. Nonnegativity and symmetry follow from the norm axioms and the substitution z↦zˉ.

3.1F1F2F3F4step 1.1step 1.2step 2.1algebra

For classes [A],[B],[C], choose minimizing phases z,w for the pairs (A,B) and (B,C) by [F3]–[F4]. The triangle inequality gives ∥A−zwC∥≤∥A−zB∥+∥zB−zwC∥=dP([A],[B])+dP([B],[C]), so taking the minimum over phases for (A,C) proves the triangle inequality. If dP([A],[B])=0, a minimizing phase satisfies A=zB, so [A]=[B]. Conversely equal classes have distance zero. Therefore dP is a metric on PU(V).

4.1F5step 3.1∎

By [F5], two words representing the same braid b give the same unitary ρc(b). Its projective class is therefore well defined, and step 3.1 supplies the metric on these classes.

Depends on

Used by

Dependency tree · two levels

72 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