MathIdeasResearch in progressRepository ↗
← Research catalogOriginal Markdown ↓

Ten selected definition interfaces reviewed at source level

The preserved observations cover all 10 configurations and 65 declared entries in the initial static queue. No intended-model mismatch was detected in these selected comparisons. Zero entries remain pending in this queue; imported semantics, complete proofs, independent kernel acceptance and executable program correspondence remain unverified. No source compilation was run.

The previous 41-entry edition remains preserved. Twenty-four observations were added:

Configuration Entries Application boundary
DefocusingNLS 3 Infinite Fourier convolution/free flow/odd power; finite circular FFT aliasing is a separate model bridge
ElementaryPositivity 1 Returned witness includes expansion proof for every color count, despite empty theorem_names
EuclideanFiveColor 1 All plane points and exact unit distances; weak measurable coloring and a finite planning graph differ
Naimark 7 Actual nonseparable C*-algebra/state/representation predicates; no sampled-matrix construction
OccupiedOverlap 5 Genuine Specht action and complete multiplicity-copy squared operator-norm sum
Rokhlin 4 One invertible probability action and asymptotic diverging gaps; no finite rate
SpinAngle 3 Occupied-row geometry factor plus actual signed type projections and consistent sizes

No definition hole is treated as proof failure. Source observations complement Comparator's structural checks and its explicit intended-semantics boundary; see Comparator documentation. The earlier lexical Logspace control remains source-text evidence only.

Concrete follow-through

Sparse Fourier aliasing reference passed 110 finite controls. On u=e^(-ix)+e^(ix), cubic multiplication with a three-point grid adds a phantom constant 2; five points preserve the retained band but lose full reconstruction, while seven recover the full cubic. The twelve-dimensional axis fixture is an operation-semantic control, not a selected blowup-power or PDE solver certificate.

Next inspect trusted import closure and selected proof/program obligations, prepare concrete ten-claim expert comparison inputs, and continue manuscript reviews. All proof/checker claims remain pending until the relevant tools actually run and their outcomes are recorded.