In the following post, we go through an example computation of the K-theory of the tiling space of the Fibonacci tiling of
. The main reference for these notes will be the book of Sadun [1]. In particular pages 27-29 and Theorem 2.1. We adopt the following conventions: The Fibonacci substitution rule with alphabet
![]()
![]()
The nomenclature likely comes from the fact that the length of the word
is determined by the n’th Fibonacci number.We let
act on (possibly infinite) words by acting on each letter
![]()
If we let
and
correspond to half open intervals, then up to translation a tiling of
corresponds to a bi-infinite word in
. We may determine the tiling completely by adding a “point” to the bi-infinite word indicating where
lies in the tiling. We have a natural action of
on the space of tilings given by translation which will briefly make its appearance at the end of these notes.
If
is a tile, then
is called the level-n supertile of
. A tiling is called admissible if every finite patch of the tile is contained in some supertile
for some integer
(note that
spans the alphabet). The tiling space of
is then defined to be
![]()
These tilings we refer to as Fibonacci tilings of
. Clearly if
is an admissible tiling, then so is
, so this set is closed under the Fibonacci substitution rule. Similarly
is clearly closed under the action of
by translation and we may thus form the corresponding action groupoid
. Note that
and
are not admissible tiles, hence neither are their
being a supertile of
.
A concrete realization of a Fibonacci tiling of
is given by letting
be intervals of varying length. If we set
to be the half open interval of lenth
and
the interval of length
(the golden mean) then
can be taken to be the multiplication by
map on
.
To compute the K-theory of the tiling space of an admissible tiling using the Anderson-Putnam complex below, we will need our substitution tiling to “force the border”. A substitution rule is said to force the border if there is an
such that a supertile of level-n uniquely determine its adjacent letters. Looking at the words
![]()
So the Fibanacci tiling does not “force the border” to the right. To remedy this, we use collared tiles, which keep track of the letters adjacent to the given letter. The point is that these collared tiles do force the border and so the machinery of Anderson-Putnam tells us that a certain projective limit converges to the tiling space of any admissible tiling\footnote{The Fibonacci tiling is determined by a primitive substitution, hence any admissible tiling will yield isomorphic tiling space [1, Th. 1.5]{sudan}}. There are a total of four admissible three letter patches, namely:
![]()
![]()
The Anderson-Putnam complex
of an admissible collared tiling with the above substitution rule is depicted by the CW-complex below (shamelessly copied from [1, Fig. 2.4])

The substitution rules determine a continuous map
(uniquely up to homotopy). In particular, if we denote by
denote the path obtained by first tracing
and then the
in the direction of the arrows, then
is the triangle
. Similarly the upper triangle
is mapped to
which is a path similar to how a regular person would write the figure eight by hand.
By a theorem of Anderson and Putnam the tiling space
of the Fibonacci tiling is homeomorphic to the projective limit
![]()
![]()
![]()
![]()
1. Cycles in
: A short digression
Let
be a compact Hausdorff space. Cycles in
are represented by homotopy classes of continuous maps
![]()
![]()
where
![]()
Given a continuous map
between compact Hausdorff spaces, the induced map on the
-groups is given by pre-composition by
, i.e.
![]()
The most trivial setting is where
. Then homotopy class of map
are clearly in bijection with the elements in
. Since the imbedding
determines an isomorphism on the level of fundamental groups, we deduce that two cycles
and
are equivalent, if and only if they determine the same map on fundamental groups
Thus for any
we have
![]()
2. The K-theory of the tiling space of a Fibonacci tiling
Returning back to our space
we can, in a similar vain, show that
is the free abelian group generated by two cycles represented by maps
![]()
To determine the map
we simply need to check how it behaves on these two loops.
For our
we have seen that it sends the loop
(the lower loop) to the loop
. Thus
![]()
![]()
![]()
![]()
![]()
Now we can easily compute the K-theory of the transformation groupoid given by the
-action on
using Connes-Thom isomorphism:
![Rendered by QuickLaTeX.com \[K^i(\Omega\rtimes \R) = K_i(C(\Omega)\rtimes \R) \simeq K^{i+1}(\Omega) = \begin{cases}\Z\oplus \Z & i = 0 \\ 0 & i = 1. \end{cases}\]](https://www.mathblog.realhjelp.no/wp-content/ql-cache/quicklatex.com-554dffa9e9fa41c41694b815225fa377_l3.png)
