[Paper Review] Aperiodicity Conditions in Topological $k$-Graphs

Sarah E. Wright|arXiv (Cornell University)|Oct 18, 2011

Advanced Operator Algebra Research6 references3 citations

TL;DR

This paper introduces two new aperiodicity conditions for topological $k$-graphs that are equivalent to Yeend's Condition (A), but based on finite paths rather than infinite ones. The key contribution is a constructive example using a twisted topological $k$-graph that demonstrates the practical advantages of the new conditions in verifying aperiodicity more efficiently than traditional infinite-path methods.

ABSTRACT

We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new construction of a twisted topological $k$-graph, to demonstrate the improvements achieved by the new conditions. Reducing this proof of equivalence to the discrete case also gives a new direct proof of the corresponding conditions in discrete $k$-graphs, where previous proofs depended on simplicity of the corresponding C$^*$-algebra.

Motivation & Objective

• To extend finite-path aperiodicity conditions—previously known in discrete $k$-graphs—to the setting of topological $k$-graphs.
• To provide equivalent, finite-path-based criteria for Yeend's Condition (A), simplifying verification of aperiodicity in topological $k$-graphs.
• To present a new construction of twisted topological $k$-graphs using a discrete $k$-graph and a continuous functor, avoiding the need for commuting local homeomorphisms.
• To demonstrate the practical advantage of the new conditions through a concrete example where checking aperiodicity via finite paths is simpler than via infinite paths.

Proposed method

• Introduce two new aperiodicity conditions—Condition (C) and Condition (C')—that depend only on finite paths in topological $k$-graphs.
• Use a twisted product construction: given a discrete $k$-graph $\Lambda$ and a continuous functor $\tau$ to a topological space $\mathbb{T}$, define a new topological $k$-graph $\Lambda \times_\tau \mathbb{T}$.
• Apply the unique factorization property of topological $k$-graphs to analyze path extensions and multiplicative common extensions (MCE) of pairs of paths.
• Prove equivalence between the new finite-path conditions and Yeend's original Condition (A), which is defined in terms of infinite paths.
• Use a specific example: the 1-skeleton of a discrete $k$-graph with factorization rules involving permutations of $\mathbb{Z}/n\mathbb{Z} \times \mathbb{Z}/(n+1)\mathbb{Z}$, and a functor $\tau$ defined by $\tau_{\alpha_i^n}(z) = z^n$, to construct a twisted topological $k$-graph.
• Verify aperiodicity using Condition (C) by showing $\operatorname{MCE}(X\tau, Y\tau) = \emptyset$ for appropriate open sets $X, Y$, demonstrating the method's efficiency over infinite-path analysis.

Experimental results

Research questions

• RQ1 Can aperiodicity conditions for topological $k$-graphs be reformulated using only finite paths, rather than infinite ones, as in the discrete case?
• RQ2 Are these new finite-path conditions equivalent to Yeend's original Condition (A) in the topological $k$-graph setting?
• RQ3 Does the new twisted topological $k$-graph construction provide a more flexible and accessible method for generating examples with desired aperiodicity properties?
• RQ4 Can the new conditions simplify the verification of aperiodicity compared to the standard infinite-path approach?
• RQ5 Is there a direct proof of the equivalence of finite-path conditions in discrete $k$-graphs that does not rely on the simplicity of the associated $C^*$-algebra?

Key findings

• The two new aperiodicity conditions—Condition (C) and Condition (C')—are proven to be equivalent to Yeend's Condition (A) in topological $k$-graphs.
• The twisted topological $k$-graph construction using a discrete $k$-graph and a continuous functor $\tau$ yields a valid topological $k$-graph that satisfies the new aperiodicity conditions.
• In the specific example, the twisted topological $k$-graph $\Lambda \times_\tau \mathbb{T}$ is shown to be aperiodic by verifying $\operatorname{MCE}(X\tau, Y\tau) = \emptyset$ using Condition (C), confirming aperiodicity via finite-path analysis.
• The proof of equivalence between the new conditions and Condition (A) reduces to the discrete case and provides a new direct proof that does not depend on the simplicity of the associated $C^*$-algebra.
• The new method avoids the need for $k$ commuting local homeomorphisms, unlike skew product constructions, and only requires a continuous functor, making the construction more flexible.
• The example demonstrates that verifying aperiodicity using finite paths is significantly more efficient and less computationally involved than analyzing infinite paths via $\sigma^m x$.