Ordinary traces of types E_7 and E_8 (Lemma A.6) #
lem:e78-traces (periodic-mesh-calculations.tex). Write x, y for
the closed paths along the long and medium arms; the short arm gives
(x + y)² = 0, and x⁵ = y³ = 0. The word identities
y² = -yx - xy - x², yxy = xyx + x³,
yx²y = -yx³ - xyx² - x²yx - x³y - 2x⁴ and
F = yx³yx + yx⁴y + xyx³y - x²yx³ - x³yx² = 0 reduce cyclic words by their
gaps (the numbers of x's between successive y's): "If a gap has length zero,
one or two, apply the corresponding one of the first three identities. Each
resulting term has fewer y's." The remaining words are cyclic words in
a = yx³, b = yx⁴, and the relations [a²W] = 0, [abW] = -[baW],
[b^q] = 0 dispose of them.
With two invertible only degrees three, five and nine survive (part (2)); we
record the vanishing in all other word degrees, which is what the period
exclusion uses. A word y x^{g₁} ⋯ y x^{g_k} is blk [g₁, …, g_k]; the
induction runs on the number k of y's, in a fixed word degree.
The word y x^{g₁} y x^{g₂} ⋯ y x^{g_k}.
Instances For
The hypotheses of Lemma A.6 over any coefficient ring.
- x5 : x ^ 5 = 0
- y3 : y ^ 3 = 0
- d1 : y * y + y * x + x * y + x * x = 0
- rot (p q : S) : tr (p * q) = tr (q * p)
- xp (q : ℕ) : 1 ≤ q → tr (x ^ q) = 0
- ty : tr y = 0
- ty2 : tr (y * y) = 0
Instances For
The hypotheses of Lemma A.6 with two invertible.
- x5 : x ^ 5 = 0
- y3 : y ^ 3 = 0
- d1 : y * y + y * x + x * y + x * x = 0
- ty : tr y = 0
- ty2 : tr (y * y) = 0
- two (m : M) : m + m = 0 → m = 0
Instances For
The word identities #
Gap reductions #
Gap zero (y² = -yx - xy - x²).
Gap two.
All words of word degree n with at most K letters y have zero trace.
Instances For
A gap of length at most two, or at least five, gives zero trace.
Words in a = yx³ and b = yx⁴ #
[a²W] = 0, from the trace of F x² W.
[abW] = -[baW] for nonempty W, from the trace of F x³ W.
Two a's are brought together using [abW] = -[baW].
Cyclic words in a, b with at least two blocks vanish outside word
degree nine.
Words with one y: t_j = [yx^j] vanishes for j = 0, 1, 3 and j ≥ 5.
Lemma A.6 with two invertible, by word degree: in word degree n ∉ {3},
every word in x, y has zero trace, provided [yx⁴] = 0 in degree five and
[ab] = 0 in degree nine.
Words as combinations of gap words #
The span of the gap words of word degree n.
Instances For
Vanishing on the span in word degrees other than three.
Application to the twisted traces of E_7 and E_8 #
Ordinary traces of E_7 and E_8 vanish outside word degrees 3, 5, 9
(Lemma A.6(2)); for E_7 only word degree three remains.