basis_experiment.py

back to table · edit · history · where entries came from · files · download

2626 bytes, as of the version from 2026-11-18 20:02 (current). Recorded here, not run.

"""A bounded test of the Li polynomial basis, not a positivity proof.
Recomputes this table's moment inputs through order 40; creates no extra table.
"""
import json,pathlib
from math import comb,factorial
import numberdb.sage as numberdb
from sage.rings.rational_field import QQ
from sage.rings.real_arb import RealBallField
from sage.rings.complex_arb import ComplexBallField
import sage.rings.polynomial.laurent_polynomial_ring
from sage.matrix.constructor import matrix
import generate
_,mu,work=generate.determinant_balls(digits=100)
R=RealBallField(work)
C=ComplexBallField(work)

def basis(n):
    # [w^j] ((1+w)^2/(1-w)^4)*exp(-t*w/(1-w)).
    return matrix(QQ,n+1,n+1,lambda j,k: QQ((-1)**k)*sum(comb(2,a)*comb(j+3-a,j-k-a) for a in range(3) if j-k-a>=0)/factorial(k) if k<=j else 0)
results=[];fail=[]
for n in range(21):
    B=basis(n);scale=QQ(1)
    for j in range(n+1):scale/=factorial(j)**2
    assert B.det()**2==scale
    h=matrix(C,n+1,n+1,lambda i,j:C(mu[i+j]));hp=B.change_ring(C)*h*B.transpose().change_ring(C)
    dz=h.det();dpz=hp.det()
    assert dz.imag().contains_zero() and dpz.imag().contains_zero()
    d=dz.real();dp=dpz.real();expected=d*R(scale)
    ok=bool(d.is_finite() and dp.is_finite() and d.accuracy()>=400 and dp.accuracy()>=400 and (dp-expected).contains_zero())
    if not ok:fail.append(n)
    results.append({'n':n,'group':'development' if n<=10 else 'held_out','determinant_relation':ok,'both_strictly_positive':bool(d>0 and dp>0),'original_accuracy_bits':int(d.accuracy()),'transformed_accuracy_bits':int(dp.accuracy())})
m=[QQ(1)-QQ(2)**k/8 for k in range(3)]
H=matrix(QQ,2,2,lambda i,j:m[i+j]);B=basis(1);G=B*H*B.transpose()
assert H.det()==-QQ(1)/8 and G.det()==-QQ(1)/8
out={'working_bits':work,'determinant_output_digits':100,'hypothesis_tested':'Changing to the Li polynomial basis might expose positivity beyond congruence.','results':results,'failures':fail,'basis_matrices':{str(n):[[str(c) for c in row] for row in basis(n).rows()] for n in range(21)},'signed_control':{'moments':[str(x) for x in m],'transformed_matrix':[[str(x) for x in row] for row in G.rows()],'determinant':str(G.det()),'positive_diagonals_but_indefinite':all(G[j,j]>0 for j in range(2))},'conclusion':'The invertible lower-triangular basis change only rescales determinants by product (j!)^-2 and preserves inertia. Its positive diagonals are not a positivity mechanism: the signed control has positive diagonals and determinant -1/8. No new inequality or RH conclusion was obtained.'}
print('BASIS_RESULTS_JSON '+json.dumps(out))
if fail:raise SystemExit('Congruence numerical enclosure failure')