#!/usr/bin/env python3 """Certify exact critical points near the 40 retained U5 representatives. python3 critical5.py python3 critical5.py --prepare [--groups 39] The default reads rational chart data and performs only interval verification. --prepare proposes those data from the existing catalogue, using point Newton iteration; proposed data have no certified status until the interval tests pass. No random search is performed. The input and output JSON files live in data/. Uniqueness is local modulo row and column phases. No completeness or pairwise inequivalence assertion is made by this program. """ import os for name in ('OPENBLAS_NUM_THREADS','OMP_NUM_THREADS','MKL_NUM_THREADS','VECLIB_MAXIMUM_THREADS'): os.environ[name]='1' import argparse from itertools import combinations import json from pathlib import Path import time import numpy as np from mpmath import mp,iv ROOT=Path(__file__).resolve().parent N,D=5,16 DENOMINATOR=10**20 RADIUS='1e-12' BASIS=[np.diag(e).astype(complex) for e in np.eye(N)] for j,k in combinations(range(N),2): for value in (1,1j): a=np.zeros((N,N),complex);a[j,k]=value;a[k,j]=complex(value).conjugate() BASIS.append(a) BASIS=np.array(BASIS) def conjugate(c,z): return c.mpc(z.real,-z.imag) def star(c,a): return c.matrix([[conjugate(c,a[j,i]) for j in range(a.rows)] for i in range(a.cols)]) def coords(a): return [a[k,k].real for k in range(N)]+[v for j,k in combinations(range(N),2) for v in (a[j,k].real,a[j,k].imag)] def evaluate(c,a,hs,second=True): """Value, gradient and ordinary coordinate Hessian of sum |U_ij|.""" w=(c.eye(N)-1j*a)**-1;u=2*w-c.eye(N) du=[2j*w*b*w for b in hs] mod=[[abs(u[i,j]) for j in range(N)] for i in range(N)] radial=[[[(conjugate(c,u[i,j])*v[i,j]).real for j in range(N)] for i in range(N)] for v in du] g=c.matrix([sum(radial[k][i][j]/mod[i][j] for i in range(N) for j in range(N)) for k in range(D)]) if not second:return u,du,mod,g h=c.matrix(D) for j in range(D): for k in range(j,D): dd=-2*w*(hs[j]*w*hs[k]+hs[k]*w*hs[j])*w h[j,k]=h[k,j]=sum( (conjugate(c,du[j][a,b])*du[k][a,b]+conjugate(c,u[a,b])*dd[a,b]).real/mod[a][b] -radial[j][a][b]*radial[k][a][b]/mod[a][b]**3 for a in range(N) for b in range(N)) return u,du,mod,g,h def prepare(j,u): from scipy.linalg import qr,polar # A rational unit phase moves the Cayley singularity away from the spectrum. choices=range(-16,17) k=max(choices,key=lambda k:np.linalg.svd(((4+1j*k)/(4-1j*k))*u+np.eye(N),compute_uv=False)[-1]) alpha=(4+1j*k)/(4-1j*k) v=polar(alpha*u)[0] a=-1j*(v-np.eye(N))@np.linalg.inv(v+np.eye(N));a=(a+a.conj().T)/2 w=np.linalg.inv(np.eye(N)-1j*a) du=2j*w@BASIS@w chart=np.array([coords(-1j*v.conj().T@b) for b in du],float).T phase=np.array([coords(b) for b in list(BASIS[:N])+[v.conj().T@e@v for e in BASIS[:N-1]]],float).T phase_q=np.linalg.qr(phase)[0] projected=chart-phase_q@(phase_q.T@chart) indices=sorted(int(i) for i in qr(projected,pivoting=True)[2][:D]) mp.dps=60 a=mp.matrix([[mp.mpc(str(z.real),str(z.imag)) for z in row] for row in a]) hs=[mp.matrix(BASIS[i].tolist()) for i in indices] for step in range(8): *_,g,h=evaluate(mp,a,hs) if max(abs(x) for x in g)0 for x in mp.eigsy(h,eigvals_only=True)) return dict(group=j,phase_parameter=k,denominator=str(DENOMINATOR), center=integers,directions=[i+1 for i in indices],radius=RADIUS,positive=int(positive)) def center(c,record): a=c.matrix(N);ints=record['center'];den=int(record['denominator']) for i in range(N):a[i,i]=c.mpf(ints[i][i])/den for i,j in combinations(range(N),2): a[i,j]=c.mpc(ints[i][j],ints[j][i])/den;a[j,i]=conjugate(c,a[i,j]) return a def midpoint(a): return np.array([[float(a[i,j].mid) for j in range(a.cols)] for i in range(a.rows)]) def rational(a): return iv.matrix([[format(float(v),'.17g') for v in row] for row in a]) def infinity(a): return max(sum(abs(a[i,j]) for j in range(a.cols)).b for i in range(a.rows)) def pair_bounds(u): result=[] for which,v in [('column',u),('row',u.T)]: for j,k in combinations(range(N),2): total=iv.mpf(0);weight=iv.mpf(0);phase=iv.mpc(0) for i in range(N): p=abs(v[i,j]);q=abs(v[i,k]);z=conjugate(iv,v[i,j])*v[i,k]/(p*q) d=q*q/p+p*p/q;total+=p+q;weight+=d;phase+=d*z*z bound=(weight+abs(phase))/4-total/2 assert bound.b0,1,-1);positive=int(sum(signs>0)) assert positive==record['positive'] and 0iv.mpf('.016') and norm.biv.mpf(rounded)-iv.mpf('5e-7') and norm.biv.mpf('11.08108') and norm.b