Failure of rational injectivity for maximal coarse assembly
There exist finite connected graphs with a common finite bound on vertex degree, a coarse disjoint union , and an infinite-order class such that ; consequently, is not injective.
The proof of Theorem 1.1 on page 23 follows directly from Lemma 2.2, Proposition 3.5, Proposition 4.5, Proposition 5.1, and Proposition 6.1, all of which are rigorously established.
“There exist finite connected graphs (Xj )j≥1 with a common finite bound on vertex degree, a coarse disjoint union X = F j≥1 Xj , and an infinite-order class α ∈ KX1(X) such that µ max X (α) = 0. Consequently, µ max X ⊗ Q is not injective.” · Show in paper