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 and use the path sets, endpoint modules, matrix units, and maps of Type-A path spaces and their matrix-unit tower. Then each is a unital injective -algebra homomorphism. For every endpoint , the restriction of the natural -module to is
with each summand occurring once; vertices outside contribute no summand.
Facts & Assumptions
Given: , the finite graph , its length- path sets, and the matrix units and tower maps of Type-A path spaces and their matrix-unit tower.
consists of the vertex sequences starting at , ending at , and changing by one along every edge; is the direct sum of the endpoint matrix algebras, with units . (Type-A path spaces and their matrix-unit tower)
The tower map is . (Type-A path spaces and their matrix-unit tower)
Proof
Given: The data of [F1]–[F2].
For any path ending at , its penultimate vertex is uniquely determined and satisfies ; deleting gives a unique prefix in . Conversely appending to any path in with gives a path ending at . Hence the set of paths ending at is the disjoint union of the appended path sets over all such . The basis vectors therefore split as the asserted direct sum, and acts on each appended block as the same matrix unit while acting by zero on the other predecessor blocks.
Take matrix units and . If , then ; in the product a nonzero matrix-unit product would require the middle path to equal for some and , forcing both as length- paths and , a contradiction. Thus the images multiply to zero.
If , then . On multiplying the two sums in [F2], the only nonzero terms have the same appended vertex and equal middle path , which is equivalent to . The product is consequently . Adjoints are preserved because . Bilinearity proves multiplicativity and -preservation on all of .
The identity of is . Its image is the sum of the diagonal units indexed by every one-step extension of every length- path ; by step 1.1 each length- path occurs exactly once. This is the identity of . For injectivity, every vertex has at least one neighbor in , since . For each source unit choose one neighbor ; the coordinate 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 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
- David Penneys, Exercises in Quantum Algebra (standard reference, not scraped)