Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Braided line representation data

Definition

Let k be a field and let C be a locally finite k-linear abelian rigid monoidal category whose tensor product is k-bilinear. For each object Y write End⁡C(Y):=Hom⁡C(Y,Y). The tensor unit 1 is assumed to satisfy End⁡C(1)≅k as k-algebras. Here rigid means every object has left and right duals with evaluation and coevaluation maps satisfying the two snake identities. Equip C with a braiding cY,Z:Y⊗Z→Z⊗Y, natural in Y,Z, satisfying the two hexagon identities with the associator α. Fix X∈C, put P0(X)=1, P1(X)=X, and recursively put Pm+1(X)=Pm(X)⊗X.

For any object Y, let Aut⁡C(Y) be the group under composition of those g∈End⁡C(Y) for which some h∈End⁡C(Y) satisfies g∘h=h∘g=id⁡Y.

For each n≥2 and 1≤i<n, let Qn,i(X) be the parenthesized product (Pi−1(X)⊗(X⊗X))⊗Pn−i−1(X), with the unit factors at either end removed by the fixed unitors when an exponent is zero. Choose a canonical rebracketing isomorphism ρn,i:Pn(X)→Qn,i(X) made from associators, unitors, and their inverses, without permuting the ordered tensor factors. Define

BiX:=ρn,i−1∘(id⁡Pi−1(X)⊗cX,X⊗id⁡Pn−i−1(X))∘ρn,i∈End⁡C(Pn(X)).

The family BiX is independent of the chosen canonical rebracketing path and determines a homomorphism ϱn:Bn→Aut⁡C(Pn(X)), where Bn is the braid group with positive generator σi sent to BiX. These are exact algebraic morphisms.

Physical interpretation boundary. A physical adiabatic-exchange interpretation needs additional model data; the categorical data below supply none of the analytic or physical data. Here H is a complete complex inner-product space, with inner product linear in its first variable. For each dimensionless s∈[0,1], let K(s):D⊆H→H be self-adjoint on a specified common dense domain D. For a densely defined operator K, its adjoint K∗ is defined by y∈D(K∗) exactly when some z∈H satisfies ⟨Kx,y⟩=⟨x,z⟩ for every x∈D(K), with K∗y=z; self-adjoint means D(K∗)=D and K∗x=Kx there. The spectrum σ(K) is the set of λ∈C for which K−λI has no bounded, everywhere-defined inverse.

For each s, supply a projection-valued measure Es on the Borel subsets of R: each Es(A) is an orthogonal projection, Es(R)=I, and for pairwise disjoint Borel sets Aj, Es(⋃jAj)x=∑jEs(Aj)x with norm convergence for every x∈H. Require Es to represent K(s) as its spectral integral: with μs,x(A):=⟨Es(A)x,x⟩, the domain is D={x∈H:∫Rλ2 dμs,x(λ)<∞} and K(s)x=∫Rλ dEs(λ)x there. For a Borel set Ω⊆R, define its spectral projection by P(s):=Es(Ω). Require ran⁡P(s) to be finite-dimensional and dist⁡(Ω,σ(K(s))∖Ω)≥γ>0 uniformly in s, where dist⁡(A,B):=inf⁡{∣a−b∣:a∈A, b∈B} and inf⁡∅:=+∞.

Require s↦P(s) to be continuously differentiable in operator norm. Its ranges then form a finite-rank Hermitian vector bundle E→[0,1], meaning the locally trivial bundle with fiber Es:=ran⁡P(s) and the inner product inherited from H. A Hermitian connection on E is a complex-linear covariant derivative ∇s on continuously differentiable sections satisfying ∇s(fψ)=f′ψ+f∇sψ and ∂s⟨ψ,ϕ⟩=⟨∇sψ,ϕ⟩+⟨ψ,∇sϕ⟩. Its parallel transport W(s,0):E0→Es is the map obtained by solving ∇sψ(s)=0 along the interval.

Supply a family of unitary operators Uε(s,0):H→H, where unitary means surjective and inner-product-preserving, with Uε(0,0)=I and Uε(s,0)D⊆D. Require for each x∈D that s↦Uε(s,0)x is differentiable in Hilbert norm and satisfies iε∂sUε(s,0)x=K(s)Uε(s,0)x; all conditions ensuring this propagator exists are part of the model data. Here ε>0 is an energy scale and the slow-evolution regime means ε↓0. A linear operator A on H is bounded when sup⁡∥x∥≤1∥Ax∥<∞; this supremum is its operator norm ∥A∥op. The added data must include a bound r(ε)→0 such that

sup⁡s∈[0,1]∥Uε(s,0)P(0)−ιsW(s,0)P(0)∥op≤r(ε),

where ιs:Es↪H is inclusion. In a physical realization, K(s), γ, and ε have the model's energy units; no numerical values are fixed here. The categorical data do not assert an experimental realization.

Diagrammatic convention

The first diagram is a composition diagram: arrows run from source to target, and the outer path is the definition BiX=ρn,i−1Ciρn,i, where Ci is the local tensor of cX,X with spectator identities. The label ρn,i(α) means a finite composite of associators and unitors. In the second diagram time/order points upward; the positive crossing is, by definition, cX,X, with the right input strand passing over the left. Both drawings omit spectator strands. They record conventions only; the proof uses morphism composition and coherence, not the diagrams.

Pn(X)Qn;i(X)Qn;i(X)Pn(X)½n;i(®)BXiCi½n;i(®)¡1
diagram failed to render:
\begin{tikzpicture}[baseline=(current bounding box.center),>=stealth,thick]
  \draw (0,0) .. controls (0,1.1) and (1.4,1.9) .. (1.4,3);
  \draw[white,line width=5pt] (1.4,0) .. controls (1.4,1.1) and (0,1.9) .. (0,3);
  \draw (1.4,0) .. controls (1.4,1.1) and (0,1.9) .. (0,3);
  \node at (0, -0.35) {$X$}; \node at (1.4, -0.35) {$X$};
  \node at (0, 3.3) {$X$}; \node at (1.4, 3.3) {$X$};
  \node at (0.7,1.5) {$c_{X,X}$};
  \draw[->] (2.1,0.2) -- (2.1,2.8) node[midway,right] {$\text{time}$};
\end{tikzpicture}

Facts & Assumptions

Given: The category data, associator, unitors, braiding, object X, integer n≥2, and adjacent index i.

[F1]

Tensor and multitensor categories: a tensor category is a locally finite k-linear abelian rigid monoidal category, with bilinear tensor product and End⁡(1)≅k.

[F2]

Braiding: cY,Z:Y⊗Z→Z⊗Y is a natural isomorphism satisfying the two hexagon identities with the associator.

[F3]

Braided coherence is controlled by underlying braids: two formal canonical composites on X⊗n built from associators, unitors, braidings, and their inverses are equal when they have the same underlying braid.

[F4]

The braid group by Artin presentation: Bn has generators σ1,…,σn−1, adjacent braid relations, and far commutation relations.

[F5]

Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group: a generator assignment satisfying all relators of a presented group extends uniquely to a group homomorphism.

[F6]

Finite double and its canonical quasitriangular structure: for finite-dimensional H with bijective antipode, the fixed order is D(H)=H∗op⊗H; the canonical R satisfies RΔD(d)=ΔDop(d)R, and τ∘R is the left-module Yetter–Drinfeld braiding in the stated convention.

Proof

1.1F1F2F3givenconstruct

By the canonical rebracketing property in [F3], there is a canonical isomorphism ρn,i:Pn(X)→Qn,i(X) built from the associators and unitors; every factor is invertible, so the composite is invertible. The map id⁡⊗cX,X⊗id⁡ is an endomorphism of Qn,i(X), because cX,X is an isomorphism from X⊗X to the same ordered object X⊗X. Conjugating gives the displayed endomorphism BiX of Pn(X).

2.1F3step 1.1algebra

If ρn,i and ρn,i′ are two such canonical rebracketings, then ρn,i′ρn,i−1 has trivial underlying braid. Inserting the same local cX,X gives formal composites with underlying braid σi; [F3] makes the resulting endomorphisms equal. Thus BiX is independent of the rebracketing path.

3.1F3F4step 2.1algebra

The two composites BiXBi+1XBiX and Bi+1XBiXBi+1X have underlying braid words σiσi+1σi and σi+1σiσi+1, equal in Bn; operators with ∣i−j∣>1 have the equal underlying words σiσj=σjσi. By [F3] the corresponding morphisms are equal.

4.1F2F4F5step 1.1step 3.1construct

Each BiX is invertible by step 1.1 and [F2]. The relations in step 3.1 therefore satisfy the Artin presentation [F4], and [F5] gives the unique homomorphism ϱn:Bn→Aut⁡C(Pn(X)) with ϱn(σi)=BiX.

5.1F6given∎

In the Hopf-module convention, the coproduct supplies the tensor-product module action, while [F6]'s intertwining identity RΔD(d)=ΔDop(d)R makes τ∘R the exchange braiding; [F6] fixes the factor order H∗op⊗H. This supplies the category braiding only when the relevant module objects and category structure are supplied. No semisimplicity, unitarity, modularity, or physical realization follows from [F6] alone.

Remarks

The finite-double result is used only at its inspected interface. The definition does not assert that an arbitrary quasitriangular Hopf algebra is semisimple or unitary, that it defines a modular tensor category, or that its modules are realized by an experiment.

Depends on

Dependency tree · 2 levels

Sources