Skip to content
Open
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
44 changes: 44 additions & 0 deletions research/sharp-finite-gaussian-outward-slack/CHECKSUMS.sha256
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
ae9947ad6c97d0a3808a52fc9f8c07e5d070c0925dfbbe00ed3cd163118e5558 NOTICE.md
759c4548e32944514385927d803d75d18bf463b9f422b3d883e09a67654bb499 OPEN-NEXT-QUESTIONS.md
ba7a1125ae2c502e5f90de0214b37eefe03762818621f63891434b80d1250ef3 PR-DESCRIPTION.md
9650647a4713b7c35e9a61834578ca0d83ec960a5d5eb666f37b906a91a7f1e6 PR-DRAFT.md
d00460ebf9579c49ae711079e3a21865571d82e7e42f8fc6bc11a08cf062f09b PROOF.md
d26f615aacff4b082c316e491aa1730aabc9cb6ceb377d33fb9a279b2d7f5f16 R5-OPTIMUM.json.gz
5e9c83e394d36a50a5cbec65acdf8a033df8c6c9a8752b19f02d34dbc057bb8b README.md
87ee11560e99e440fa47d0fb5f6799e8e85a100b8467b284605e58ef306fd1ce RESULT.json
58359532905649cd8c57f9400ae8e6858174a882e3be81824e063a714a1cd9e2 SEARCH-PROVENANCE.md
e010d96e3b44bb10a0dddbbff66fb00dcd316e620b8feebd0e8477a84e0b1d51 SOURCES.json
f1ea9f91bf0f6517b30e278e2ae32bb8b23d4a451901eaae5a0ed652d1d5689c REPRODUCTION.json
a9e2c39ce39cfbc0327eed29bd249d1e7f02fe71c7847e9eeefac4e2b232de79 VERIFY.md
4c4647f16eb79881c324025c4e3a94d98b10750c12d345f730fed46c7569573c compact-hall/ORBIT-FLOW-RESULT.json
c0a9ee164d3a466a4b3996e1075ef7443123ac5e99b0e4e9e05585411352ad21 compact-hall/PROOF.md
224e4d93827ce23b89d8d5d4215875da9329d0b3b13469d4af1552b030ddb121 compact-hall/README.md
66e617085db593449e7204f94b438f4e9467095b6fdef4d8092a2cefdde888ef compact-hall/RESULT.json
5649af07ec67b10ca76b625250fe51e698fb2bb5ec25a82eaaaaaec5ca63dfdd compact-hall/SOURCES.json
0fc0f192cf541a3c94f87bb454187ca297e6ff28cbbd472126b6eba4bcc7275b compact-hall/check.py
98b2238a224aec3fbb35adb634b30ae00f7e7740293f06679c65b6c308029b9d compact-hall/orbit_cut.py
36a53de8d0fdb7527b3c81903c9d586858e6db5b92badd364d11d613d65cf674 orbit-extension/CHECKSUMS.sha256
2cc3e738fe82ef0905d60da810497b1e5d27c0d4a69c9bd45b74921bee4de765 orbit-extension/FREEZE.md
d3656b0679dcfd9d8935d2175987a722f7266f75599537d4b8154a40262e52d1 orbit-extension/NOTICE.md
b23eef8709c7a5027d0dc77134cc4a9b0d65bdf7d664b426030d1c0875c08154 orbit-extension/OPEN-NEXT-QUESTIONS.md
27399559bdbe52e425dc169c3f58a6ce7581b33fd3be2457df46c9e9d94e5749 orbit-extension/PROOF.md
32c828d75871bfd812109d957f738427cc6f5e85db4835e5e0c293390bff5d00 orbit-extension/README.md
f6b3c5be0fd3e619dbbc44496ebef11d0f06ff5f5c1364e854020505baac85ef orbit-extension/RESULT.json
16a763b3369614f511778b47a871550a638852a5541fc6526beb1e175271f631 orbit-extension/SEARCH-PROVENANCE.md
31d13db28c45e7a6247798c838188b7e8949f9a0b5bd3703c40cc114967020ac orbit-extension/SOURCES.json
c3eea3f6c9786406cb2448e25f388a140ee782175eb16225e58590f9cf2c5fd4 orbit-extension/sweep.py
2bbcd0c87545bbb8054e52cd8dd15bd142031a4bc49bae104e4ed208de4709e4 orbit-extension/verify.py
10b3c29f75e36d26bdf1f819554fb1181774121b9defca6c17b0e0a9212176e7 replay.py
bac3b64005d0abe9124bfc753921f83f465b3915c22272e1168d005c07414094 review/PUBLICATION-REPLAY.json
f95b0ea46f4a724b78d7b2b30fab91628e2a18ab3bd875ec077f06522a5363b1 review/REMOTE-SOURCE-CHECK.json
f649acf266eedbb89d41508997be6905d19e0194207154574aea56e711a3bbda review/RESULT.json
6b50f9c8213ed49bb9e60362ea9aee909b29b9af9123ec6aefba8032b781ba58 review/ROOT-REVIEW.md
c43187b011400e8141b6ed86f8adc24587e3c320f7f56933809294f0bfb3c76f review/check_full_matching.py
68899512d88b253dfb42978e3aa450d2f6a424ce8265757625e92075a18663f3 review/extension/FULL-POINT-RESULT.json
81a82d848e14881e743d77e43f28c599c37111b16138fa38c88d386c849bd1d5 review/extension/PUBLICATION-REPLAY.json
4919c129ac90751d5105b73c1e4a00af9b72d9610fb872ba7ecf76d83f80a67f review/extension/R9-RESULT.json
14ece9c6caa845521d19aac8fd814c066829585a9f22f7dfc850a74c8407c383 review/extension/ROOT-REVIEW.md
a7028b653052c0b5df9a205dda0877d3ced9e2eec1767eb5bc36e981f25c5394 review/extension/check_full_certificates.py
e40896d2603f8ce660f6949710bfc7782f966d4da57ccffbe18f0a295e5d18a5 review/extension/check_full_r9.py
114e3bf3197c618aa17faf8d2d232a3d52ba8d973cf7514f6edd55c1f973f0af review/extension/full_graph_library.py
611124563b42ec1c20d4755d190a850d1deac5ed743d6f98094ec97f7d893190 verify.py
14 changes: 14 additions & 0 deletions research/sharp-finite-gaussian-outward-slack/NOTICE.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
The R5 candidate certificate is retained byte-for-byte from the
@CubeJerry workstream input pinned in `SOURCES.json`. That candidate work was
prepared with substantial OpenAI assistance. `verify.py`, `replay.py`, the
compact Hall supplement, the independent finite proof, and this package
documentation were also prepared with substantial OpenAI Codex assistance.

Predecessor credit: Nick Petalas (#6619 and its cited #2589 finite-sphere
predecessor) and Ali Romman (#6509). The #6509 proof and #6619 proof are
identified by exact commit, Git blob, and SHA-256 in `SOURCES.json`. No
upstream source code is copied into this package. Canonical base:
`e54523517d0f03e58352e647c403a5af3e525a57`.

This note does not claim a new `kappa`, global sufficiency at the finite
threshold, or any change to the selected conditional multiplication result.
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
# Open next questions

## Global outward-slack infimum at error one

For global injective integer-output maps rounding the ideal #6509 Gaussian
pair with uniform Euclidean error at most one, what is the infimum of the
outward norm slack, and is a global map attaining it possible?

The current necessary lower bound is \(\sqrt{78}-\sqrt{73}\), from the
radius-nine Hall obstruction. The inherited #6509 map gives upper bound one.
The original R5 proof remains a smaller, compact obstruction. The four later
finite upper certificates do not supply a global construction.

A useful next step is a global matching construction, a uniform Hall proof,
or a stronger necessary bound under the same hypotheses. A map must retain
injectivity and the error bound on the entire lattice; pointwise selection,
finite success and a limit guessed from small radii are insufficient.

## Finite domains and interfaces

The exact radius-8 optimum and larger radii beyond11 were not determined.
Radius10 follows by inclusion from the equal radius9/radius11 values, without
a separate computation. The bounded sweep does not prove a formula for all
radii. Other error caps and operators, an efficient global selector, actual
physical caller admission, and selected multiplication precision recovery
remain outside this package's conclusions. No selected kappa changes.
79 changes: 79 additions & 0 deletions research/sharp-finite-gaussian-outward-slack/PR-DESCRIPTION.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,79 @@
# Prove exact finite Gaussian rounding thresholds with compact Hall witnesses and independently checked orbit-flow certificates

## Exact result and why it matters

For injective integer-output rounding of H4/2 with uniform Euclidean error
at most1, the complete radius-five lattice ball has exact optimal outward
slack `sqrt(21)-sqrt(19)`. The exact optima are `sqrt(31)-sqrt(28)` on
radii6 and7, and `sqrt(78)-sqrt(73)` on radii9 and11. Radius10 follows by
inclusion, without a separate computation. The explicit signed-permutation
identity `H4=L(2C+)R` transfers these results to the ideal Gaussian pair of
#6509 and its conjugate.

Thus any global injection under these error hypotheses needs outward slack
at least `sqrt(78)-sqrt(73)`. The available global interval is
`[sqrt(78)-sqrt(73),1]`; the upper endpoint is inherited from #6509.
Finite injections do not establish global attainment.

## What changed and novelty relative to predecessors

#6619 raises the rational norm-rounding question and credits #2589's
finite-sphere method; #6509 supplies the Gaussian map and a global error-one
construction. This package supplies exact finite optima and a necessary
global lower bound without period, conserved-sum or equivariance premises
on the unknown rounder. Classical Hall and symmetry facts are credited as
such; the explicit certificates and source-bound transfer are the new work.

The radius-five lower bound has a short two-exclusion proof. Remove the
signed coordinate orbits(0,0,3,3) and(0,1,3,3) from the squared-norm19 ball,
obtaining1,777 points. Add the32 positive-product permutations of(2,2,2,3),
obtaining1,809 inputs; every error-one neighbor below the strict threshold
lies in the1,777-point set. Only38 input-orbit representatives need checking.

The extension gives reusable positive flow and Hall-cut certificates on
paired W(D4) orbits. Biregularity, rather than complete bipartite adjacency,
lifts a saturated quotient flow to a fractional matching and then an actual
finite injection. At radii6/7 the strict Hall sizes are3,569/3,537; at9/11
they are23,561/23,497. Full orbit predicates and exact capacities are retained.
This extends the same mathematical package and does not create a separate
PR for each finite radius.

## Reproduction and independent checks

Canonical base: `e54523517d0f03e58352e647c403a5af3e525a57`.
Original verified R5 package: `9c75d0b4b6e1cfe74694edf52f2f238a741bbaf5`.

```sh
python3 -I -W error -B research/sharp-finite-gaussian-outward-slack/verify.py
python3 -I -W error -B research/sharp-finite-gaussian-outward-slack/compact-hall/check.py
python3 -I -W error -B research/sharp-finite-gaussian-outward-slack/orbit-extension/verify.py
python3 -I -O -W error -B research/sharp-finite-gaussian-outward-slack/orbit-extension/verify.py
python3 -I -W error -B research/sharp-finite-gaussian-outward-slack/review/extension/check_full_certificates.py
python3 -I -W error -B research/sharp-finite-gaussian-outward-slack/review/extension/check_full_r9.py
```

These standard-library commands are read-only. Normal/optimized search and
verification receipts agree. The independent full-point checker reconstructs
all1,551,060 candidate edges over the four extension domains, checks actual
point-count orbit capacities, positive-flow conservation and complete Hall
neighborhoods, and imports no author generator or radical comparator. It
rejects changed flows, missing neighbor orbits and strict/inclusive boundary
confusion. A separate full-vertex radius-nine matching has32,633 inputs,
strict maximum32,569 and full saturation when equality edges are admitted.
Its different Hall set has23,057 inputs and22,993 outputs, agreeing on
maximum deficiency64. The original certificate, compact checker and source
transfer also retain their corruption and tie controls.

## Limitations, kappa and credit

This is a scoped rounding obstruction and exact finite verification package.
It supplies no global map at the lower endpoint, unrestricted forward1/2
bound, selected caller admission or physical rounding tariff. It does not
reject the selected exact-layer route. **No new kappa; all five multiplication
assumptions remain.** Selected conditional kappa is `0.00363005817`.

Prepared for @CubeJerry with substantial OpenAI Astra/Sol/Luna assistance in
candidate construction, proofs, code and independent checking. Credit Nick
Petalas (#6619), ywz65 (#2589), Ali Romman (#6509), and the retained source
authors in SOURCES.json and NOTICE.md. Independent AI implementations are
not human review or formal-kernel acceptance. No upstream PR is submitted.
45 changes: 45 additions & 0 deletions research/sharp-finite-gaussian-outward-slack/PR-DRAFT.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
# Draft PR title

Prove the sharp finite R5 Gaussian outward-slack threshold

## Draft description

This package establishes the exact finite optimum
\(\sqrt{21}-\sqrt{19}\) for injective integer-output maps on the complete
radius-five ball \(S_5\), with Euclidean error at most one for the Sylvester
Hadamard transform \(H_4/2\). The compact certificate contains a full
3,121-input injection and a 1,692-input set whose complete strict-threshold
neighborhood has only 1,691 outputs. The independent standard-library checker
recomputes both sides of the optimum using exact integer and radical
comparisons.

The identity \(H_4=L(2C_+)R\), where \(L\) and \(R\) are signed
permutations, transfers the result to the actual #6509 ideal Gaussian pair.
This gives a necessary global lower bound at error cap one. #6509's inherited
global construction and the triangle inequality provide an upper bound of
one, so the unrestricted global infimum is currently only bracketed by
\([\sqrt{21}-\sqrt{19},1]\). No global construction at the lower endpoint is
claimed.

The lower-bound witness also has a short certificate-independent description
in `compact-hall/PROOF.md`: delete the \((0,0,3,3)\) and \((0,1,3,3)\)
\(W(D_4)\) orbits from the squared-radius-19 ball and add the
positive-product \((2,2,2,3)\) orbit. This gives 1,809 inputs whose complete
strict-threshold neighborhood is contained in a 1,777-point set. A standalone
checker regenerates the 38 orbit representatives and all 9 or 16 possible
error-one outputs per representative without reading the matching or Hall
list. The quotient min-cut replay independently confirms equality and
deficiency 32.

Canonical base: `e54523517d0f03e58352e647c403a5af3e525a57`. Exact hashes for
the candidate input and predecessor proofs are in `SOURCES.json`. Reproduce
the upper matching with `python3 -B verify.py`; check the standalone lower
bound with `python3 -B compact-hall/check.py`; replay the quotient flow with
`python3 -B compact-hall/orbit_cut.py`. The normal and optimized commands
all pass. Default runs are read-only.

Credit @CubeJerry for the candidate workstream input; this package and the
candidate work were prepared with substantial OpenAI assistance. Credit Nick
Petalas (#6619, including its cited #2589 finite-sphere predecessor) and Ali
Romman (#6509) for the predecessor results. No new `kappa`, selected-frontier
change, or global sufficiency theorem is asserted.
150 changes: 150 additions & 0 deletions research/sharp-finite-gaussian-outward-slack/PROOF.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,150 @@
# Sharp finite radius-five Gaussian outward slack

## Theorem

Let

\[
S_5=\{x\in\mathbb Z^4:\|x\|_2^2\le25\},\qquad
U=H_4/2,
\]

where

\[
H_4=\begin{pmatrix}
1&1&1&1\\
1&-1&1&-1\\
1&1&-1&-1\\
1&-1&-1&1
\end{pmatrix},\qquad H_4^T H_4=4I.
\]

For an injection \(F:S_5\to\mathbb Z^4\), require the pointwise error
\(\|F(x)-Ux\|_2\le1\), and define its outward slack by

\[
\Delta(F)=\max_{x\in S_5}(\|F(x)\|_2-\|x\|_2).
\]

The minimum of \(\Delta(F)\) over these finite injections is exactly

\[
\beta=\sqrt{21}-\sqrt{19}.
\]

The same \(\beta\) is a necessary lower bound for the global outward slack of
any injective integer-output map on \(\mathbb Z^4\) with uniform error at most
one for \(U\). By an exact signed-permutation transfer, this applies to the
actual ideal Gaussian pair map \(C_+\) from #6509 and, by conjugation, to
\(C_-\). The global infimum at error cap one is only bounded here by
\([\beta,1]\); this note does not construct a global map attaining \(\beta\).

## Finite proof

The compressed certificate [R5-OPTIMUM.json.gz](R5-OPTIMUM.json.gz) is the
byte-exact expansion of the pinned R5 input in `SOURCES.json`. It contains a
pair \((x,F(x))\) for each point of \(S_5\), together with a Hall input set
\(T\) and its claimed strict-\(\beta\) output neighborhood. The checker
`verify.py` uses only the standard library and does not import the search,
constructor, or earlier author checker.

First, it independently enumerates \(S_5\) and verifies the 3,121 listed
pairs. It checks that each input appears once, outputs are distinct, the
integer numerator of each squared error is at most four, and every outward
increment is at most \(\beta\). All square-root comparisons use integer
arithmetic: comparing \(\sqrt m-\sqrt n\) with \(\sqrt a-\sqrt b\) is
reduced to comparing the nonnegative sums \(\sqrt m+\sqrt b\) and
\(\sqrt a+\sqrt n\), then resolved by sign-aware integer squaring. Fifty-eight
matching edges attain \(\beta\), with squared input and output norms 19 and
21, so this injection has \(\Delta(F)=\beta\).

For the lower bound, the certificate gives \(|T|=1,692\). For every \(x\in
T\), the verifier enumerates all integer outputs \(y\) satisfying
\(\|y-Ux\|_2\le1\). It uses the exhaustive coordinate interval

\[
\left\lceil\frac{(H_4x)_i-2}{2}\right\rceil
\le y_i\le
\left\lfloor\frac{(H_4x)_i+2}{2}\right\rfloor
\]

and retains a candidate exactly when
\(\sum_i(2y_i-(H_4x)_i)^2\le4\). It then filters by the exact strict
condition \(\|y\|_2-\|x\|_2<\beta\). The complete union of these strict
neighbors has 1,691 outputs, exactly the certificate's declared set. Thus
Hall's inequality rules out an injection even at every threshold below
\(\beta\). Together with the matching at \(\beta\), this proves the exact
finite optimum.

This lower-bound argument uses only a subset of the inputs and the complete
set of their allowed outputs. In particular, no search history or assumption
about a matching algorithm is part of the proof. The verifier also confirms
that if equality at \(\beta\) is incorrectly admitted into the Hall graph,
the neighborhood grows to 1,719 outputs; the strict inequality is essential.

The same strict graph has a shorter, certificate-independent invariant Hall
witness. The set \(T_1\) has 1,809 inputs and its complete strict-\(\beta\)
neighborhood lies in the explicitly described 1,777-point set \(N_1\), so
it gives deficiency at least 32. Its two-exclusion orbit formula, exact
representative check, and full quotient min-cut are in
[compact-hall/PROOF.md](compact-hall/PROOF.md). This supplement does not
replace the matching witness needed for the upper bound.

## Transfer to the actual pair map

In real coordinates \((\Re x,\Im x,\Re y,\Im y)\), the numerator matrix for
the ideal pair \(2C_+\) is

\[
2C_+=\begin{pmatrix}
1&-1&1&1\\
1&1&-1&1\\
1&1&1&-1\\
-1&1&1&1
\end{pmatrix}.
\]

Define the signed permutations

\[
R(a,b,c,d)=(a,-b,c,d),\qquad L(a,b,c,d)=(a,c,-d,b).
\]

Direct integer multiplication gives

\[
H_4=L(2C_+)R.
\]

Therefore \(H_4/2=L C_+R\). If \(F_C\) is a pair map for \(C_+\), then
\(F_H(x)=L F_C(Rx)\) is the corresponding map for \(H_4/2\). In the other
direction, \(F_C(x)=L^{-1}F_H(Rx)\), since \(R^{-1}=R\). These transformations
preserve the integer lattice, the complete input ball, injectivity, error,
and both input and output norms. Complex conjugation is another signed
permutation and transfers the result to \(C_-\). The checker verifies the
matrix identity and signed-permutation conditions exactly.

Consequently any global injective \(C_+\) or \(C_-\) rounder with error at
most one has outward slack at least \(\beta\), by restriction to the
transferred copy of \(S_5\). The #6509 source supplies a global bijective
rounder with error at most one; the triangle inequality gives outward slack
at most one. Thus the global infimum lies in \([\beta,1]\), conditional on
that inherited #6509 construction. This package proves no global sufficiency
below one.

## Scope and predecessor credit

The R5 matching and Hall set were supplied as candidate data by the current
@CubeJerry workstream. This package independently checks the finite claim and
the native-pair transfer. Its exact source hashes, author context, and
canonical base are in `SOURCES.json`.

Nick Petalas's #6619 studies radial error and norm contraction for rational
orthogonal maps; it cites ywz65's finite-sphere argument in #2589. Ali
Romman's #6509 supplies the ideal pair map, its inverse, and its global
error-one construction. Those are credited predecessor results. The finite
R5 Hall obstruction and its exact transfer are the claim established here.
The package makes no claim about other radii, other error caps, global
attainment at \(\beta\), a new \(\kappa\), or a change to the conditional
multiplication frontier.
Loading
Loading