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
257 changes: 257 additions & 0 deletions research/p104-tiered-ceiling/CHECK.txt

Large diffs are not rendered by default.

201 changes: 201 additions & 0 deletions research/p104-tiered-ceiling/LICENSE
Original file line number Diff line number Diff line change
@@ -0,0 +1,201 @@
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/

TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION

1. Definitions.

"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.

"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.

"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.

"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.

"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.

"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.

"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).

"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.

"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."

"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.

2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.

3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.

4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:

(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and

(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and

(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and

(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.

You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.

5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.

6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.

7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.

8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.

9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.

END OF TERMS AND CONDITIONS

APPENDIX: How to apply the Apache License to your work.

To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.

Copyright [yyyy] [name of copyright owner]

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
70 changes: 70 additions & 0 deletions research/p104-tiered-ceiling/NATIVES.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
# NATIVES: which premises of the tiered ceilings each word meets, and the script that computed it

Four word files were checked, each against every word-level premise of T1 (`ceiling_native_J`), T2a (`ceiling_noHJ`) and T2b (`ceiling_native_Z0`):

| name | word | file |
|---|---|---|
| st1 | the word of #7641 | `st1.json.gz` |
| w7637 | the #7637 word | `w7637.json.gz` |
| x1t2a | the x1t2a word | `x1t2a.json.gz` |
| e1 | the #7660 word | `e1.json.gz` |

All four share one owned layer (47 owned moves: 23 rises and 24 descents, mass 56 / 56) and one port set of 104 odd-weight vectors, so this is close to one data point, not four. A word that failed or could not be checked on any premise would be removed from the claims; none failed. **Lean treats every object in the three theorems as abstract and nothing in Lean ties a word to these hypotheses (in particular nothing ties the set `J` to a word).** The results below are exact computations by Python scripts (exact modular arithmetic over primes, exact integers, or outward-rounded 80-digit Decimal) run on the four word files, one core each. The scripts and word files are not part of this package. "Result" means the premise as computed, not a Lean fact.

Script key (all re-run on all four words, outputs identical where stated):
- `aud.py WORD PRIME`: per-arrival content replay, run with p = 2^61 - 1 and p = 2^64 - 59 (both agree on all four words).
- `aud2.py WORD`: public register dimension sequences (hmono, hd9, hmix) and owned rise/descent split.
- `aud2a.py WORD`: structural audit, FIX-1 split (ks, mr), Cap class and slack grid.
- `aud2b.py WORD`, `hc12.py WORD`: arrival-form junk set `J^arr`, SP checks; `hc12.py` adds legal-path reachability for every junk cell.
- `aud2c.py WORD`: decoder-route endpoints and rank of route-end X-contents.
- `aud2d.py WORD`: the 48-cells law over all port-spanned subspaces of dimension <= 4 of F2^9.
- `hc6.py` (word list extended to the four words): ks, mr, hF, hst, hY, hmass, hmd, hmr on an s grid.
- `j13.py` (the four words): hF and hEex as exact identities of exponential polynomials, hst ingredients, Cap margin on s in [.9, 1 - tJ0].
- `hc8.py WORD`, `hc11.py WORD`: route replay and forced-cell check.
- `hc9.py`, `jemit.py`, `emit.py`, `emit0.py`: certified bracket tables (word-independent).

## Premise x word

| premise (Lean name) | st1 | w7637 | x1t2a | e1 (#7660) | script |
|---|---|---|---|---|---|
| \|J^arr\| (for hJ : 4962 <= J.card) | 4962 | 4962 | 4962 | 4962 | `aud.py` (both primes), `aud2b.py`, `hc12.py` |
| per-row junk j_t; sum 1/(j_t+1) | [38, 48]; 2.1381 | same | same | same | `aud.py` |
| rank M | 11 | 11 | 11 | 11 | `aud.py` (15 distinct arrival vectors, rank 11) |
| D (arrival vectors, one per owned descending move; hD : D <= 56) | 24 | 24 | 24 | 24 | `aud.py`, `aud2a.py` (24 descents, 20 carry arrivals) |
| LawAModel hspan | holds | holds | holds | holds | `aud.py` (rows are combinations of the 15 arrival vectors by construction; rank equals rank M) |
| LawAModel hdiag (no zero diagonal) | 0 zero | 0 zero | 0 zero | 0 zero | `aud.py` |
| LawAModel hodd (odd off-diagonals vanish) | 0 odd | 0 odd | 0 odd | 0 odd | `aud.py` |
| LawAModel hpart (even partners <= 48) | 48 per row (4992) | 48 | 48 | 48 | `aud.py` |
| hmono | 0 violations | 0 | 0 | 0 | `aud2.py`, `aud2a.py` |
| hd9 | 0 violations | 0 | 0 | 0 | `aud2.py`, `aud2a.py` |
| hmix (<= 5) | 5 (tight) | 5 | 5 | 5 | `aud2.py`, `aud2a.py` |
| hk (every k in 1..9) | true | true | true | true | `hc6.py`, `aud2a.py` |
| hmass (56 <= ks.sum) | 102 | 102 | 102 | 102 | `hc6.py`, `aud2a.py` |
| hmd (8 <= len ks) | 37 | 37 | 37 | 37 | `hc6.py`, `aud2a.py` |
| hmr (8 <= mr) | 10 | 10 | 10 | 10 | `hc6.py`, `aud2a.py` |
| hY (104 <= st + len ks + mr) | st = 1266: 1313 | 1266: 1313 | st = 1265: 1312 | 1265: 1312 | `hc6.py`, `aud2a.py`, `j13.py` |
| hF (Finv s n <= ...) | exact identity, coefficient difference {} | {} | {} | {} | `j13.py` (and `hc6.py` on a grid: slack 0 up to 2e-12 float noise) |
| hEex (E := that exponential polynomial) | identity | identity | identity | identity | `j13.py` |
| hst | gaps >= 1, every main moves; grid slack >= 158 | >= 159 | >= 158 | >= 158 | `j13.py`, `hc6.py`; `aud2a.py` slack 0.0 at s = 1 only |
| Cap class (own cells, 48 N_f) | margin 19.349538 on s in [.9, 1 - tJ0] (`aud2a.py` grid: 19.356) | same | same | same | `j13.py`, `aud2a.py` |
| hcong / hdist support: every J^arr cell has a legal owned-descent-free path; no cell needs a cut | 0 cells without path | 0 | 0 | 0 | `hc12.py`; Cap margin as above |
| forced cells carry nonzero arrival coefficient | 2536 of 2536 | 2536 of 2536 | 2536 of 2536 | 2536 of 2536 | `hc11.py` |
| 48-cells law (max n*m over port-spanned subspaces) | 48 | 48 | 48 | 48 | `aud2d.py` (also `hc8.py`: native frames max 24) |
| 8 decoder routes, rank of route-end X-contents | 8 | 8 | 8 | 8 | `aud2c.py` |
| no public register enters any D_t; 0 SP violations; 0 even entries in Y_t | holds | holds | holds | holds | `aud2b.py`, `hc12.py` |

Reading the table against the Lean statements:
- `hcong`, `hdist` are real-analytic statements about a given `J` and `distF`. The scripts compute the combinatorial and numerical ingredients (legal paths for every J^arr cell, the Cap margin on s in [.9, 1 - tJ0], which contains the T2 ranges s <= 1 - tN0 and s <= 1 - tZ0); the step from these computations to the Lean `hcong`/`hdist` for `J = J^arr` is the lane's paper argument and is not formalised.
- `hspMono`, `hcstMono` (monotonicity of spF, cst on [t0, 1/10]) are a paper theorem, not computed on a word and not formalised; they are word-independent.
- The bracket hypotheses (`hspTab`, `hcstTab`, `hspTabJ`, `hcstTabJ`, `hspTabN`, `hcstTabN`) are word-independent. `hc9.py` (C tables) and `jemit.py` (J tables) re-run with every inequality certified (outward-rounded Decimal, weights rounded down, constants rounded up). `emit.py` and `emit0.py` (N and Z tables) were re-run with their output redirected: the emitted rational tables are identical to `CongestionNativeNDefs.lean` and `CongestionNativeZDefs.lean`. The Lean hypotheses (`spFlo <= spF t`, `cst t <= cH`) remain hypotheses.
- Informational (`hc8.py`, not a Lean premise, identical on all four words): the route-end contents are not proportional to the cfg6 rows and the prefix property fails on 5 route events. Nothing in the three theorems uses them.
- The link from the Lean `n` and `caller 6 7` / 17 to each word's invoice is the pricing script's (`pricekit`), not Lean's.

## What is not covered

- Words with |J^arr| < 4962 are outside T1. They are covered by T2a/T2b only if they meet all the other hypotheses of that theorem (hmix <= 5, hmono, hd9, hk, hmass, hmd, hmr, hY, hF, hst, hEex, hcong, hdist, and for T2a the LawAModel premises, hD, hJdef). None of these has been checked on any such word. No such word is known.
- Words with D > 56: T2b only, with the same proviso. No such word was checked.
- Decoders with 9 or more rows: T1/T2 hard-code `corrC <= 8 * cH` and `capC >= unLo / 48`, which model 8 decoder rows and 48 partners per row. Such decoders are outside the model.
- That an owned mass above 56 never pays is a paper argument, absent from the Lean chain.
- The class-wide bound |J| >= 1936 for decoders that are not rank 8, C = 56 is a conjecture.
- Network decoders.
Loading
Loading