Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions .github/workflows/sard-robust-charts.yml
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
name: SARD robust-chart exact interface controls

'on':
pull_request:
paths:
- 'frontiers/sard_g_robust_charts_20260929/**'
- '.github/workflows/sard-robust-charts.yml'
push:
branches: [main]
paths:
- 'frontiers/sard_g_robust_charts_20260929/**'
- '.github/workflows/sard-robust-charts.yml'
workflow_dispatch:
permissions:
contents: read
jobs:
robust-chart-controls:
runs-on: ubuntu-latest
timeout-minutes: 10
steps:
- uses: actions/checkout@11d5960a326750d5838078e36cf38b85af677262
with:
persist-credentials: false
- uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065
with:
python-version: '3.11.16'
- name: Exact packet and both-mode geometric negatives
run: |
set -euo pipefail
python -B -S frontiers/sard_g_robust_charts_20260929/verify.py --output "${RUNNER_TEMP}/sard-robust-${GITHUB_RUN_ID}-${GITHUB_RUN_ATTEMPT}"
git diff --exit-code
422 changes: 422 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/PROOF.md

Large diffs are not rendered by default.

30 changes: 30 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
# SARD-G: the missing robust first-contact source application

Author-side interface repair, nonauthor analytic review required. Scientific effect NONE.

[PROOF.md](PROOF.md) supplies an actual successor predicate at every local and
central section. It proves first CLOSED contact persistence using an early compact
prefix and a transverse terminal interval, retains endpoint/time/open-tube margins,
and supplies countable chart coverage. The original AMEND texts are untouched.

It also replaces the unneeded norm-dense Banach-dual construction by rational
finite combinations of dense point evaluations, whose covariance images are dense
in the Cameron–Martin space. Gaussian independence and Borel/regular-zero slicing
are then proved on the corrected charts.

A2-T (local-branch continuity) and A2-D (C1 parameter regularity) are DISTINCT named
premises. The conditional slicing conclusion also needs the original A3–A4
nonvanishing input and the separate generic full-measure input. This packet does
not certify those inputs, any C103 regional estimate, RN/JETMOD or a 3D theorem.

Run from this directory:

python -B -S verify.py --output /path/to/new-output
python -B -O -S verify.py --output /path/to/other-new-output

Each invocation runs 19 finite tests and rejects 8 semantic mutants in BOTH modes.
The polyline checker is a finite illustration, not a numerical field-membership
algorithm; hits at polyline corners are deliberately not certified. No sampled
gradient minimum is asserted to be a continuum certificate. The executable
verifies this exact flat source packet but does not fetch or replay upstream
proofs. SOURCE_MAP.json pins those separately read sources.
25 changes: 25 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/RECONNAISSANCE.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
# Dependency-focused reconnaissance — 29 September 2026

The exact SG/BR/RI project sources were read through the GitHub connector. The
new source applies Harper's geometric proposal and supplies the missing early-
prefix proof; it does not claim invention of transverse-hit persistence, RKHS
reproducing identities, Gaussian regression, Lindelof countability or Tonelli.

Primary-source records read in this pass:

- Martin Hairer, An Introduction to Stochastic PDEs, arXiv:0907.4178v2 (2023
revision). https://arxiv.org/abs/0907.4178 . Abstract and version record only,
not a full-text theorem import. The direction/decomposition proof is displayed
directly in this packet rather than inferred from that abstract.
- C. M. Judd, P. Collins, B. Krauskopf, H. M. Osinga, Tangency bifurcations of
global Poincare maps, University of Bristol working-paper record (2007).
https://research-information.bris.ac.uk/en/publications/tangency-bifurcations-of-global-poincare-maps/
Abstract-level context: global sections can give discontinuous or undefined
return maps despite the local transverse theorem. Its full proof was not read
and no claim here is imported from it.

The broader search also located MIT's Poincare-section lecture notes, but those
notes were not consumed at theorem level. No new Consensus call was made in this
pass; the preceding pass recorded its monthly quota limit. None of these discovery
records is represented as a new analytic review, exhaustive novelty audit, or
proof of invariant-manifold differentiability at the exact C2 topology.
8 changes: 8 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/RESULTS.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
{
"tests_per_mode": 19,
"semantic_mutants_per_mode": 8,
"identical_output_pairs": 9,
"all_intended_failures": true,
"scientific_effect": "NONE",
"continuum_proof_verified_by_code": false
}
53 changes: 53 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/SOURCE_FILES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@
{
"schema": 1,
"files": [
{
"path": "PROOF.md",
"bytes": 25022,
"sha256": "b91b9f792c6322204a0f2a573b2ca76d5c951e49ddd7caa6ffd1abed0aa79e79",
"git_blob": "7e2237063a8dd0120e9d5bd15a3caaa32e8495fa"
},
{
"path": "README.md",
"bytes": 1693,
"sha256": "71e5a4c08e9daa08e331e735a3e7f8c0409da0d4821b70cdd65b573a0d46a387",
"git_blob": "c4746231fa43e1ccd754e2d5f3277b5e268e7aea"
},
{
"path": "RECONNAISSANCE.md",
"bytes": 1577,
"sha256": "f6aeb058052b74a5ef00e893b383b1da9cab78e2e2a95174d9c57f8eca9cbfaa",
"git_blob": "4be5c9d348d884a75bff3f75026f97c530b4a86b"
},
{
"path": "RESULTS.json",
"bytes": 201,
"sha256": "29c96c87073f800fd9104914ab3b2d0625b03bb28ec935ad1b8e09c6704d12ae",
"git_blob": "76c28f9fbe16ba456e431f8dc0866042bc6ee8d4"
},
{
"path": "SOURCE_MAP.json",
"bytes": 1644,
"sha256": "f248f92eca8cfd39f56ff26b23512be4fb14855105e45888d92a13586a5bd03f",
"git_blob": "bcf52b3cd64ab80f7338776888a996f6a6061d1f"
},
{
"path": "charts.py",
"bytes": 4931,
"sha256": "99270bf5959a8534eb53306f572843a3c8d1e89bb669b68bce1a70621aaae74f",
"git_blob": "4096b52c98ae54a8d02753688584d3b2c83a72bc"
},
{
"path": "test_charts.py",
"bytes": 4515,
"sha256": "8b03e49bc885c6bbac392e4bcf23bbf6a2ba20684856eb0bb10b83cec8214644",
"git_blob": "79a28fe42be24cb17512b01c240384ff5f555f8b"
},
{
"path": "verify.py",
"bytes": 4688,
"sha256": "4f0b32879d1502dfdb95b3892e5e7cfa91a7deb3b8e6974e0d98021238791064",
"git_blob": "d83f30056f3453f077a68bc120bf63b3fc1aa64e"
}
]
}
39 changes: 39 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/SOURCE_MAP.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
{
"scientific_effect": "NONE",
"sources": [
{
"id": "SG",
"repository": "d6g8k5htny-coder/main",
"commit": "a1fc9581291b6f81c76c903c96a13955b51f8d54",
"path": "research/q0/sard_g/SARD_G_EXECUTION_REPAIR_20260925.md",
"git_blob": "8f86e0c9ef91fde473e2344a3e461c31f63f8529",
"use": "Explicit predecessor predicate and conditional A2–A4; new source replaces chart/direction/slicing application, not the original file."
},
{
"id": "BR",
"repository": "d6g8k5htny-coder/main",
"commit": "f43f243c54e12c63fc2c23c89c5b2998766f21b7",
"path": "reviews/sard_g_successor_a1_a6_20260926/REVIEW.md",
"git_blob": "9fc61b47c2b4c4bcc3898a6c61a6dcf9cbe1d136",
"use": "Exact AMEND, endpoint and early-contact boundaries, completed-measure qualification, and no dual-separability assumption."
},
{
"id": "RI",
"repository": "d6g8k5htny-coder/Math-",
"commit": "0b0b281989db62ccf3ff5e1327df6f9efda073ea",
"path": "incoming/grok-cycle4-20260926/harper/SARD_G_A1_RELATIVE_INTERIOR_LEMMA.md",
"git_blob": "0ee24f953a4402e58c97ac6d3897eb80d17513a9",
"use": "Harper robust first-interior-hit proposal, now explicitly applied in P1–P4 with a full early-prefix proof."
}
],
"unproved_here": [
"A2-T local branch C1-arc continuity",
"A2-D C1 dependence in C2 field topology",
"A3–A4 directional nonvanishing",
"generic full-measure premise",
"C103 regional Kac–Rice estimates"
],
"upstream_bytes_locally_replayed": false,
"new_nonauthor_review_required": true,
"existing_status_changed": false
}
112 changes: 112 additions & 0 deletions frontiers/sard_g_robust_charts_20260929/charts.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,112 @@
"""Exact finite first-contact and Gaussian-slicing illustrations.

Polyline controls are stricter than the smooth-arc theorem: a certified hit must
lie inside a single affine piece. This is not a numerical ODE or SARD-G verifier.
"""
from fractions import Fraction as F

MUTANT=None

def _data(path, section):
pts=[tuple(F(v) for v in p) for p in path]
lo,hi=map(F,section)
if len(pts)<2 or any(len(p)!=3 for p in pts) or not lo<hi:
raise ValueError('nondegenerate path and vertical section required')
if pts[0][0]!=0 or any(p[0]>=q[0] for p,q in zip(pts,pts[1:])):
raise ValueError('path times must start at zero and increase strictly')
return pts,lo,hi

def closed_contacts(path,section):
"""All first-contact candidates with the CLOSED vertical segment x=0."""
pts,lo,hi=_data(path,section);hits=[]
for i,(p,q) in enumerate(zip(pts,pts[1:])):
t0,x0,y0=p;t1,x1,y1=q
if x1!=x0:
u=-x0/(x1-x0)
if 0<=u<=1 and lo<=y0+u*(y1-y0)<=hi:
hits.append(dict(time=t0+u*(t1-t0),height=y0+u*(y1-y0),
speed=(x1-x0)/(t1-t0),interior_piece=0<u<1,piece=i))
elif x0==0:
if y0==y1:
u=F(0) if lo<=y0<=hi else None
else:
us=sorted(((lo-y0)/(y1-y0),(hi-y0)/(y1-y0)))
left,right=max(F(0),us[0]),min(F(1),us[1])
u=left if left<=right else None
if u is not None:
hits.append(dict(time=t0+u*(t1-t0),height=y0+u*(y1-y0),
speed=F(0),interior_piece=False,piece=i))
return sorted(hits,key=lambda h:(h['time'],h['speed']!=0))

def robust_hit(path,section,tube,margin=F(0)):
pts,lo,hi=_data(path,section);margin=F(margin)
if margin<0 or len(tube)!=4:
raise ValueError('nonnegative strict margin and rectangle required')
xmin,xmax,ymin,ymax=map(F,tube)
if not xmin<0<xmax or not ymin<lo<hi<ymax:
raise ValueError('closed section must lie in open tube')
hits=closed_contacts(pts,(lo,hi))
if MUTANT=='ignore-earlier-closed':
hits=[h for h in hits if lo<h['height']<hi]
if not hits:return False
h=hits[0];tau=h['time'];height=h['height']
if not tau>margin:return False
if MUTANT!='allow-terminal' and not pts[-1][0]-tau>margin:return False
endpoint_ok= min(height-lo,hi-height)>margin
if MUTANT=='allow-endpoint':endpoint_ok=min(height-lo,hi-height)>=margin
if not endpoint_ok:return False
inside_piece=h['interior_piece']
if MUTANT=='allow-terminal' and tau==pts[-1][0]:inside_piece=True
if not inside_piece or not abs(h['speed'])>margin:return False
prefix=[(p[1],p[2]) for p in pts if p[0]<tau]+[(F(0),height)]
if MUTANT!='skip-tube':
if not all(min(x-xmin,xmax-x,y-ymin,ymax-y)>margin for x,y in prefix):return False
return True

def chart_hits(paths,section,tube):
paths=list(paths)
if not paths:raise ValueError('at least one declared hit required')
if MUTANT=='skip-local':paths=paths[-1:]
return all(robust_hit(p,section,tube) for p in paths)

def gradient_slack(minimum,eta):
minimum,eta=F(minimum),F(eta)
if eta<=0:raise ValueError('positive exclusion threshold required')
return minimum>=eta if MUTANT=='nonstrict-gradient' else minimum>eta

def gaussian_split(Q,a):
"""Rational unstandardized form: xi=a.F, b=Qa/Var(xi), g=F-b xi."""
a=list(map(F,a));Q=[list(map(F,row)) for row in Q];n=len(a)
if n==0 or len(Q)!=n or any(len(row)!=n for row in Q):
raise ValueError('matching square covariance and vector required')
if any(Q[i][j]!=Q[j][i] for i in range(n) for j in range(n)):
raise ValueError('symmetric covariance required')
v=[sum((Q[i][j]*a[j] for j in range(n)),F(0)) for i in range(n)]
var=sum((a[i]*v[i] for i in range(n)),F(0))
if var<=0:raise ValueError('positive scalar variance required')
b=[x/var for x in v]
R=[[Q[i][j]-(0 if MUTANT=='leave-covariance' else v[i]*v[j]/var)
for j in range(n)] for i in range(n)]
return var,b,R

def rank(A):
M=[list(map(F,row)) for row in A]
if not M:return 0
if any(len(row)!=len(M[0]) for row in M):raise ValueError('rectangular matrix required')
k=0
for j in range(len(M[0])):
pivot=next((i for i in range(k,len(M)) if M[i][j]),None)
if pivot is None:continue
M[k],M[pivot]=M[pivot],M[k]
z=M[k][j];M[k]=[v/z for v in M[k]]
for i in range(k+1,len(M)):
z=M[i][j];M[i]=[v-z*w for v,w in zip(M[i],M[k])]
k+=1
if k==len(M):break
return k

def regular_zero(coefficients,x):
coeff=list(map(F,coefficients));x=F(x)
value=sum((a*x**i for i,a in enumerate(coeff)),F(0))
deriv=sum((i*coeff[i]*x**(i-1) for i in range(1,len(coeff))),F(0))
return value==0 and (True if MUTANT=='count-singular-zero' else deriv!=0)
Loading
Loading