"""Mirror tests, a rational quartic circle proof, formal dual and Clifford normalizer.
All identities are exact; numerical checks corroborate, not certify plotted roots."""
from pathlib import Path
import json
import sympy as sp
import numpy as np
import mpmath as mp
R=Path(__file__).resolve().parent; H=R.parent
x,u,t=sp.symbols('x u t'); A=2**(-sp.Rational(1,8)); mp.mp.dps=60
C={'G':[1,1,7,7,14,14,28,8,16],'S1':[1,2,15,35,14,14],'R':[1,0,3],'E8':[1]}
Q={k:sum(v*x**i for i,v in enumerate(c)) for k,c in C.items()}
P=8*u**4+4*u**3-2*u**2+u-3
assert sp.cancel(Q['G']-2*x**4*P.subs(u,x+1/(2*x)))==0
chain=sp.sturm(P,u)
def infinite_sign(f,positive):
    p=sp.Poly(f,u); sign=sp.sign(p.LC()); return int(sign if positive or p.degree()%2==0 else -sign)
def variations(s):return sum(a!=b for a,b in zip(s,s[1:]))
minus=[infinite_sign(f,False) for f in chain]; plus=[infinite_sign(f,True) for f in chain]
assert variations(minus)-variations(plus)==2
vals=[P.subs(u,a) for a in (-sp.Rational(5,4),-1,0,1)]; assert vals[0]>0 and vals[1]<0 and vals[2]<0 and vals[3]>0
out={'reflection_convention':'centre c means s -> 2c-s; the inherited centre 1/16 means s -> 1/8-s',
     'G_circle_proof':{'quartic':str(P),'identity':'Q_G(x)=2*x^4*P(x+1/(2*x))','sturm_chain':[str(f) for f in chain],
         'signs_minus_infinity':minus,'signs_plus_infinity':plus,'real_u_roots':2,'u_intervals':['(-5/4,-1)','(0,1)'],
         'on_circle_x_roots':4,'off_circle_x_roots':4,'quartic_discriminant':int(sp.discriminant(P,u))},'orders':{}}
# Exact conceptual identities checked in the earlier Fano representation, for both G and S1.
RR=np.load(H/'odd1111/certificate-A.npz')['right_actions']; I=np.eye(8,dtype=np.int64); W=sum(RR)
for i in range(1,8):
    ri=RR[i]; g=I+ri
    assert sp.Matrix(g).det()==16
    assert np.array_equal(g@g,2*ri)
    assert np.array_equal(ri.T,-ri)
    for j in range(1,8):
        assert np.array_equal(ri@RR[j]+RR[j]@ri,(-2*I if i==j else 0*I))
        target=ri if i==j else ri@RR[j]
        assert np.array_equal(g@RR[j]@(I-ri),2*target)
    assert np.array_equal(g@W@(I-ri),2*(2*I+ri@W))
    assert np.array_equal((I-ri)@W@g,2*(2*ri-ri@W))
out['normalizer']={'G_and_S1_generators_checked':True,'all_seven_i':True,'determinant':16,'identity':'g=(1+R_i); g^2=2R_i',
    'conjugation_j_not_i':'g R_j g^-1 = R_i R_j','S1_extra_generator':'g R_omega g^-1 = I+R_i R_omega',
    'inverse_S1_extra_generator':'g^-1 R_omega g = R_i-R_i R_omega',
    'status':'conceptual proof from linearized alternativity, exact matrix corroboration',
    'consequence':'stable lattice chains L -> gL -> 2L, with index steps 2^4; does not force Q reciprocity'}
for key,q in Q.items():
    assert key=='E8' or sp.gcd(q,1-x**4)==1
    d=int(sp.degree(q,x)); localA={'G':sp.Rational(1,2),'R':sp.Rational(1,3)}.get(key)
    if localA is not None:
        assert sp.cancel(q-sp.LC(sp.Poly(q,x))*x**d*q.subs(x,localA/x))==0
    D=sp.expand(q*(1+x**4)) if key!='E8' else sp.Integer(1)
    deg=int(sp.degree(D,x)); ad=sp.LC(sp.Poly(D,x))
    dual=sp.expand(sum(D.coeff(x,k)*A**(-j)*x**j/ad for j in range(deg+1) for k in [deg-j]))
    assert sp.simplify(D-ad*x**deg*dual.subs(x,A/x))==0
    gamma= D/D.subs(x,A/x)
    assert sp.simplify(gamma*gamma.subs(x,A/x)-1)==0
    irr=None
    if key!='E8':
        k=next(j for j in range(1,deg+1) if dual.coeff(x,j)!=0)
        b=sp.simplify(dual.coeff(x,k)); mpb=sp.minpoly(b,t)
        assert sp.degree(mpb,t)>1
        irr={'index':f'2^{k}','coefficient':str(b),'minimal_polynomial':str(mpb)}
    out['orders'][key]={'Q_reciprocal':key in ('G','R','E8'),'Q_center':{'G':'1/2','S1':None,'R':'log(3)/(2*log(2))','E8':'constant numerator; no distinguished center'}[key],
         'F2_monomial_self_FE':key=='E8','F2_center':'0' if key=='E8' else None,
         'D_single_reciprocal_center':key=='E8','normalized_global_dual_integral_coefficients':key=='E8',
         'normalized_dual_coefficients':[str(sp.simplify(dual.coeff(x,j))) for j in range(deg+1)],'first_irrational_counting_coefficient':irr,
         'formal_dual_FE':f'H_{key}(s) = {ad} * 2^(-{deg}*s) * H_{key}^vee(1/8-s)',
         'meromorphic_local_gamma':'D(2^(-s))/D(2^(-(1/8-s)))','anti_palindromic_real_center':False}
# Positive palindrome counterexample with no roots on the critical circle.
T=1+6*x*x+4*x**4
assert sp.cancel(T-(2*x*x)**2*T.subs(x,1/(2*x)))==0
out['palindrome_counterexample']='1+6x^2+4x^4; after y=sqrt(2)x it is 1+3y^2+y^4, whose roots all have |y|!=1'
out['G_dual_lattice']={'trace_gram':'2I8','codifferent':'(1/2)G','is_order':False,'failure':'(1/2)*1 times itself is (1/4)*1, not in (1/2)G',
    'multiplier_order':'G','maximal_order_conductor':'2O','conductor_multiplier_order':'O (E8)',
    'scope':'largest O-ideal contained in G; not the multiplication-algebra conductor 8M8'}
(R/'results.json').write_text(json.dumps(out,indent=2)+'\n')
print('Quartic Sturm variations:',variations(minus),variations(plus),'-> exactly two real u roots, four critical-circle x roots')
print('Conceptual G/S1 normalizer identities: checked for all seven generators; determinant16, g^2=2R_i')
for k,d in out['orders'].items():print(k,'Q centre',d['Q_center'],'full F2 centre',d['F2_center'],'formal dual first noninteger:',d['first_irrational_counting_coefficient'])
