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
20 changes: 20 additions & 0 deletions research/affine-period-outward-slack/CHECKSUMS.sha256
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
cf2799f914127a3c6b74db62afeaa2482cf7b5ac159aac186d0d17ee6104a1f6 NOTICE.md
c069671740452e1276ae4d0bb33967e74fc52f043268ca0f97d6d1c6349e8766 PR-DRAFT.md
e96399c06b577e2e9308aef387c15944b88012b6e6835a87bd75e12a05f034e5 PR-TITLE.txt
7eae173d7223d473d574c87bbdae6fad4fb857559a8cc717304bdbdebaa1eb7d PROOF.md
2f3f3fcfd5e23165b4b8b7dc585f7c96903fe7eebc115033e394179626fa9469 PUBLICATION-MANIFEST.json
d411866b2e6f3feb28043d695a7aee96b30a6201ad675419f044cfb4943a0bfc README.md
0fc96cc4f7f04a5de9c224ab1e516c3d3d9b70700b41da7fb646e7a629102bf9 RESULT.json
ba3157cea93750cc40a060e06af11da25f8d1b0e51eeea56636c94ce2c8abe8e SOURCE-NOTICE.md
5316820f28df712e374365bb7aacf60e4a8de7a018911e68ba4fe915d952859b SOURCES.json
c392c163eb22f23dc7085b8bc1e81343031cafa1329b610a77133282a0fd97b7 REPRODUCTION.json
fc3e2bf828fa547bee5710f9d5502b7c8c4dcb4cab7536ff73e3dbff54960f1b kernel.py
419a231716a7f8679deb9faba7f44a3233912bc7296a1521d4fb9b546dca38f7 reproduce.py
fb7725008661c5a3f788f9ca6428db77fa8fad620477d135250400fd3cae452b review/AUTHOR-OPTIMIZED-REPLAY.json
fb7725008661c5a3f788f9ca6428db77fa8fad620477d135250400fd3cae452b review/AUTHOR-REPLAY.json
6e0e2186fd1e684b353bc444303218bea24a9833dec7157e24ab7f14ad3ebbdc review/PUBLICATION-ROOT-REPLAY.json
c6e2a0e25bf481a2f77e5f3381fc6645406d1487440e025e5ecbcb7b8a9a73bd review/README.md
6e0e2186fd1e684b353bc444303218bea24a9833dec7157e24ab7f14ad3ebbdc review/RESULT.json
c9d738ae5d96f74cc17c552a53cb69560aa30e78cfae81cfb79a3011f4fbf97c review/ROOT-REVIEW.md
d06a6eced4cd0ce7e63a989e3f3d14f55bba31c3821a5a4fced7b0ce99618416 review/SOURCE-BINDING.json
ea2c2e0bbdc992adeeb4a5df35e7492d4144bfe067622d726494ebeacb3d9214 review/check_norm_slack_root.py
13 changes: 13 additions & 0 deletions research/affine-period-outward-slack/NOTICE.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
The unchanged `kernel.py` is copied from Ali Romman's #6509 source snapshot,
with substantial OpenAI Codex assistance; its original notice is preserved in
`SOURCE-NOTICE.md`. It remains under the upstream Apache-2.0 notice.

The new affine-period/fiber proof and this small replay were prepared with
substantial OpenAI Codex assistance. No implementation, table, or checker is
copied from #6534, #6536, #6438, or #6758; those source results retain their
original authorship and are used only as pinned mathematical premises for the
stated corollaries.

Credit retained: Ali Romman (#6509, #6534, #6536); Nick Petalas (#6438, #6619);
CubeJerry (#6758); and the finite-sphere predecessor PR #2589, cited by #6619.
Apache-2.0.
37 changes: 37 additions & 0 deletions research/affine-period-outward-slack/PR-DRAFT.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
# Draft PR title

Prove exact outward norm slack from affine periods and classify the conserved-sum Gaussian pair family

## Draft description

This scoped research package proves an exact outward-slack identity for
rational orthogonal integer maps with a full-rank affine period. It also
proves the identity fiberwise for every legal bounded center rule in Ali
Romman's #6509 sum-preserving Gaussian pair family, even though the retained
sign-based rule is not globally affine-periodic. The minimum family slack is
one, and the `c(1)=1` ray has the explicit gap bounds in `PROOF.md`.

The note applies the same lemma to inherited source results: #6534's sharp
two-axis error, #6536's sharp matched three-axis error, Nick Petalas's #6438
five-seed rotation, and @CubeJerry's #6758 native forward/inverse theorem.
Those applications derive radial outward-slack values from pinned periods
and error bounds; they do not reverify source tables or certificates.

Base: canonical main `e54523517d0f03e58352e647c403a5af3e525a57`. Exact proof
and kernel pins, including Git blob IDs and SHA-256 digests, are in
`SOURCES.json`. The unchanged #6509 kernel replay passes 72 signed ray inputs
through `t=2^256`, literal inverse checks, dyadic unit-ball witnesses for
`p=1..64`, and source/assumption negative controls. Run
`python3 -B reproduce.py`; the receipt is emitted to stdout. `RESULT.json`
changes only with explicit `--write-result`.

Credit Ali Romman (#6509, #6534, #6536), Nick Petalas (#6438, #6619), @CubeJerry
(#6758), and the finite-sphere predecessor #2589. The new proof and replay
were prepared with substantial OpenAI Codex assistance; `SOURCE-NOTICE.md`
preserves the #6509 notice.

This is not a new κ result or a change to the selected frontier. All five
global assumptions of the current conditional multiplication theorem remain
as stated. The unrestricted #6619 outward-slack question remains open; the
note establishes neither global optimality for arbitrary maps nor a physical
implementation or tariff.
1 change: 1 addition & 0 deletions research/affine-period-outward-slack/PR-TITLE.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
Prove exact outward norm slack from affine periods and classify the conserved-sum Gaussian pair family
202 changes: 202 additions & 0 deletions research/affine-period-outward-slack/PROOF.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,202 @@
# Exact outward slack from affine periods and sum fibers

## Scope and notation

All norms below are Euclidean. A supremum is over an unbounded integer lattice;
no finite input cutoff is implicit. The pair specialization uses
`G = Z[i]`, identifies `G^2` with `Z^4`, and uses the norm
`||(x,y)||^2 = |x|^2 + |y|^2`.

## Full-rank affine-period theorem

Let `U` be a rational orthogonal `d x d` matrix, `F: Z^d -> Z^d`, and
`Lambda <= Z^d` a full-rank sublattice. Suppose

```text
F(x + lambda) = F(x) + U lambda for all x in Z^d, lambda in Lambda.
```

Then

```text
sup_x (||F(x)|| - ||x||)
= max_[x] in Z^d/Lambda ||F(x) - Ux||.
```

Proof. Put `e(x)=F(x)-Ux`. The period law makes `e` constant on each
coset. The quotient is finite because `Lambda` has full rank. On a coset with
error `e`, orthogonality and the triangle inequality give

```text
||F(x)|| - ||x|| = ||Ux+e|| - ||Ux|| <= ||e||.
```

If `e=0`, this bound is attained as equality. Otherwise `v=U^T e` is a
nonzero rational vector. Choose an integer `q>0` clearing its denominators and
an integer `m>0` with `m Z^d <= Lambda`; then `lambda=m q v` belongs to
`Lambda`. For a coset representative `x0`, set `xn=x0+n lambda`. Since
`U lambda=m q e`,

```text
||F(xn)|| - ||xn||
= ||Ux0 + (n m q + 1)e|| - ||Ux0 + n m q e|| -> ||e||.
```

Thus each coset supremum is its error norm, and the finite quotient turns the
supremum over all inputs into the stated maximum. No injectivity, inverse,
nonexpansion, or rounding rule is assumed. Full rank, orthogonality, an
unbounded domain, and the affine-period identity are substantive hypotheses.

Rationality of `U` may be retained as a convenient hypothesis, but follows
from the others: for an integer basis matrix `B` of `Lambda`, the period law
implies `UB=F(x+B)-F(x)` has integer columns, so `U=(UB)B^-1` is rational.

## The entire bounded-center pair family

Fix `sigma` in `{+1,-1}` and any bounded center rule `c: G -> G` satisfying
the exact output-parity condition

```text
Re(c(s)) + Im(c(s)) = Re(s) + Im(s) (mod 2).
```

This is the legal-center condition proved in #6509. For `s=x+y` and `d=x-y`,
define the ideal orthogonal pair operator and the rounded map by

```text
C_sigma(x,y) = ((s + sigma*i*d)/2, (s - sigma*i*d)/2)
F_(c,sigma)(x,y)
= ((s + sigma*i*d + (1-sigma*i)c(s))/2,
(s - sigma*i*d - (1-sigma*i)c(s))/2).
```

`C_sigma` fixes the sum and multiplies the difference by `sigma*i`; its
adjoint is `C_-sigma`. On the fiber with sum `s`, the error is constant:

```text
e_s = ((1-sigma*i)c(s)/2, -(1-sigma*i)c(s)/2),
||e_s|| = |c(s)|.
```

The fiber is an affine copy of the full-rank tangent lattice
`T={(z,-z): z in G}`. Define

```text
lambda_s = 2 C_sigma^* e_s
= (-(1+sigma*i)c(s), (1+sigma*i)c(s)).
```

This is an integral Gaussian pair with sum zero, and `C_sigma lambda_s=2e_s`.
For every fixed `s`, the triangle inequality bounds the fiber's outward norm
increment by `|c(s)|`. If `c(s) != 0`, take any `X0` on the fiber and
`Xn=X0+n lambda_s`. Then

```text
C_sigma Xn = C_sigma X0 + 2n e_s,
F_(c,sigma)(Xn) = C_sigma X0 + (2n+1)e_s,
```

so the fiber supremum is exactly `|c(s)|`. For `c(s)=0`, the map is
orthogonal on that fiber and the same value zero holds. Taking the supremum
over all sums gives the exact family formula

```text
sup_(x,y) (||F_(c,sigma)(x,y)|| - ||(x,y)||) = sup_s |c(s)|.
```

This is a fiberwise argument; the center may depend on `s` and need not make
the full map affine-periodic on one global full-rank lattice.

For every legal rule, an odd-parity sum such as `s=1` requires
`Re(c)+Im(c)` odd. Thus `c(s)` is nonzero there and `|c(s)| >= 1`; no legal
rule has uniform outward slack below one. #6509's rule has `c=0` on even
parity sums and chooses a Gaussian unit on odd parity sums, so it attains
`sup_s |c(s)|=1`. The minimum outward slack over the whole bounded-center
family is therefore exactly one, independent of the sign `sigma`.

## Exact ray for the retained #6509 kernel

For `sigma=+1`, `s=1`, and the source rule's `c(1)=1`, the base point
`X0=(1,0)` has the legal tangent increment `lambda_1=(-(1+i),1+i)`. At
integer `t>=0`,

```text
Xt = (1-t-it, t+it),
F(Xt) = (1+t-it, -t+it),
||Xt||^2 = 4t^2 - 2t + 1,
||F(Xt)||^2 = 4t^2 + 2t + 1.
```

For `t>=1`, let `g_t=||F(Xt)||-||Xt||`. Then

```text
g_t = 4t / (sqrt(4t^2+2t+1) + sqrt(4t^2-2t+1)),
(32t^2-2)/(32t^2+1) < g_t < 1.
```

For the lower bound, put `a=2t+1/2` and `b=2t-1/2`. For positive `z`,
`sqrt(z^2+3/4) < z+3/(8z)`. Hence the denominator above is strictly less
than `4t + 6t/(16t^2-1)`, which gives the displayed lower bound. For the
upper bound, `4(4t^2-2t+1) > (4t-1)^2`, so
`2 sqrt(4t^2-2t+1)+1 > 4t`, equivalent to `g_t<1`.

There is also a closed-unit-ball witness at every dyadic scale. Put
`h=2^-p`, `t=2^(p-1)` for integer `p>=1`, and interpret the integer-grid
kernel inputs and outputs multiplied by `h`. The exact squared norms are

```text
input: 1 - h + h^2 <= 1,
output: 1 + h + h^2 > 1.
```

The executable check below runs the unchanged integer-grid kernel on finite
members of both witness families. The all-size conclusions above follow from
the algebra, not from these runs.

## Source-bound consequences and limits

The exact #6534 two-axis map has a full-rank affine period relative to its
unitary ideal map and sharp uniform error `sqrt(2) h`; the theorem therefore
identifies its outward norm supremum as `sqrt(2) h`. The exact #6536
three-axis matched-coset map has its full-rank source-class period and sharp
uniform error `2h`; its outward norm supremum is `2h`. These are corollaries
of the pinned source theorems, not fresh table or matching checks.

The #6438 five-seed rotation has period `5 Z^2` relative to the rational
orthogonal matrix `[[3,-4],[4,3]]/5`. Its source proves error at most
`sqrt(4/5)` for every seed/input and states that this deterministic bound is
attained by the construction. The lemma therefore gives exact worst outward
slack `sqrt(4/5)` across the five maps; this does not assert that every
individual seed attains that value. The #6758 native theorem similarly gives
sharp forward and inverse error `sqrt(8)` and a full-rank forward period
`Gamma`. For the inverse, `U Gamma` is an integral full-rank lattice: the
forward period law and integer-valued F imply `U lambda` is integral, and
bijectivity gives `F^-1(y+U lambda)=F^-1(y)+lambda`. Applying the theorem to
F and to its inverse relative to `U^*` gives forward and inverse outward
slack `sqrt(8)`. These uses inherit the pinned source results; this package
does not recheck their tables, certificates, or full implementations.

This does not answer #6619's unrestricted outward-slack optimization and
does not imply a positive minimum for every reversible integer-output map.
For a translation `lambda=(a,b)` with sum `u=a+b`, the pair formula gives
`F(X+lambda)-F(X)=C_sigma lambda + e_(s+u)-e_s`. Thus a global period
identity for this translation requires `c(s+u)=c(s)` for every `s`. The
actual #6509 sign-based center has no nonzero additive period: if the
real-plus-imaginary parity of `u` is odd, use `s=0`, where `c(s)=0` but
`c(s+u)` is a Gaussian unit; if both coordinates of `u` are odd, use
`s=1`, where the center changes from `1` to `i` or `-i`; if both are even
and `u != 0`, choose an odd real (respectively imaginary) coordinate `+1`
or `-1` whose sign is reversed by the nonzero real (respectively imaginary)
part of `u`, with the other coordinate zero. In that last case the center
changes from `+1` to `-1` or vice versa, or from `+i` to `-i` or vice versa.
For example, the equal-coordinate shift `(-1,-1)` changes the center from
`c(1)=1` to `c(-1)=-1` and fails the global affine-period identity. A full-rank
period lattice cannot lie wholly in the rank-two sum-zero subspace, so this
source map is not globally affine-periodic on a full-rank lattice. The
fixed-sum fiber argument is precisely why the #6509 result remains valid
without a global period premise.

No new kernel, physical tariff, component guard, selected `kappa`, or
unrestricted optimality result is claimed. The finite kernel replay tests the
retained center rule only; the universal bounded-center theorem is proved by
the formulas above.
26 changes: 26 additions & 0 deletions research/affine-period-outward-slack/PUBLICATION-MANIFEST.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
{
"base": "e54523517d0f03e58352e647c403a5af3e525a57",
"claim_type": "scoped universal mathematical lemma and source corollaries; no new kappa",
"files": {
"NOTICE.md": "cf2799f914127a3c6b74db62afeaa2482cf7b5ac159aac186d0d17ee6104a1f6",
"PR-DRAFT.md": "c069671740452e1276ae4d0bb33967e74fc52f043268ca0f97d6d1c6349e8766",
"PR-TITLE.txt": "e96399c06b577e2e9308aef387c15944b88012b6e6835a87bd75e12a05f034e5",
"PROOF.md": "7eae173d7223d473d574c87bbdae6fad4fb857559a8cc717304bdbdebaa1eb7d",
"README.md": "d411866b2e6f3feb28043d695a7aee96b30a6201ad675419f044cfb4943a0bfc",
"RESULT.json": "0fc96cc4f7f04a5de9c224ab1e516c3d3d9b70700b41da7fb646e7a629102bf9",
"SOURCE-NOTICE.md": "ba3157cea93750cc40a060e06af11da25f8d1b0e51eeea56636c94ce2c8abe8e",
"SOURCES.json": "5316820f28df712e374365bb7aacf60e4a8de7a018911e68ba4fe915d952859b",
"REPRODUCTION.json": "c392c163eb22f23dc7085b8bc1e81343031cafa1329b610a77133282a0fd97b7",
"kernel.py": "fc3e2bf828fa547bee5710f9d5502b7c8c4dcb4cab7536ff73e3dbff54960f1b",
"reproduce.py": "419a231716a7f8679deb9faba7f44a3233912bc7296a1521d4fb9b546dca38f7",
"review/AUTHOR-OPTIMIZED-REPLAY.json": "fb7725008661c5a3f788f9ca6428db77fa8fad620477d135250400fd3cae452b",
"review/AUTHOR-REPLAY.json": "fb7725008661c5a3f788f9ca6428db77fa8fad620477d135250400fd3cae452b",
"review/PUBLICATION-ROOT-REPLAY.json": "6e0e2186fd1e684b353bc444303218bea24a9833dec7157e24ab7f14ad3ebbdc",
"review/README.md": "c6e2a0e25bf481a2f77e5f3381fc6645406d1487440e025e5ecbcb7b8a9a73bd",
"review/RESULT.json": "6e0e2186fd1e684b353bc444303218bea24a9833dec7157e24ab7f14ad3ebbdc",
"review/ROOT-REVIEW.md": "c9d738ae5d96f74cc17c552a53cb69560aa30e78cfae81cfb79a3011f4fbf97c",
"review/SOURCE-BINDING.json": "d06a6eced4cd0ce7e63a989e3f3d14f55bba31c3821a5a4fced7b0ce99618416",
"review/check_norm_slack_root.py": "ea2c2e0bbdc992adeeb4a5df35e7492d4144bfe067622d726494ebeacb3d9214"
},
"reviews": "written author and lead proofs; exact independent rational/source replay; all eight remote source pins checked"
}
82 changes: 82 additions & 0 deletions research/affine-period-outward-slack/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,82 @@
# Exact outward slack from affine periods and sum fibers

**Result.** For a rational orthogonal map with a full-rank affine period, the
supremum of the outward norm increment equals the largest period-coset error.
Applying the same ray argument within each fixed-sum fiber proves, for every
legal bounded center rule in the #6509 pair family, that the global outward
slack is exactly `sup_s |c(s)|`. The least value among these center rules is
one, attained by #6509's source rule.

This is an exact norm-slack classification for a scoped family. It gives no
physical tariff, selected `kappa`, or unrestricted optimality claim. The
#6509 sign-based center does not have a full-rank global affine period; its
proof uses integral ray shifts inside fixed-sum fibers.

## Files and reproduction

This archive uses [REPRODUCTION.json](REPRODUCTION.json) as a standalone replay guide, not a registered `research/<slug>/VERIFY.json` manifest. The default direct replay is read-only; `--write-result` explicitly refreshes the receipt. The generic research-package hook does not validate or run this archive manifest.

- [PROOF.md](PROOF.md) gives the period theorem, the complete legal-center
family proof, the ray inequalities, and the source-bound corollaries.
- [SOURCES.json](SOURCES.json) pins the canonical base, retained kernel, and
predecessor proofs by commit, Git blob, and SHA-256.
- [kernel.py](kernel.py) is a byte-identical copy of #6509's tiny kernel.
- [SOURCE-NOTICE.md](SOURCE-NOTICE.md) preserves its upstream notice;
[NOTICE.md](NOTICE.md) records this package's added work and credit.
- [REPRODUCTION.json](REPRODUCTION.json) records the standalone replay command.

Run from this directory with Python 3.10+ and the standard library:

```sh
python3 -B reproduce.py
```

The default run prints the full receipt to stdout and leaves `RESULT.json`
untouched; the explicit checks also pass under `python3 -O -B reproduce.py`.
Use `python3 -B reproduce.py --write-result` to refresh the receipt file.

The verifier authenticates the copied kernel bytes, runs the exact `c(1)=1`
ray and literal inverse on integer-grid witnesses, checks the dyadic
unit-ball crossing with `Fraction`, and requires both an illegal-center
mutation and a specific unsupported equal-coordinate global-period candidate
to fail. The finite run
corroborates the retained kernel on those witnesses; it does not prove the
all-center theorem, which follows from the written algebra.

## Predecessors and limits

Ali Romman's #6509 supplies the legal-center condition, exact inverse, and the
unchanged pair kernel. #6534 and #6536 do not state the radial outward-slack
equality proved here. Ali Romman's #6534 two-axis map already has sharp
uniform error `sqrt(2)h`; the period theorem converts that inherited error
result into exact outward slack `sqrt(2)h`. The #6536 matched three-axis map
has sharp uniform error `2h`, giving exact outward slack `2h`. These are
corollaries of pinned source claims; their tables and matchings are not
reverified here.

Nick Petalas's #6438 five-seed rotation has an affine period, a per-seed error
bound `sqrt(4/5)`, and an attained maximum across the construction, so its
worst outward slack across the seeds is exactly `sqrt(4/5)`. CubeJerry's #6758 native map similarly has inherited sharp
forward and inverse error `sqrt(8)` and a full-rank period, so both outward
slacks are `sqrt(8)`. This package does not recheck either certificate.

The prior finite-set argument #2589, cited by #6619, concerns exact norm
preservation on finite spheres; it is not the unbounded lattice ray proof
used here. #6619's unrestricted outward-slack optimization remains open in
this package.

## Open next questions

- **Question:** Is there a sharp outward-slack bound for injective
integer-output maps without an affine-period or fixed-fiber decomposition?
**Why it matters:** Such a result would connect this exact periodic/fiber
classification to the unrestricted problem left open by #6619.
**First step:** Prove a bound or construct a counterexample while checking
injectivity over complete integer spheres, not only a finite sample.
**Blocked by:** No period quotient or other finite classification is known
here for the unrestricted map class.

## Assistance

The new proof and reproduction package were prepared with substantial OpenAI
Codex assistance. No code from #6534, #6536, #6438, or #6758 is copied.
Loading
Loading