Independent scholarship · Open accessThe monthly digest

Indexed text attachment

verify-topology-learning.py

Source for Algebraic and Differential Topology in Machine Learning and AI: Obstructions, Invariants, and Counts

View paper · Download original file

Lines 424–523 of 1604. Source text is displayed literally.

424        for r in A:425            r[t], r[piv[1]] = r[piv[1]], r[t]426        while True:427            done = True428            for i in range(t + 1, m):429                if A[i][t]:430                    q = A[i][t] // A[t][t]431                    if q:432                        A[i] = [a - q * b for a, b in zip(A[i], A[t])]433                    if A[i][t]:434                        A[t], A[i] = A[i], A[t]435                        done = False436            for j in range(t + 1, n):437                if A[t][j]:438                    q = A[t][j] // A[t][t]439                    if q:440                        for r in A:441                            r[j] -= q * r[t]442                    if A[t][j]:443                        for r in A:444                            r[t], r[j] = r[j], r[t]445                        done = False446            if done:447                bad = None448                for i in range(t + 1, m):449                    for j in range(t + 1, n):450                        if A[i][j] % A[t][t]:451                            bad = i452                            break453                    if bad is not None:454                        break455                if bad is None:456                    break457                A[t] = [a + b for a, b in zip(A[t], A[bad])]458        out.append(abs(A[t][t]))459        t += 1460    return out461 462 463def rank_mod(M, p):464    A = [[x % p for x in r] for r in M]465    rk = 0466    n = len(A[0]) if A else 0467    for c in range(n):468        piv = next((i for i in range(rk, len(A)) if A[i][c]), None)469        if piv is None:470            continue471        A[rk], A[piv] = A[piv], A[rk]472        inv_ = pow(A[rk][c], p - 2, p)473        A[rk] = [(x * inv_) % p for x in A[rk]]474        for i in range(len(A)):475            if i != rk and A[i][c]:476                f = A[i][c]477                A[i] = [(x - f * y) % p for x, y in zip(A[i], A[rk])]478        rk += 1479    return rk480 481 482BIGP = 1000003483 484 485def homology(K):486    """list over d of (betti number, torsion coefficients)"""487    facs = {d: snf(K.bd(d)) for d in range(1, K.dim + 1)}488    out = []489    for d in range(K.dim + 1):490        rk_d = len(facs.get(d, []))491        rk_up = len(facs.get(d + 1, []))492        out.append((K.n(d) - rk_d - rk_up, [x for x in facs.get(d + 1, []) if x > 1]))493    return out494 495 496def betti_mod(K, p):497    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)}498    return [K.n(d) - r.get(d, 0) - r.get(d + 1, 0) for d in range(K.dim + 1)]499 500 501def bettis(K):502    return [b for b, _ in homology(K)]503 504 505def perm_sign(seq):506    seq = list(seq)507    s = 1508    for i in range(len(seq)):509        for j in range(i + 1, len(seq)):510            if seq[i] > seq[j]:511                s = -s512    return s513 514 515def chain_map(K, L, vmap, d):516    """matrix of the simplicial map on d-chains"""517    M = [[0] * K.n(d) for _ in range(L.n(d))]518    for j, x in enumerate(K.S.get(d, [])):519        y = [vmap[v] for v in x]520        if len(set(y)) == d + 1:521            M[L.idx[d][tuple(sorted(y))]][j] = perm_sign(y)522    return M523