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 104–203 of 1604. Source text is displayed literally.
104 105def inertia(A):106 """signature (positive, negative, zero) of a rational symmetric matrix by exact congruence"""107 n = len(A)108 M = [[Fr(v) for v in r] for r in A]109 pos = neg = zero = 0110 for k in range(n):111 if M[k][k] == 0:112 j = next((j for j in range(k + 1, n) if M[j][j] != 0), None)113 if j is not None:114 M[k], M[j] = M[j], M[k]115 for r in M:116 r[k], r[j] = r[j], r[k]117 else:118 j = next((j for j in range(k + 1, n) if M[k][j] != 0), None)119 if j is None:120 zero += 1121 continue122 for c in range(n):123 M[k][c] += M[j][c]124 for r in range(n):125 M[r][k] += M[r][j]126 d = M[k][k]127 pos, neg = pos + (d > 0), neg + (d < 0)128 for i in range(k + 1, n):129 f = M[i][k] / d130 if f:131 for c in range(n):132 M[i][c] -= f * M[k][c]133 for r in range(n):134 M[r][i] -= f * M[r][k]135 return pos, neg, zero136 137 138def jacobi_eig(A, sweeps=60):139 """eigenvalues (ascending) and orthonormal eigenvectors (rows) of a real symmetric matrix"""140 n = len(A)141 a = [list(r) for r in A]142 v = eye(n)143 for _ in range(sweeps):144 off = sum(a[i][j] ** 2 for i in range(n) for j in range(i + 1, n))145 if off < 1e-22:146 break147 for p in range(n - 1):148 for q in range(p + 1, n):149 if abs(a[p][q]) < 1e-300:150 continue151 th = (a[q][q] - a[p][p]) / (2 * a[p][q])152 t = (1 if th >= 0 else -1) / (abs(th) + math.sqrt(th * th + 1))153 c = 1 / math.sqrt(t * t + 1)154 s = t * c155 for k in range(n):156 akp, akq = a[k][p], a[k][q]157 a[k][p], a[k][q] = c * akp - s * akq, s * akp + c * akq158 for k in range(n):159 apk, aqk = a[p][k], a[q][k]160 a[p][k], a[q][k] = c * apk - s * aqk, s * apk + c * aqk161 for k in range(n):162 vkp, vkq = v[k][p], v[k][q]163 v[k][p], v[k][q] = c * vkp - s * vkq, s * vkp + c * vkq164 order = sorted(range(n), key=lambda i: a[i][i])165 return [a[i][i] for i in order], [[v[k][i] for k in range(n)] for i in order]166 167 168def tri_eigs(d, e, k):169 """the k smallest eigenvalues of the symmetric tridiagonal matrix (diagonal d, off-diagonal e) by Sturm bisection"""170 n = len(d)171 lo = min(d[i] - (abs(e[i - 1]) if i else 0) - (abs(e[i]) if i < n - 1 else 0) for i in range(n))172 hi = max(d[i] + (abs(e[i - 1]) if i else 0) + (abs(e[i]) if i < n - 1 else 0) for i in range(n))173 174 def count(x):175 c, q = 0, 1.0176 for i in range(n):177 q = d[i] - x - ((e[i - 1] ** 2) / q if i else 0.0)178 if q == 0:179 q = 1e-300180 if q < 0:181 c += 1182 return c183 out = []184 for j in range(k):185 a, b = lo, hi186 for _ in range(200):187 m = 0.5 * (a + b)188 if count(m) > j:189 b = m190 else:191 a = m192 if b - a < 1e-13 * (1 + abs(a)):193 break194 out.append(0.5 * (a + b))195 return out196 197 198def kron_sum(A, B):199 n, m = len(A), len(B)200 K = [[0.0] * (n * m) for _ in range(n * m)]201 for i in range(n):202 for j in range(n):203 for k in range(m):