Independent scholarship · Open accessThe monthly digest

Indexed text attachment

verify-topology.py

Source for Algebraic and Differential Topology in Higher Categories

View paper · Download original file

Lines 421–520 of 1961. Source text is displayed literally.

421                if A[i][j] and (piv is None or abs(A[i][j]) < abs(A[piv[0]][piv[1]])):422                    piv = (i, j)423        if piv is None:424            break425        A[t], A[piv[0]] = A[piv[0]], A[t]426        for r in A:427            r[t], r[piv[1]] = r[piv[1]], r[t]428        while True:429            done = True430            for i in range(t + 1, m):431                if A[i][t]:432                    q = A[i][t] // A[t][t]433                    if q:434                        A[i] = [a - q * b for a, b in zip(A[i], A[t])]435                    if A[i][t]:436                        A[t], A[i] = A[i], A[t]437                        done = False438            for j in range(t + 1, n):439                if A[t][j]:440                    q = A[t][j] // A[t][t]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, [])):