Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

The A_(ell-1) path-space tower branches by adjacent vertices

Statement

Let ℓ≥3 and use the path sets, endpoint modules, matrix units, and maps ιn of Type-A path spaces and their matrix-unit tower. Then each ιn:Kn→Kn+1 is a unital injective ∗-algebra homomorphism. For every endpoint b, the restriction of the natural Kn+1-module Vn+1,b to Kn is

Vn+1,b ⁣↓Kn≅⨁0≤a≤ℓ−2∣a−b∣=1Vn,a,

with each summand occurring once; vertices outside {0,…,ℓ−2} contribute no summand.

Facts & Assumptions

Given: ℓ≥3, the finite graph Aℓ−1, its length-n path sets, and the matrix units and tower maps of Type-A path spaces and their matrix-unit tower.

[F1]

Pn,a consists of the vertex sequences (a0,…,an) starting at 0, ending at a, and changing by one along every edge; Kn is the direct sum of the endpoint matrix algebras, with units Ep,q(n,a). (Type-A path spaces and their matrix-unit tower)

[F2]

The tower map is ιn(Ep,q(n,a))=∑b∼aEpb,qb(n+1,b). (Type-A path spaces and their matrix-unit tower)

Proof

Given: The data of [F1]–[F2].

1.1F1construct

For any path (a0,…,an,b) ending at b, its penultimate vertex a is uniquely determined and satisfies a∼b; deleting b gives a unique prefix in Pn,a. Conversely appending b to any path in Pn,a with a∼b gives a path ending at b. Hence the set of paths ending at b is the disjoint union of the appended path sets {pb:p∈Pn,a} over all such a. The basis vectors therefore split as the asserted direct sum, and Ep,q(n,a) acts on each appended block as the same matrix unit while acting by zero on the other predecessor blocks.

1.2F1F2algebra

Take matrix units X=Ep,q(n,a) and Y=Er,s(n,c). If a≠c, then XY=0; in the product ιn(X)ιn(Y) a nonzero matrix-unit product would require the middle path qb to equal rd for some b∼a and d∼c, forcing both q=r as length-n paths and a=c, a contradiction. Thus the images multiply to zero.

2.1F1F2step 1.2algebra

If a=c, then XY=1q=rEp,s(n,a). On multiplying the two sums in [F2], the only nonzero terms have the same appended vertex b and equal middle path qb=rb, which is equivalent to q=r. The product is consequently 1q=r∑b∼aEpb,sb(n+1,b)=ιn(XY). Adjoints are preserved because ιn((Ep,q(n,a))∗)=∑b∼aEqb,pb(n+1,b)=ιn(Ep,q(n,a))∗. Bilinearity proves multiplicativity and ∗-preservation on all of Kn.

3.1F1F2step 1.1step 2.1construct∎

The identity of Kn is ∑a,pEp,p(n,a). Its image is the sum of the diagonal units indexed by every one-step extension pb of every length-n path p; by step 1.1 each length-(n+1) path occurs exactly once. This is the identity of Kn+1. For injectivity, every vertex a has at least one neighbor in Aℓ−1, since ℓ≥3. For each source unit Ep,q(n,a) choose one neighbor b; the coordinate Epb,qb(n+1,b) in its image determines the source unit uniquely by deleting the last vertex. Distinct source units therefore have disjoint image coordinates, so no nonzero linear combination maps to zero. Hence ιn is a unital injective ∗-homomorphism and step 1.1 gives the multiplicity-one branching rule.

Remarks

This proves the branching of the abstract path-space tower. Identifying a particular positive-root Temperley–Lieb quotient and its Jones–Wenzl matrix units with this tower is a separate supplier check recorded in the batch evidence.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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