Skip to content
Draft
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
436 changes: 436 additions & 0 deletions research/no-edge-dim4-image-at-most-six/PROOF.md

Large diffs are not rendered by default.

96 changes: 96 additions & 0 deletions research/no-edge-dim4-image-at-most-six/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,96 @@
# No-edge pattern dimension 4 has total image at most 6

**Result.** A complete no-edge pool of binary rank-one idempotents whose
off-diagonal pattern space has dimension 4 has joint image of dimension at
most 6. Dimension 6 is attained, and every such pool is reducible there. The
largest irreducible joint image therefore has dimension at most 5. The pool
in #7094 attains 5, and this package rechecks that witness. **No new κ.**
The selected value remains `781451/250000000`.

The three dimension-6 geometries are a pair of disjoint normal-form triples,
a pair of column triples on different columns, and one column triple beside
one normal-form triple. Each is reducible: the normal-form pair has an
invariant 3-dimensional block, and the other two have a nontrivial common
kernel.

## Scope and evidence

Catalogue card: `bit-new-register-model`, priority revision 8, base commit
`f16923d466a6aba912299882e0545564d2ba7bb2`. Scope status: **changed**. The
card asks for a new register alphabet. This package answers the open question
of #7094, which asks whether irreducible joint image 6 is possible after
#7094 attained 5. The reason is recorded in [TASK.json](TASK.json). The
original native acceptance gate is unmet, and the selected frontier is
unchanged. Question 1 of #6921, paid-rank accounting after a relation split,
is not this result.

[PROOF.md](PROOF.md) is the argument. Any six independent images have
patterns in one of four combinatorial types, and the verifier enumerates all
5005 six-point subsets of F2^4. A meet-1 type is impossible by Lemma 3 of
#6838. A cap or a one-triple type contains a diagonal quadruple, and that
quadruple forces total dimension at most 5. The only remaining type is two
disjoint triples. Each triple is a column triple or a normal-form triple by
the #6921 classification; the verifier repeats the 168-element GL(3,2)
census. Those three geometries have dimension exactly 6 and are reducible.

[verify.py](verify.py) repeats the two finite censuses, rebuilds the three
dimension-6 pools (including one spare coordinate), and rechecks the #7094
dimension-5 pool at widths 5 through 8, including its subspace lattice.
Deleting the last dimension-5 projector leaves an invariant subspace, and
one normal-form block alone is reducible, so the lattice scan is not
hard-wired to one answer. These checks certify the witnesses and the
censuses. They do not enumerate all four-dimensional pattern spaces. The
case split in the proof is what covers every pool and every width.

Source pins are in [SOURCES.json](SOURCES.json). The catalogue is provenance
at the base commit, and the selected record is an input because the verifier
reads it. Full Git history is needed to resolve the pins. Nothing here reruns
the selected baseline as a scientific replay.

Overlap was rechecked on 2026-11-10 against 406 open and 6175 closed upstream
PR records and 7014 discussion records, with a complete local note inventory
at base `f16923d466a6aba912299882e0545564d2ba7bb2`. The search terms were
"irreducible joint image", "pattern dimension 4", "joint-image dimension",
and "no-edge pool". The matches are the predecessor chain: #5921 (fiber
lemma), #6782 (edge quotient), #6785 (one-edge exclusion), #6838 (total image
at most 4 for pattern dimension at most 3), #6921 (irreducible bound 3),
#6962 (irreducible dimension 4), and #7094 (irreducible dimension 5, leaving
dimension 6 open). No match is not a novelty certificate. Open upstream PRs
through #7105 do not take this question.

## Reproduce

From the repository root, with Python 3.12 and the standard library only:

```sh
python3 -B research/no-edge-dim4-image-at-most-six/verify.py
python3 -I -O -B research/no-edge-dim4-image-at-most-six/verify.py
python3 -B scripts/research_package.py --package research/no-edge-dim4-image-at-most-six --check-only
python3 -B scripts/research_package.py --package research/no-edge-dim4-image-at-most-six
```

The verifier prints `PASS_NO_EDGE_DIM4_IMAGE_AT_MOST_SIX`.

## Open next questions

1. **Pattern dimension 5.** Does a complete no-edge pool of pattern dimension
5 still have total joint image at most 6, and can its irreducible image
exceed 5? The parity construction one dimension higher has total image 6,
while the edge-quotient bound only gives 31. The four-dimensional census
does not carry over.

2. **Coordinate classification at dimension 6.** Is every dimension-6 pool a
coordinate permutation of one of the three witnesses? The dimension bound
does not need that list.

3. **Paid rank.** After a valid relation split, does irreducible dimension at
most 5 change a three-relation paid-rank obstruction? This remains
question 1 of #6921. The split hypotheses are not proved here.

## Credit

The fiber lemma is Nick Petalas, #5921. The total-image bound and Lemma 3
are CubeJerry, #6838. The triple classification and the irreducible bound 3
are #6921. The dimension-4 irreducible 4-cycle is #6962. The dimension-5
irreducible witness rechecked here is #7094. Prepared by unpaidmoon with
substantial Cursor Grok assistance. New work is Apache-2.0.
18 changes: 18 additions & 0 deletions research/no-edge-dim4-image-at-most-six/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
{
"schema_version": 1,
"base_commit": "f16923d466a6aba912299882e0545564d2ba7bb2",
"files": [
{
"path": "certificates/selected-result.json",
"usage": "input",
"git_blob": "d59b5035e7b4cbaa9d688a1d32dd0d6eb79c466a",
"sha256": "9b8d0eea95b3bf0dfcb7938a732a6439b87a2685dec2a5ab9e525b3b34debbfa"
},
{
"path": "docs/research/agent-task-catalog.json",
"usage": "provenance",
"git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec",
"sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81"
}
]
}
87 changes: 87 additions & 0 deletions research/no-edge-dim4-image-at-most-six/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,87 @@
{
"schema_version": 1,
"task_id": "bit-new-register-model",
"priority_revision": 8,
"base_commit": "f16923d466a6aba912299882e0545564d2ba7bb2",
"original_card": {
"id": "bit-new-register-model",
"question": "Can an explicitly larger or nonabelian register model escape the scoped three-register obstruction?",
"starting_points": [
"docs/research/research-family-status.md",
"research/bit-three-register-lower-bound/README.md",
"certificates/selected-result.json",
"research/bit-gl3-mixed-targets-length10/README.md",
"docs/research/community-efficient1000-review.md"
],
"methods": [
"Construct the smallest exact identity in a newly specified legal operation alphabet.",
"Derive a target-specific relaxation bound for that same explicit alphabet."
],
"acceptance_gate": "Name the changed hypothesis, all counted roles and a uniform identity; finite column tests alone do not certify it. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.",
"first_step": {
"command": [
"python3",
"-B",
"scripts/research_selected_baseline.py"
],
"expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY",
"inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.",
"scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse."
},
"first_experiment": "First compare the alphabet, role count and length with the fully replayed #1974 census and #2027 mixed-root tariff. Identify a changed premise and a legal native implementation; then price one smallest completed instance before searching larger words.",
"bottleneck_link": "A small-width completed saving changes the bit primitive; a finite-address identity alone is insufficient.",
"allowed_variations": [
"Choose a fixed larger register count or a specified nonabelian operation family."
],
"scope_change_triggers": [
"Remaining inside the already-excluded three-register abelian model.",
"Repeating the two-register GL3 census or a covered three-register length without changing a hypothesis; a formal group-algebra word without native conversion is a partial result."
],
"overlap_terms": [
"three-register",
"nonabelian",
"group algebra"
]
},
"scope_status": "changed",
"actual_scope": "Sharp total and irreducible joint-image dimensions of a complete no-edge binary rank-one idempotent pool whose off-diagonal pattern space has dimension 4.",
"scope_change_reason": "The card asks for a larger or nonabelian register alphabet. This package stays in the abelian F2 rank-one idempotent model and answers the open question of #7094: whether a complete no-edge pool of pattern dimension 4 can act irreducibly in joint-image dimension 6 or more. No new alphabet, word, or kappa is claimed. The same card was already moved to scalar pattern-pool questions by #5921, #6838, #6921, #6962, and #7094.",
"bottleneck_link": "Side result. The scalar pool bound does not by itself price a word, so the original native acceptance gate remains unmet. A later word argument can no longer look for an irreducible pattern-dimension-4 image of dimension 6 or more. The selected frontier is unchanged.",
"budget_minutes": 60,
"stop_rule": "Stop once the all-width total bound 6 and the reducibility of dimension 6 are checked, and the #7094 dimension-5 witness has been rechecked. Do not start a pattern-dimension-5 classification or a word synthesis.",
"outcome": "completed",
"evidence": "PROOF.md shows that every complete no-edge pool of pattern dimension 4 has joint image of dimension at most 6, and that dimension 6 is reducible. verify.py repeats the 5005-subset census, the GL(3,2) triple census, the three dimension-6 witnesses, and the #7094 dimension-5 irreducibility check.",
"author": "unpaidmoon",
"ai_assistance": "Substantial Cursor Grok assistance with the case analysis, the finite censuses, and the package verifier. Independent human and formal proof-kernel review are unclaimed.",
"open_questions": [
{
"question": "Does a complete no-edge pool of pattern dimension 5 still have total joint image at most 6, and can its irreducible image exceed 5?",
"why_it_matters": "The dimension-4 census and the hyperplane argument both use dim P = 4. Pattern dimension 5 is the first case this proof does not bound, while the parity construction already reaches total image 6.",
"first_step": "Exhibit one unit-free pattern space of dimension 5 whose complete pool has image rank 7, or extend the active-set argument without a 3-dimensional hyperplane.",
"blocked_by": "F2^5 has more than six nonzero vectors, so the six-point partition does not exhaust a larger pool."
},
{
"question": "Is every dimension-6 no-edge pool a coordinate permutation of one of the three witnesses?",
"why_it_matters": "The dimension bound does not identify the pools. A coordinate list would show whether any further reducible geometry exists at the bound.",
"first_step": "Match each T-space, or each normal-form block, to a fixed pair of coordinate sets and record the stabilizer.",
"blocked_by": "The case split names the geometries but does not enumerate coordinate placements."
},
{
"question": "After a valid relation, cube-span, and coordinate-call split, does irreducible dimension at most 5 change a three-relation paid-rank obstruction?",
"why_it_matters": "This is still question 1 of #6921. The scalar bound does not by itself decide whether a concrete word saves a factor.",
"first_step": "State the exact split hypotheses from the predecessor word reductions, then account for endpoints and paid rank only where those hypotheses hold.",
"blocked_by": "The word-reduction hypotheses are not reproved in this package."
}
],
"coordination": {
"thread": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166",
"question_source": "https://github.com/CrocSwap/integer-mult-bounds/pull/7094",
"depends_on": [
"https://github.com/CrocSwap/integer-mult-bounds/pull/5921",
"https://github.com/CrocSwap/integer-mult-bounds/pull/6838",
"https://github.com/CrocSwap/integer-mult-bounds/pull/6921",
"https://github.com/CrocSwap/integer-mult-bounds/pull/6962",
"https://github.com/CrocSwap/integer-mult-bounds/pull/7094"
]
}
}
36 changes: 36 additions & 0 deletions research/no-edge-dim4-image-at-most-six/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"certificates/selected-result.json"
],
"commands": [
{
"argv": [
"{python}",
"-I",
"-W",
"error",
"-B",
"{package}/verify.py"
],
"timeout_seconds": 120,
"checks": "Six-point census of F2^4, GL(3,2) no-edge triple census, three dimension-6 pools and their invariant subspaces, and the rechecked #7094 dimension-5 lattice, plus the deleted-projector and one-block controls."
},
{
"argv": [
"{python}",
"-I",
"-O",
"-W",
"error",
"-B",
"{package}/verify.py"
],
"timeout_seconds": 120,
"checks": "The same checks with assert statements disabled; the verifier raises SystemExit instead of using assert."
}
]
}
Loading