Indexed text attachment
verify-topology.py
Source for Algebraic and Differential Topology in Higher Categories
View paper · Download original file
Lines 441–540 of 1961. Source text is displayed literally.
441 if q:442 for r in A:443 r[j] -= q * r[t]444 if A[t][j]:445 for r in A:446 r[t], r[j] = r[j], r[t]447 done = False448 if done:449 bad = None450 for i in range(t + 1, m):451 for j in range(t + 1, n):452 if A[i][j] % A[t][t]:453 bad = i454 break455 if bad is not None:456 break457 if bad is None:458 break459 A[t] = [a + b for a, b in zip(A[t], A[bad])]460 out.append(abs(A[t][t]))461 t += 1462 return out463 464 465def rank_mod(M, p):466 A = [[x % p for x in r] for r in M]467 rk = 0468 n = len(A[0]) if A else 0469 for c in range(n):470 piv = next((i for i in range(rk, len(A)) if A[i][c]), None)471 if piv is None:472 continue473 A[rk], A[piv] = A[piv], A[rk]474 inv_ = pow(A[rk][c], p - 2, p)475 A[rk] = [(x * inv_) % p for x in A[rk]]476 for i in range(len(A)):477 if i != rk and A[i][c]:478 f = A[i][c]479 A[i] = [(x - f * y) % p for x, y in zip(A[i], A[rk])]480 rk += 1481 return rk482 483 484BIGP = 1000003485 486 487def homology(K):488 """list over d of (betti number, torsion coefficients)"""489 facs = {d: snf(K.bd(d)) for d in range(1, K.dim + 1)}490 out = []491 for d in range(K.dim + 1):492 rk_d = len(facs.get(d, []))493 rk_up = len(facs.get(d + 1, []))494 out.append((K.n(d) - rk_d - rk_up, [x for x in facs.get(d + 1, []) if x > 1]))495 return out496 497 498def betti_mod(K, p):499 r = {d: rank_mod(K.bd(d), p) if K.n(d) and K.n(d - 1) else 0 for d in range(1, K.dim + 2)}500 return [K.n(d) - r.get(d, 0) - r.get(d + 1, 0) for d in range(K.dim + 1)]501 502 503def bettis(K):504 return [b for b, _ in homology(K)]505 506 507def perm_sign(seq):508 seq = list(seq)509 s = 1510 for i in range(len(seq)):511 for j in range(i + 1, len(seq)):512 if seq[i] > seq[j]:513 s = -s514 return s515 516 517def chain_map(K, L, vmap, d):518 """matrix of the simplicial map on d-chains"""519 M = [[0] * K.n(d) for _ in range(L.n(d))]520 for j, x in enumerate(K.S.get(d, [])):521 y = [vmap[v] for v in x]522 if len(set(y)) == d + 1:523 M[L.idx[d][tuple(sorted(y))]][j] = perm_sign(y)524 return M525 526 527def mat_mul(A, B):528 if not A or not B:529 return [[0] * (len(B[0]) if B else 0) for _ in A]530 Bt = list(zip(*B))531 return [[sum(a * b for a, b in zip(r, c)) for c in Bt] for r in A]532 533 534def mat_eq(A, B):535 return all(list(r) == list(q) for r, q in zip(A, B)) and len(A) == len(B)536 537 538def mat_sub(A, B):539 return [[a - b for a, b in zip(r, q)] for r, q in zip(A, B)]540