Ordinary traces of E_7 and E_8 in characteristic two (Appendix B) #
characteristic-two-mesh-calculations.tex: "Apply Lemma A.6(1) in
characteristic two. For a = yx³ and b = yx⁴, its block relations and 3[ab] = 0
give [a²W] = 0 (W ≠ 1), [abW] = [baW] (W ≠ 1), [ab] = 0, [b^q] = 0
(q ≥ 2). Words with two a's and at least three blocks vanish by bringing the a's
together. With exactly one a, only ab² can remain: abʳ has word degree greater
than fourteen for r ≥ 3. For the one-y words, the identities 3[yx²] = 0 and
5[yx⁴] = 0 still hold, whereas no vanishing follows from 2[yx] = 2[yx³] = 0. Thus
the ordinary positive trace is spanned by yx, yx³, (yx³)², (yx³)(yx⁴)² in word
degrees 2, 4, 8, 14."
We run the induction of Lemma A.6 on the number of y's in a fixed word degree n,
with values in a subgroup A of the target containing the candidate class of degree
n (all_mem).
The hypotheses in characteristic two.
- x5 : x ^ 5 = 0
- y3 : y ^ 3 = 0
- d1 : y * y + y * x + x * y + x * x = 0
- two : 2 = 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
Gap reductions in characteristic two #
Words with one y #
All words of word degree n with at most K letters y have trace in A.
Instances For
Bad gaps #
A gap of length at most two, or at least five, reduces to fewer y's.
Words in a = yx³ and b = yx⁴ #
F x^k W: blk (3 :: (k+1) :: g) = blk (4 :: k :: g) + ….
[a²W] ∈ A for nonempty W; [a²] is the candidate of degree eight.
[abW] - [baW] ∈ A for nonempty W.
The degree bound #
A gap word as a list of letters.
Instances For
Two a's are brought together using [abW] = [baW].
Cyclic words in a, b.
The ordinary traces in characteristic two, by word degree: in word degree n,
every gap word has trace in any subgroup containing the candidate of degree n.