Directed H-Toeplitz Graphs in Operator Algebras
- Directed H-Toeplitz Graphs are a family of related constructions arising from Fock space operator matrices that encode both Toeplitz and Hankel behaviors.
- They are characterized by graphical patterns such as diagonal bands and anti-diagonals, interpreted via relative Toeplitz graph algebras and hereditary data.
- Their study unifies operator theory, C*-algebra pullbacks, and generalized gauge actions to reveal deeper insights into graph structure and spectral reconstruction.
Directed H-Toeplitz graphs sit at the intersection of operator theory, directed graph -algebras, and categorical graph constructions. In current literature the phrase is not uniform: it is introduced explicitly for digraphs extracted from the matrix of an -Toeplitz operator on Fock space, while other papers state that the term does not appear explicitly in their text and instead interpret it through relative Toeplitz graph algebras, hereditary data, or generalized gauge actions by a compact abelian group . This suggests that “Directed H-Toeplitz Graphs” is best understood as a family of related constructions rather than a single standardized definition (Singh et al., 9 Jul 2025, Brooker et al., 2022, Castro et al., 30 Mar 2025, Brownlowe et al., 2018).
1. Terminology and basic operator-algebraic framework
A directed graph is written , with vertices , edges , range map , and source map . In the relative-graph setting, paths of length form , 0 denotes the finite paths, and 1 the infinite paths. A vertex is singular if it is a source or an infinite receiver, and regular otherwise. Relative Toeplitz graph algebras are defined from a subset 2 by imposing the Cuntz–Krieger relation only on 3: 4 is universal for (CK1)–(CK3) together with
5
Thus 6 and 7 (Brooker et al., 2022).
In the relation-morphism framework, the Toeplitz graph 8-algebra 9 of a directed graph 0 is the 1-enveloping algebra of the Cohn path algebra. It is universally generated by projections 2 and partial isometries 3 satisfying CK1 and the Toeplitz inequalities, including
4
There is a canonical surjection 5 imposing equality at regular vertices (Castro et al., 30 Mar 2025).
A concise comparison of the principal usages is helpful.
| Usage | Core object | Role of 6 |
|---|---|---|
| Fock-space usage | Digraph from the matrix of 7 | Part of “8-Toeplitz operator” |
| Relative-graph usage | Relative graph 9, quotient ideals, pullbacks | Interpreted through hereditary data 0 or the Hajac framework |
| Reconstruction usage | Toeplitz algebra with generalized gauge action | Compact abelian group 1 |
The papers on relative graphs and relation morphisms explicitly state that the term “Directed H-Toeplitz Graphs” does not appear in their text. By contrast, the Fock-space paper introduces directed H-Toeplitz graphs as graphical encodings of operator matrices. The shared backbone across these usages is the Toeplitz-type passage from directed combinatorics to operator algebras (Singh et al., 9 Jul 2025, Brooker et al., 2022, Castro et al., 30 Mar 2025).
2. Fock-space directed H-Toeplitz graphs
In the operator-theoretic usage, the starting point is the Fock space 2 over 3 with Gaussian measure
4
inner product
5
orthonormal basis
6
and reproducing kernel 7. The orthogonal projection 8 is
9
For 0, one has 1 (Singh et al., 9 Jul 2025).
The symbol is harmonic,
2
with
3
The associated Toeplitz and Hankel operators are
4
where 5. The dilation/flip operator 6 is defined on the basis by
7
and the 8-Toeplitz operator is
9
This unifies Toeplitz and Hankel parts: even-index basis vectors pass through the Toeplitz part, and odd-index basis vectors pass through the Hankel part (Singh et al., 9 Jul 2025).
With respect to 0, the matrix 1 of 2 is given by
3
and
4
Deleting every odd column yields the matrix of 5, while deleting every even column yields the matrix of 6 (Singh et al., 9 Jul 2025).
The directed H-Toeplitz graph attached to 7 has vertex set 8, indexing the basis 9. There is a directed edge 0 if and only if 1. One may weight the edge 2 by 3. The indegree and outdegree are
4
with weighted versions
5
In this sense the graph is a literal support digraph, or weighted support digraph, of the interlaced Toeplitz/Hankel matrix (Singh et al., 9 Jul 2025).
3. Diagonal bands, anti-diagonals, and graph structure
The matrix of 6 produces two distinct adjacency geometries. Even columns are Toeplitz-like: for a fixed even column 7, edges occur at 8 whenever 9, and at 0 whenever 1. Odd columns are Hankel-like: for a fixed odd column 2, edges occur at all 3 with 4. Accordingly, even columns encode diagonal bands 5, whereas odd columns encode anti-diagonal bands 6 (Singh et al., 9 Jul 2025).
If 7 and 8 are polynomials of finite degrees 9 and 0, then the Toeplitz portion has at most 1 upper diagonals and 2 lower diagonals with nonzero entries, while the Hankel portion has at most 3 anti-diagonals with nonzero entries, determined by indices 4 with 5. For finite polynomial symbols, the outdegree per column is uniformly bounded by the number of nonzero coefficients, and several examples show that the outdegree is often constant across columns for large indices. Indegree sequences can display parity dependence, reflecting both the arithmetic constraints in the binary abstraction 6 and the 7 indexing of the Hankel bands (Singh et al., 9 Jul 2025).
The paper introduces the combinatorial abstraction 8, with vertices 9 and an arc 0 if and only if
1
for some 2 or 3. In examples, the sets 4 and 5 directly encode the upper- and lower-diagonal positions of nonzero entries in a binary adjacency matrix. This gives a finite or countable digraph model for the matrix support pattern at 6 (Singh et al., 9 Jul 2025).
Three explicit examples organize the qualitative behavior. For the purely anti-analytic symbol 7, odd columns vanish, the binary matrix has ones on three upper diagonals, and the digraph is encoded as 8. In this case 9 for all 00, while the indegrees begin
01
For the purely analytic symbol 02, both Toeplitz and Hankel parts are present, the adjacency pattern is 03, and
04
with indegrees beginning
05
For the mixed symbol 06, the pattern is 07 and the outdegree is constantly 08 (Singh et al., 9 Jul 2025).
The same paper translates several operator-theoretic properties into graph-theoretic language. One has 09. For uniformly continuous harmonic 10, 11 is compact if and only if 12. For bounded harmonic 13, 14 is Hilbert–Schmidt if and only if 15; equivalently,
16
Graphically, this means that nonzero H-Toeplitz operators yield weighted digraphs whose squared edge weights are not summable. For bounded analytic symbols satisfying the paper’s hypotheses, 17 if and only if 18 and 19 are linearly dependent; when that occurs, the corresponding directed H-Toeplitz graphs have identical adjacency patterns and proportional weights (Singh et al., 9 Jul 2025).
4. Relative graphs, hereditary data, and pullbacks of Toeplitz graph algebras
A second, substantially different, use of the phrase arises from relative graphs and relative Toeplitz graph algebras. The paper on relative graphs states that the term “Directed H-Toeplitz graphs” does not appear explicitly there, but interprets it through directed graphs equipped with relative Toeplitz algebras 20 and hereditary-relative quotient structure 21. In this setting a relative graph is a pair 22 with 23, and a morphism 24 is an injective graph homomorphism 25 such that 26 is hereditary in 27, 28, and 29 (Brooker et al., 2022).
Given a hereditary set 30, the associated subgraph 31 has
32
The breaking vertices are
33
and for 34 the gap projection is
35
For 36, Theorem 3.5–Corollary 3.7 give a surjection
37
if and only if 38, with kernel
39
where
40
Equivalently, 41 is the ideal generated by
42
This extends the classical saturated-hereditary quotient 43 to the relative Toeplitz setting (Brooker et al., 2022).
The groupoid formulation clarifies the ideal theory. The graph groupoid 44 has unit space
45
and 46. For 47, let 48 be the reduction of 49 to 50. Then
51
and
52
Gauge-invariant ideals of 53 are exactly those generated by 54 for open invariant 55, and such sets correspond bijectively to pairs 56 with 57 hereditary and 58 via
59
The ideal corresponding to 60 is 61 (Brooker et al., 2022).
Pushouts exist in the category of relative graphs. Given morphisms 62, 63, the pushout 64 has graph part
65
with the expected vertex and edge identifications, and relative set
66
If 67, then 68, 69, and
70
By Pedersen’s pullback criterion, the corresponding commuting square of quotient maps is a pullback if and only if the product of the ideals is zero (Brooker et al., 2022).
The main admissibility condition is
71
Theorem 6.9 states that this is equivalent to several formulations: the outer square of relative Toeplitz algebras induced by the pushout is a pullback; 72; 73; and the decomposed singular/regular condition
74
Under admissibility,
75
This replaces the earlier prohibition on breaking vertices by a condition on where the Cuntz–Krieger relations are imposed (Brooker et al., 2022).
The examples isolate the obstruction. If 76 for all 77, the Toeplitz-algebra diagram is always a pullback. If 78, so all algebras are graph algebras, the outer diagram is a pullback if and only if
79
A non-admissible example occurs when a vertex is breaking for both complements; then the outer graph-algebra square is not a pullback. An admissible example occurs when breaking happens in only one leg; then the graph-algebra square is a pullback (Brooker et al., 2022).
5. Functorial and reconstruction perspectives
A categorical treatment of Toeplitz graph 80-algebras is given by the relation category 81, whose morphisms are relations
82
between finite-path sets. The subcategory 83 consists of multiplicative, decomposable, proper, partial-function-on-vertices relations that are also target bijective and monotone. For 84, the induced map on Cohn path algebras is
85
and it lifts uniquely to a 86-homomorphism
87
On generators,
88
Regularity characterizes when the induced map factors from Toeplitz algebras through graph 89-algebras. The paper therefore places Toeplitz graph 90-algebras inside a contravariant functorial apparatus that unifies earlier covariant and contravariant constructions (Castro et al., 30 Mar 2025).
For finite directed graphs, a different role for 91 appears in generalized gauge actions. Here
92
and the generalized gauge action
93
is defined by
94
The standard gauge action is the single-circle action 95, 96. The paper proves two reconstruction theorems: there exists a 97-isomorphism 98 intertwining the gauge actions and carrying 99 onto 00 if and only if 01; and if 02 and 03 have no sinks, then there exists an isomorphism 04 intertwining the generalized gauge actions 05 and 06 if and only if 07 (Brownlowe et al., 2018).
The reconstruction mechanism is spectral. For each vertex 08,
09
satisfies
10
With the 11-valued inner product 12, one has
13
Hence the edge multiplicity from 14 to 15 is recovered as
16
The same paper also uses KMS theory and the spectral subspaces for 17 to identify vertices and count paths, including the formula
18
Thus 19 functions as a grading group that separates outgoing edges by source vertex (Brownlowe et al., 2018).
The limitations are equally sharp. The paper proves that the gauge action 20 alone is not enough: there exist non-isomorphic finite directed graphs 21 and 22 with a gauge-equivariant isomorphism
23
and even the triples 24 and 25 can be isomorphic. The “no sinks” hypothesis is also necessary for reconstruction from 26 alone, because if 27 is a sink then the 28-coordinate of 29 is trivial on degree-one generators, so the source-wise spectral signature disappears (Brownlowe et al., 2018).
6. Higher-rank Toeplitz graphs and related extensions
A related but separate construction realizes Toeplitz algebras as Cuntz–Krieger algebras of enlarged graphs. For a row-finite 30-graph 31, the higher-rank graph 32 has vertices
33
and morphisms 34 and 35 with
36
37
Composition is defined only by
38
so there is no composition with 39 on the left. Consequently, paths ending at a 40-vertex are terminal. The graph 41 is row-finite and aperiodic (Pangalela, 2015).
If 42 is the universal Cuntz–Krieger family in 43, define
44
Then 45 is a Toeplitz–Cuntz–Krieger 46-family, and the assignment 47 induces an isomorphism
48
The key identity is that the Toeplitz inequality is realized as a Cuntz–Krieger equality plus an explicit remainder at the auxiliary 49-vertex: 50 Thus the 51-vertices record the gap between equality and inequality (Pangalela, 2015).
For 52, this specializes to a directed Toeplitz graph 53. The vertices are 54 for 55 and 56 whenever 57 emits an edge. For each original edge 58, there are edges
59
There is no composition with 60 on the left, so 61-vertices are terminal. In 62,
63
and the Toeplitz generators satisfy
64
This gives a graph-theoretic dilation of the Toeplitz algebra into a genuine graph 65-algebra (Pangalela, 2015).
Taken together, these constructions show three distinct ways in which directed graphs become “H-Toeplitz.” They may be support digraphs of 66-Toeplitz operators on Fock space; relative graphs whose hereditary and quotient data govern pullbacks of relative Toeplitz graph algebras; or directed graphs encoded by Toeplitz algebras endowed with an 67-action, especially 68. A further implication, stated explicitly in the relative-graph paper, is that open directions include “working out pullbacks of relative Toeplitz algebras for higher-rank graphs using the general machinery for gauge-invariant ideals and groupoids,” which would connect the hereditary/pullback framework to the higher-rank Toeplitz graph 69 construction (Brooker et al., 2022, Pangalela, 2015).