Skip to content

Prove the weight-1 no-edge image bound is 6 at pattern dimension 4 - #260

Draft
unpaidmoon wants to merge 1 commit into
cursor/upstream-f16923d-base-b5ebfrom
cursor/weight1-pattern-dim4-reducible-b5eb
Draft

unpaidmoon wants to merge 1 commit into
cursor/upstream-f16923d-base-b5ebfrom
cursor/weight1-pattern-dim4-reducible-b5eb

Conversation

@unpaidmoon

Copy link
Copy Markdown
Owner

Change and mathematical scope

Scoped proof, plus one exhaustive finite census of an 8-coordinate witness. No new κ. The selected conditional value stays 781451/250000000 from the selected record (PR CrocSwap#6030). This does not change the selected frontier.

Over F2, let P be a linear space of zero-diagonal matrices with dim P ≤ 4 and with no matrix unit. Suppose every rank-one idempotent in the complete off-diagonal pool has covector weight 1. Then the joint image has dimension at most 6. If the pool is nonempty and that dimension is at least dim P + 1, the action is reducible. In particular every such pool of pattern dimension 4 and joint-image dimension at least 5 is reducible.

Dimension 6 is attained by two column spaces, span{e1+e2, e1+e3} and span{e5+e6, e5+e7}. Their complete pool has six projectors, pattern dimension 4, image dimension 6, and an invariant kernel of dimension 4.

This is not a census of all pattern spaces. It does not bound a pool that uses a covector of weight 2 or more. Open CrocSwap#7094's irreducible dimension-5 pool uses such covectors and is outside the hypothesis. The four-cycle of CrocSwap#6962 has covector weight 3, so the theorem does not apply to it.

Task and overlap

Base: f16923d466a6aba912299882e0545564d2ba7bb2. The session opened on 17469fff78c22941280f04d39dc5a1faee09c840; upstream main then advanced by the PR CrocSwap#7000 admission commit, which does not touch this proof. Task: bit-new-register-model, scope changed. The card asks for a larger or nonabelian register alphabet. This package answers the weight-1 case of the pattern-dimension-4 image question left by CrocSwap#6962 and narrowed by open CrocSwap#7094. No new alphabet, word, or kappa is claimed.

Session r230. The ordered eligible list, after dropping the listed unpaidmoon pull requests and fork cursor/* branches, is the six revision-8 next-decision rows and then the catalogue cards those rows do not name. Item 3 of that list is new decoders and interfaces. This package is item 7, bit-new-register-model, and it is distinct from CrocSwap#7094 because that pull request's witness has covector weight at least 2. The 112-owner linear relation left by open CrocSwap#7056 was not taken.

Overlap snapshot on 2026-11-10, via scripts/find_overlap.py --refresh: local notes at 17469fff (10178 head paths, complete inventory), 406 open-PR records fetched at 13:50:46Z, and 7014 discussion records fetched at 13:51:51Z. Requiring both covector weight and pattern dimension 4 matched only this package's README. The phrase weight-one covectors matched only the same README. Open CrocSwap#7094 matches the broader terms pattern dimension 4 and no-edge; it is the dimension-5 irreducible witness with heavier covectors, not this bound. The search is not a novelty certificate. Closed PR bodies were outside that snapshot.

Validation

Python 3.12, standard library only. From the repository root:

python3 -B scripts/research_package.py --package research/weight1-pattern-dim4-reducible --check-only
python3 -B scripts/research_package.py --package research/weight1-pattern-dim4-reducible

Both registered commands passed locally, including the optimized run. Checks are explicit SystemExit failures, not assertions. The run prints PASS_WEIGHT1_PATTERN_DIM4_REDUCIBLE with pool=6, image_dim=6, kernel_dim=4, partition_max=6, and new_kappa=null, then PASS_REGISTERED_RESEARCH_PACKAGE ... outcome=completed.

The width-8 pool equality is an exhaustive census of the finitely many rank-one idempotents on those eight coordinates. The dimension bound and the reducibility statement are the proof in PROOF.md. The partition table is a complete enumeration of the compositions of integers at most 4.

Not run: Lean, Docker, the selected cold replay, and any search over heavy covectors. An incomplete search is not evidence here.

Credit

The fiber lemma is Nick Petalas, CrocSwap#5921, research/pattern-pool-cardinality. CubeJerry, CrocSwap#6838, proved the pattern-dimension-at-most-3 total-image bound. CrocSwap#6921 proved the irreducible bound 3 for pattern dimension at most 3. CrocSwap#6962 showed that bound fails in pattern dimension 4. Open CrocSwap#7094 shows irreducible image dimension 5 with heavier covectors. This package does not replace those arguments.

Prepared by unpaidmoon with substantial Cursor Grok assistance.

Open next questions

The package records two follow-ups.

Can a complete no-edge pool of pattern dimension 4 that uses at least one covector of weight 2 or more act irreducibly on a joint image of dimension 6 or more? Open CrocSwap#7094 already gives irreducible dimension 5 in that heavier class, so the weight-1 cap does not bound it. The first step is one explicit heavy-covector pool with a written invariant-subspace check, or a proof that every such pool has image dimension at most 5 or is reducible. No column decomposition here makes that domain finite.

Is every weight-1 no-edge pool of pattern dimension 4 with joint-image dimension 4 reducible? The kernel test needs dim V ≥ dim P + 1. The four disjoint weight-1 lines have image dimension 4, trivial common kernel, and are reducible by another invariant subspace, so they do not settle the general case.

Workflow feedback (optional)

The column decomposition is special to covector weight 1. A search over heavier covectors would not have seen the partition bound. Link once: CrocSwap#1200

Open in Web Open in Cursor 

A complete no-edge pool whose covectors all have weight 1, and whose pattern space has dimension at most 4, has joint image dimension at most 6. The action is reducible once that dimension exceeds the pattern dimension. The bound is attained by an explicit reducible witness. No kappa change.

Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants