Indexed text attachment
verify-topology.py
Source for Algebraic and Differential Topology in Higher Categories
View paper · Download original file
Lines 501–600 of 1961. Source text is displayed literally.
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 541 542def trace(M):543 return sum(M[i][i] for i in range(min(len(M), len(M[0]) if M else 0)))544 545 546def nullspace(M, ncols):547 """rational basis of the kernel"""548 A = [[Fr(x) for x in r] for r in M]549 piv = []550 rk = 0551 for c in range(ncols):552 p = next((i for i in range(rk, len(A)) if A[i][c] != 0), None)553 if p is None:554 continue555 A[rk], A[p] = A[p], A[rk]556 A[rk] = [x / A[rk][c] for x in A[rk]]557 for i in range(len(A)):558 if i != rk and A[i][c] != 0:559 f = A[i][c]560 A[i] = [x - f * y for x, y in zip(A[i], A[rk])]561 piv.append(c)562 rk += 1563 free = [c for c in range(ncols) if c not in piv]564 basis = []565 for f in free:566 v = [Fr(0)] * ncols567 v[f] = Fr(1)568 for i, c in enumerate(piv):569 v[c] = -A[i][f]570 basis.append(v)571 return basis572 573 574def independent_extend(base, cands):575 """greedily pick vectors of cands independent modulo span(base); returns (reduced rows, picked)"""576 rows = []577 def reduce(v):578 v = list(v)579 for r, c in rows:580 if v[c] != 0:581 f = v[c] / r[c]582 v = [a - f * b for a, b in zip(v, r)]583 return v584 def add(v):585 v = reduce(v)586 c = next((i for i, a in enumerate(v) if a != 0), None)587 if c is None:588 return False589 rows.append((v, c))590 return True591 for b in base:592 add([Fr(x) for x in b])593 picked = []594 for v in cands:595 if add(v):596 picked.append(v)597 return picked598 599 600def solve_coords(cols, v):