"""Exact integral tensor, F2 ideals and Smith invariants. Run from any directory.
Dependencies: numpy sympy; shared exact order basis in ../inter1111.
Right ideal means an additive subgroup I with I*A contained in I; no reassociation.
"""
from pathlib import Path
import sys,json
from collections import Counter
import numpy as np
from sympy import Matrix,ZZ
from sympy.matrices.normalforms import smith_normal_form
ROOT=Path(__file__).resolve().parent
sys.path.insert(0,str(ROOT.parent/'inter1111'))
from orderlib import basis,mult_mats,solve_upper

def rref(vs):
 b={}
 for v in vs:
  v=int(v)
  while v:
   p=v.bit_length()-1
   if p in b:v^=b[p]
   else:
    b[p]=v;break
 for p in sorted(b):
  for q in b:
   if q>p and ((b[q]>>p)&1):b[q]^=b[p]
 return tuple(b[p] for p in sorted(b,reverse=True))
def span(B):
 s=[0]
 for v in B:s += [x^v for x in s]
 return s
def rank(A):
 return len(rref(sum((int(t)&1)<<i for i,t in enumerate(row)) for row in A))
def bits(v):return sum((int(t)&1)<<i for i,t in enumerate(v))
def closure(vs,ops):
 B=rref(vs)
 while True:
  C=rref([*B,*(op[v] for v in B for op in ops)])
  if C==B:return B
  B=C

def ideals(ops):
 cyclic=set(closure([v],ops) for v in range(1,256));done={()};todo=[()]
 while todo:
  B=todo.pop()
  for C in cyclic:
   D=rref(B+C)
   if D not in done:done.add(D);todo.append(D)
 return done

def table(C):
 T=np.zeros((256,256),dtype=np.int64)
 for v in range(256):
  t=[bits(sum((C[i,j] for i in range(8) if v>>i&1),start=np.zeros(8,dtype=np.int64))) for j in range(8)]
  for w in range(1,256):
   low=w&-w;T[v,w]=T[v,w^low]^t[low.bit_length()-1]
 return T

def product_space(B,D,T):return rref(int(T[b,d]) for b in B for d in D)
def sumspaces(*spaces):return rref(v for B in spaces for v in B)
def strong_powers(B,T,maxn=16):
 if not B:return [0]
 P=[(),B]
 for n in range(2,maxn+1):
  P.append(sumspaces(*(product_space(P[i],P[n-i],T) for i in range(1,n))))
  if not P[-1]:return [len(b) for b in P[1:]]
 return None

def smith(A):
 S=smith_normal_form(Matrix(A.tolist()),domain=ZZ)
 return [abs(int(S[i,i])) for i in range(min(S.shape)) if S[i,i]]

def analyze(n,name):
 B,L=mult_mats(n);C=np.array(L,dtype=np.int64).transpose(0,2,1)
 A=np.einsum('ijm,mkn->ijkn',C,C)-np.einsum('jkm,imn->ijkn',C,C)
 comm=C-C.transpose(1,0,2)
 snf=smith(A.reshape(512,8).T)
 vals=[(d&-d).bit_length()-1 for d in snf]
 T=table(C)
 opsR=[T[:,1<<j] for j in range(8)];opsL=[T[1<<j,:] for j in range(8)]
 two=ideals(opsR+opsL);right=ideals(opsR)
 nil=[]
 for I in two:
  pw=strong_powers(I,T)
  if pw is not None:nil.append((I,pw))
 N,pw=max(nil,key=lambda q:len(q[0]));assert all(rref(N+J)==N for J,_ in nil)
 gram=Matrix([[int(2*sum(a*b for a,b in zip(x,y))) for y in B] for x in B])
 Q=[]
 for v in range(256):
  vv=[sum(B[i][j] for i in range(8) if v>>i&1) for j in range(8)]
  z=sum(x*x for x in vv);assert z.denominator==1;Q.append(int(z)%2)
 polar_kernel=[v for v in range(256) if all(sum(int(gram[i,j])*((v>>i)&1) for i in range(8))%2==0 for j in range(8))]
 norm_radical=[v for v in polar_kernel if Q[v]==0]
 assert set(norm_radical)==set(span(N))
 # Alternativity over Z: associator is alternating and diagonal entries vanish.
 alt=all(not A[i,i,j].any() and not A[j,i,i].any() for i in range(8) for j in range(8)) and np.array_equal(A,-A.transpose(1,0,2,3)) and np.array_equal(A,-A.transpose(0,2,1,3))
 # Nucleus: simultaneous left/middle/right associator equations, char 2.
 nuc=[]
 for v in range(256):
  inds=[i for i in range(8) if v>>i&1]
  if all(not (sum((X[i] for i in inds),start=np.zeros((8,8,8),dtype=np.int64))%2).any() for X in (A,A.transpose(1,0,2,3),A.transpose(2,0,1,3))):nuc.append(v)
 centre=[v for v in nuc if all(T[v,j]==T[j,v] for j in range(256))]
 # Quotient associativity/commutativity, reduced by N.
 def inN(v):return rref(N+(int(v),))==N
 qassoc=all(inN(bits(v)) for v in A.reshape(512,8));qcomm=all(inN(bits(v)) for v in comm.reshape(64,8))
 def rem(v):
  for b in N:
   if v&(1<<(b.bit_length()-1)):v^=b
  return int(v)
 reps=sorted(set(rem(v) for v in range(256)))
 asp=rref(bits(v) for v in A.reshape(512,8));N2=product_space(N,N,T)
 out=dict(quotient_idempotents=sum(rem(int(T[v,v]))==v for v in reps),associator_equals_N_squared=(asp==N2),associator_equals_N=(asp==N),order_index_over_G=2**{0:0,1:1,8:2,12:4}[n],basis=[[str(v) for v in row] for row in B],polar_gram_determinant=int(gram.det()),polar_rank_mod2=rank(gram.tolist()),nilpotent_ideal_dimension=len(N),nilpotent_ideal_basis=list(N),nilpotent_ideal_power_dimensions=pw,associative_mod2=not (A%2).any(),commutative_mod2=not (comm%2).any(),associator_smith=snf,associator_rank_mod2=rank(A.reshape(512,8)),associator_log2_image_mod_2_4_8=[sum(max(k-v,0) for v in vals) for k in (1,2,3)],commutator_rank_mod2=rank(comm.reshape(64,8)),alternativity_checked=bool(alt),two_sided_ideal_count=len(two),right_ideal_count=len(right),right_ideals_by_codimension=[sum(len(I)==8-k for I in right) for k in range(9)],nilpotent_elements=sum(T[v,v]==0 for v in range(256)),idempotents=sum(T[v,v]==v for v in range(256)),norm_one_units=sum(Q),nucleus_dimension=len(rref(nuc)),centre_dimension=len(rref(centre)),quotient_dimension=8-len(N),quotient_associative=qassoc,quotient_commutative=qcomm,quotient_two_sided_ideal_count=sum(rref(I+N)==I for I in two))
 assert alt
 print(name,json.dumps({k:v for k,v in out.items() if k not in ('basis','nilpotent_ideal_basis')},default=lambda x:x.item()),flush=True)
 return out

if __name__=='__main__':
 out={'conventions':'Right ideals I*A subset I; N is largest two-sided ideal nilpotent for every bracketing. Smith image sizes over Z/4,Z/8 are log2 cardinalities, not vector-space dimensions.','orders':{}}
 for n,name in ((0,'G'),(1,'S1'),(8,'R'),(12,'E8')):out['orders'][name]=analyze(n,name)
 (ROOT/'results.json').write_text(json.dumps(out,indent=2,default=lambda x:x.item())+'\n')
