"""Independently compare the word and triangle matrices in second_nodes.tex. Run with Python 3. No packages or local modules are required. The optional --max-rank sets the inclusive upper limit (24 by default). """ import argparse from collections import defaultdict def word_and_cartan(kind, n): matrix = [[2 * int(i == j) for j in range(n + 1)] for i in range(n + 1)] edges = [(0, 2), *((i, i + 1) for i in range(1, n - 1))] edges.append((n - 1 if kind == 'B' else n - 2, n)) for i, j in edges: matrix[i][j] = matrix[j][i] = -1 if kind == 'B': matrix[n][n - 1] = -2 top = n if kind == 'B' else n - 1 word = [j for i in range(2, top + 1) for j in (i, i - 1)] if kind == 'D': word.append(n) word.extend(range(n - 2, 0, -1)) word.extend(range(top, 1, -1)) word.append(0) return word, matrix def translated_matrix(kind, n): word, cartan = word_and_cartan(kind, n) chains = defaultdict(list) for k, color in enumerate(word): chains[color].append(k) length = len(word) following = [length] * length previous = [-1] * length for chain in chains.values(): for i, j in zip(chain, chain[1:]): following[i], previous[j] = j, i mutable = [k for k in range(length) if following[k] < length] origin = [1] coroot = [int(i == 2) for i in range(n + 1)] for i in word[1:]: coroot[i] -= sum(v * cartan[j][i] for j, v in enumerate(coroot)) origin.append(coroot[i]) degrees = origin.copy() degrees[-2] += 1 result = [] for k in mutable: row = [0] * length row[following[k]] = -1 if previous[k] >= 0: row[previous[k]] = 1 for j in range(length): if j < k < following[j] < following[k]: row[j] = cartan[word[j]][word[k]] if k < j < following[k] < following[j]: row[j] = -cartan[word[j]][word[k]] tau_entry = -sum(v * d for v, d in zip(row, degrees)) result.append([row[j] for j in mutable] + [tau_entry]) tau_row = [-row[-1] * (2 if kind == 'B' and word[k] == n else 1) for k, row in zip(mutable, result)] result.append(tau_row + [0]) return result, mutable, chains def triangles(kind, n, mutable, chains): m = n - 1 if kind == 'B' else n - 2 positions = {k: i for i, k in enumerate(mutable)} size = len(mutable) + 1 A = {i: positions[chains[i][0]] for i in range(2, m + 1)} C = {i: positions[chains[i][-2]] for i in range(2, m + 1)} P, Q = positions[chains[1][0]], size - 1 faces = [(A[2], P, Q), (C[2], Q, P)] for i in range(2, m): bridge = positions[chains[i][1]] faces.extend([(A[i], A[i+1], bridge), (C[i+1], C[i], bridge)]) pending = None if kind == 'D': R, S = positions[chains[n-1][0]], positions[chains[m][1]] faces.extend([(A[m], R, S), (C[m], S, R)]) else: pending = positions[chains[n][0]] faces.append((A[m], pending, C[m])) matrix = [[0] * size for _ in range(size)] for a, b, c in faces: for i, j in ((a, b), (b, c), (c, a)): matrix[i][j] += 2 if j == pending else 1 matrix[j][i] -= 2 if i == pending else 1 return matrix def check(kind, n): actual, mutable, chains = translated_matrix(kind, n) expected = triangles(kind, n, mutable, chains) if actual != expected: raise ValueError(f'{kind}{n} adjacency mismatch') size = 3 * n - (4 if kind == 'B' else 6) if len(actual) != size: raise ValueError(f'{kind}{n} expected {size} mutable vertices') if __name__ == '__main__': cli = argparse.ArgumentParser(description=__doc__) cli.add_argument('--max-rank', type=int, default=24) maximum = cli.parse_args().max_rank if maximum < 4: cli.error('the upper rank must include both families (at least 4)') for kind, first in [('B', 3), ('D', 4)]: for n in range(first, maximum + 1): check(kind, n) print(f'{kind}{first} through {kind}{maximum}: all matrix entries agree')