Skip to content

No new κ: covers of E7 by hyperplane flats are exactly the D4-frame triples; near-covers are the A3s (checked) - #897

Open
DaysSky wants to merge 1 commit into
CrocSwap:mainfrom
DaysSky:research/e7-flat-cover-classification
Open

DaysSky wants to merge 1 commit into
CrocSwap:mainfrom
DaysSky:research/e7-flat-cover-classification

Conversation

@DaysSky

@DaysSky DaysSky commented Oct 13, 2026

Copy link
Copy Markdown
Contributor

No new κ. Main's cover numbers (research/format-limits §D, #595) establish that the 63 readers of a bit source (E7 = t⊥) need three hyperplane sections: two flats cover at most 52 lines, and some three D6 flats cover all 63. This package classifies the covers exactly.

Change and mathematical scope

One self-contained package, research/e7-flat-cover-classification/, plus one path-filtered workflow and one .gitattributes line. No existing file changes.

  1. The covering triples are exactly the D4 frames through t.
    • Three hyperplane flats cover E7 if and only if they are E7 ∩ a⊥, E7 ∩ b⊥, E7 ∩ c⊥ for an orthogonal frame {t, a, b, c} spanning a D4.
    • There are 315 such triples, one per D4 through t.
    • The other 3780 orthogonal frames span only 4A1, and their triples miss at least 8 lines.
  2. The near-covers are exactly the A3 subsystems through t. A near-cover is a triple covering exactly 62 of the 63 lines.
    • Each near-cover is E6(A) + E6(B) + D6(m). Here A and B are the two A2s through t of the A3, and m is the A3's line orthogonal to t, which is the missed line.
    • There are 378 = 63 × 6, and no other type occurs.
  3. The cover count does not force 3 registers per D6 pool.
    • In a covering triple, each D6 has 16 private lines, which span it.
    • Two rank-5 subflats never cover a whole D6 (at most 28 of 30). But they do cover its 16 private lines (75 pairs per D6), and six rank-5 flats, two per D6, cover all of E7.
    • So "two 5-dim subflats cover ≤ 28 of 30" does not alone give the proposed 180 × 3 = 540 count.

Consequence for bit skeletons.

Scope.

  • These are statements about covers by flats, the model of §D. They do not price a skeleton.
  • (3) does not construct a 2-per-pool design: frame nesting, the readers' frames and restoration are not modelled.

Duplicates.

Validation

python3 -B research/e7-flat-cover-classification/cover_check.py uses the standard library only.

  • Run. It prints PASS_E7_FLAT_COVER_CLASSIFICATION (21 checks) in about 6 minutes. It passed on Linux aarch64 with Python 3.12.3 and 3.11.16, against main at f567884a. CI runs Python 3.11 and 3.14.
  • Exact arithmetic. Ranks are computed mod 2³¹ − 1. By Hadamard, minors of at most 8 norm-4 rows are at most 256 in absolute value, so these equal the rational ranks.
  • Exhaustive searches. Every search is exhaustive.
  • Agreement with main. The checker confirms main's pinned D1 values (8821 flats, the size histogram, the best pair 52, cover number 3) both from its own census and from the text of d1_cover_numbers.py.

Credits and AI disclosure

No new kappa. Exhaustive and exact (ranks mod 2^31-1, equal to rational
ranks by Hadamard):
- the 315 covering triples are exactly the D6 triples of the D4 frames
  through t; the 3780 4A1 frames miss at least 8 lines;
- the 378 near-covers (62 of 63) are exactly E6(A)+E6(B)+D6(m) for the A3
  subsystems through t, missing m;
- two rank-5 subflats never cover a D6 (28 of 30) but do cover its 16
  private lines, and a 2+2+2 rank-5 cover of E7 exists, so the cover count
  alone does not force 3 registers per D6 pool.
Agrees with main's D1 census (8821 flats, best pair 52, cover number 3).
@Mister-Meeseeks

Copy link
Copy Markdown
Contributor

100-PR batch review at 12c4789c61ac843dcd00e2c71e5388d362298b1a.

This remains open after scoped triage. Next review step: After repairing a missing historical format-limits input, the full E7 classification replay reached 180 seconds. Finish the cover/near-cover domain and remaining controls; the initial missing-file error was our fixture setup.

This is a specific continuation point, not a rejection or a request to redo already recorded checks. Completed local evidence is retained separately from outstanding whole-head obligations.

Batch review, attribution and evidence. Thank you for the contribution.

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