Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Type-A path spaces and their matrix-unit tower

Definition

Let ℓ≥3. The path graph Aℓ−1 has vertex set {0,1,…,ℓ−2} and an edge between a and b exactly when ∣a−b∣=1. For n≥0 and a vertex a, let Pn,a be the set of sequences

p=(a0,a1,…,an)

with a0=0, an=a, each aj∈{0,1,…,ℓ−2}, and ∣aj−aj−1∣=1 for 1≤j≤n. The set is finite; it may be empty. Let Vn,a:=C(Pn,a) be the free complex vector space with basis {∣p⟩:p∈Pn,a}, and put

Kn:=⨁a=0ℓ−2End⁡C(Vn,a),

omitting zero summands. For p,q∈Pn,a, the matrix unit Ep,q(n,a) sends ∣q⟩ to ∣p⟩, sends every other path basis vector to zero, and is zero on every endpoint block other than a.

Equip each Vn,a with the Hermitian inner product for which its path basis is orthonormal, and equip each endomorphism algebra with the corresponding adjoint. Thus (Ep,q(n,a))∗=Eq,p(n,a), and Kn has the componentwise involution.

For b∼a, write pb=(a0,…,an,b) for the path obtained by appending b. Define the unital algebra map candidate ιn:Kn→Kn+1 on matrix units by

ιn(Ep,q(n,a))=∑b∼aEpb,qb(n+1,b),

and extend it linearly. The next local theorem proves that these assignments are injective unital ∗-homomorphisms and gives the corresponding branching rule. This is an abstract path-space tower definition; it does not assert that a particular quotient of a Temperley–Lieb algebra is isomorphic to Kn.

Remarks

When n=0, the sole path is (0) and K0≅C. The vertex bounds are part of the definition, so a path attempting to step below 0 or above ℓ−2 is absent rather than assigned a zero multiplicity by convention.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources