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 464–563 of 1604. Source text is displayed literally.

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 524 525def mat_mul(A, B):526    if not A or not B:527        return [[0] * (len(B[0]) if B else 0) for _ in A]528    Bt = list(zip(*B))529    return [[sum(a * b for a, b in zip(r, c)) for c in Bt] for r in A]530 531 532def mat_eq(A, B):533    return all(list(r) == list(q) for r, q in zip(A, B)) and len(A) == len(B)534 535 536def mat_sub(A, B):537    return [[a - b for a, b in zip(r, q)] for r, q in zip(A, B)]538 539 540def trace(M):541    return sum(M[i][i] for i in range(min(len(M), len(M[0]) if M else 0)))542 543 544def nullspace(M, ncols):545    """rational basis of the kernel"""546    A = [[Fr(x) for x in r] for r in M]547    piv = []548    rk = 0549    for c in range(ncols):550        p = next((i for i in range(rk, len(A)) if A[i][c] != 0), None)551        if p is None:552            continue553        A[rk], A[p] = A[p], A[rk]554        A[rk] = [x / A[rk][c] for x in A[rk]]555        for i in range(len(A)):556            if i != rk and A[i][c] != 0:557                f = A[i][c]558                A[i] = [x - f * y for x, y in zip(A[i], A[rk])]559        piv.append(c)560        rk += 1561    free = [c for c in range(ncols) if c not in piv]562    basis = []563    for f in free: