Skip to content
Merged
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
49 changes: 49 additions & 0 deletions research/f9-character-audit/CLAIM.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
# Local sprint claim

- Track: independent verification (OS assignment seed **83**, drawn with
`secrets.randbelow(100)` on 2026-10-25 at session start).
- Base: `32890bc5de034ab8fc93ac88ead7279a6a416d04`, canonical main fetched
from CrocSwap; initial preloaded `66849e1` was historical and not used.
- Scope: independently check PR5459's automorphism determinant character
over F9, particularly nonlinear terms, unequal heights, and scalar-field
conventions. Source head: `bef3575ddb19c44434a7e2460a353eac7c4d9387`.
- Method: new exact quotient-algebra implementation, direct determinants,
division-free determinant checks and restriction-of-scalars norm checks.
No predecessor executable imports.
- Domain: all 72 automorphisms of F9[x]/x^3; every F9[x]/x^9 substitution
with at most two nonlinear monomials; all flag-preserving linear maps,
single-monomial nonlinear tails, and 83 seed-83 dense nonlinear maps on
F9[x,y]/(x^3,y^9). Stop at this fixed domain, including failure controls.
- Deliverable: exact deterministic receipt, scope/proof note, source pins,
standalone and registered replay, committed branch and publication kit.
- Finish: 2026-10-25 13:40 UTC; final ten minutes reserved for verification
and handoff.

## Selection and overlap

Three candidates: independent signed-invoice order check; neutral-completion
bookkeeping; extension-field automorphism character. The first already has
an exhaustive independent discrete-slope test; the second has the primary
eight-engine and PR5414 companion coverage. The third offers distinct coverage:
PR5459's scientific checker supports only F2, F3, F4, F5, F7. Seed 83 selects
odd characteristic 3 and 83 deterministic dense samples in addition to exact
finite censuses. Increasing field size alone is not the claimed contribution:
the F3 norm oracle and semilinearity rejection control test distinct obligations.

Read the selected certificate, promotion, scientific review and current status:
selected kappa is 605457647/200000000000, conditional on the five retained
framework assumptions. No selected construction or upstream source is changed.
PR ledger lists #5252 and #5316 as partially reviewed; #5459 has no entry at
this base. Its theorem is pending, not accepted because its PR is open.

At 13:05-13:07 UTC, checked 100 recently updated open PRs, all-state searches
for Frobenius/determinant and F9/determinant, discussion search for Frobenius,
and the latest 20 handoff comments. PR5540 addresses tensor recognition over
prime fields; that is a separate task. PR5459 already includes F4 tests, so
those are not repeated. Search coverage is bounded, not a novelty theorem.
GitHub GraphQL returned no pinned issues. This local claim follows the donor's
fallback; no new reservation issue or unsolicited Discussion post was made.

Credit Ali Romman (#5459/#5316), Nick Petalas (#5252), David Ganz and the
classical local-algebra/character theory they cite. Prepared for Charan /
theon199 with substantial OpenAI Codex assistance. Apache-2.0.
147 changes: 147 additions & 0 deletions research/f9-character-audit/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,147 @@
# Independent F9 automorphism-character audit

The finite audit corroborates PR5459's determinant character on **12,315
substitutions over F9**, adding an odd-characteristic extension field absent
from its checker. It also supplies an explicit control showing that a
restriction-of-scalars determinant alone can accept a wrong F9 determinant.
No discrepancy was found in the tested character formula. No new kappa,
supplier, full theorem proof or independent human acceptance is claimed.

The exact statement under test is, for
`A = F9[x_i]/(x_i^(3^e_i))`, `N = dim_F9 A`, and a valid substitution with
invertible height-preserving tangent blocks `L_e`,

```
det_F9(sigma) = product_e det(L_e)^(N (3^e - 1)/2).
```

Source: Ali Romman's [PR5459](https://github.com/CrocSwap/integer-mult-bounds/pull/5459),
head `bef3575ddb19c44434a7e2460a353eac7c4d9387`. Its theorem is pending, and its
checker covers F2, F3, F4, F5 and F7. The byte-exact source proof and checker
are retained in `source/`, with API Git blob IDs and SHA256 in
[REFERENCE.json](REFERENCE.json). They are authenticated but **never executed
or imported**. The F4 domains are not repeated. The new field, quotient algebra,
substitution evaluator and three determinant checks are separately written.
Classical methods and the mathematical formula remain credited source work.

## Exact finite domain and result

Let `K = F3[i]/(i^2+1)`. Elements are encoded as `a+3b` for `a+b*i`.

| Algebra/domain | Completed maps | Observed determinant image |
| --- | ---: | --- |
| K[x]/x^3, every automorphism `x -> ax+bx^2`, a nonzero | 72 | all eight nonzero elements, nine each |
| K[x]/x^9, every nonzero linear coefficient and at most two nonzero nonlinear monomials | 11,208 | +1 and -1, 5,604 each |
| K[x,y]/(x^3,y^9), every height-preserving invertible linear map | 576 | all eight nonzero elements, 72 each |
| Same mixed algebra, identity tangent and exactly one admissible nonlinear monomial in one generator | 376 | 1 |
| Same mixed algebra, 83 seed-83 dense nonlinear samples | 83 | all eight nonzero elements |

For the second row the exact count is
`8 * (1 + 7*8 + binom(7,2)*8^2) = 11208`; it is **not** the full nonlinear
automorphism group. The mixed linear maps are `x -> ax`, `y -> bx+cy`,
with a,c nonzero and b arbitrary. There are 23 admissible nonlinear monomials
for x and 24 for y, giving `(23+24)*8 = 376` one-tail maps. The 83 dense
samples are a deterministic bounded sample, not exhaustive coverage. Classes
can overlap across rows; counts describe checked presentations, not the
number of distinct maps across their union. The stopping rule is completion
of precisely these five domains and controls, with no adaptive search.

All 12,315 maps pass defining-power relations, unit preservation, every
generator-times-basis product (156,978 checks), invertibility via nonzero
determinant and the stated character. The 11,280 one-variable matrices also
pass a division-free Leibniz subset determinant, independently of Gaussian
elimination. Simultaneous seeded row/column permutations avoid relying on
already triangular input matrices. All 72 cutoff-three maps, the eight
linear cutoff-nine maps and 83 dense mixed maps pass an independent F3
restriction-of-scalars determinant, for **163 norm checks**.

Every scientific output field, including the domain counts, spectra,
control list and streamed case digest, is compared with [RESULT.json](RESULT.json).
The digest binds the ordered presentations and their determinants; it is
not a proof of the general theorem or a replacement for rerunning the checks.

## Why the norm check is not enough

For `z=a+b*i`, multiplication on the F3 basis `(1,i)` is
`[[a,-b],[b,a]]`, so `Norm(z)=a^2+b^2`. Block replacement gives
`det_F3 Res(M) = Norm(det_F9 M)`. This standard identity supplies a second
arithmetic path through ordinary modular F3 elimination, independent of
the extension-field operation tables. It loses information: `Norm(i)=1`
although `i != 1`. In particular the cutoff-nine character image is
`{+1,-1}`, but the incorrect extra value `i` has the same norm as 1.
The executable control demonstrates this ambiguity. Exact F9 determinants
are retained; no norm-only acceptance claim is made.

Nine semantic controls cover forbidden upward height mixing, a nonlinear
tail that violates x^3=0 despite an invertible tangent, singular tangent,
a corrupted substitution column, confusing p-Frobenius with a K-linear map,
using q instead of p in the exponent, norm-only false positives, Z/9 in
place of F9, and an off-by-one character exponent. Some are explicit
counterexamples to a shortcut, others are rejected mutated inputs; none
is presented as a counterexample to PR5459. The p-Frobenius control uses
`(1+i)^3 != (1+i)*1^3`, while q-Frobenius fixes K.

The generator-times-basis checks, unit and defining relations bind all
monomial products by induction: repeatedly multiply by each generator,
using the checked transition at each step, and use the defining zero
products on crossing a cutoff. Linearity then extends to arbitrary inputs
for each checked finite substitution. This does not enumerate every possible
substitution or prove the all-field character theorem by testing.

## Reproduce

Python 3.12, standard library only, no network or Git needed by the checker:

```sh
python3 -W error -B research/f9-character-audit/verify.py
```

Expected: `PASS_F9_CHARACTER_AUDIT` with 12,315 maps, 156,978 products,
11,280 division-free determinants, 163 norm checks and nine controls.
The registered command runs normal and optimized modes:

```sh
python3 -B scripts/research_package.py --package research/f9-character-audit
```

`--emit` on the standalone checker prints the freshly computed JSON for
review; normal replay compares it with the committed receipt. Source hashes
are checked before any scientific work in either mode. See
[VALIDATION.md](VALIDATION.md) for executed checks and environments.

## Scope, sources and next questions

Base: `32890bc5de034ab8fc93ac88ead7279a6a416d04`; assignment and overlap
coverage are in [CLAIM.md](CLAIM.md). The selected conditional saving at
that base is 0.003027288235 (#5413), with its five inherited assumptions.
This algebraic side result does not reduce those assumptions. It does not
verify unit/autotopism characters, full three-factor stabilizer images,
orbit recognition, general equal-height blocks, arbitrary extension fields,
physical costs, compiler admission or a full multiplication theorem.
The pending source bytes are shipped locally so a clean checkout does not
depend on an unmerged Git object. The two main-branch predecessor proofs
are provenance, not imported runtime dependencies.

## Open next questions

These are also structured in TASK.json.

- Audit nontrivial equal-height tangent blocks over an odd extension field.
They test determinant block coupling missing here. Start with F9[x,y]/(x^3,y^3)
and a bounded set of genuinely mixed GL2 blocks; full nonlinear enumeration
grows rapidly and needs a separate budget.
- Audit the full covariant autotopism determinant image over an extension
field, retaining inverse-input conventions. Start with explicit unit maps
and F9[x]/x^3. The normalization theorem and completeness of the image
require their own proof review; this automorphism audit does not supply it.

## Attribution

Ali Romman: PR5459's height-flag formula and PR5316's univariate result.
Nick Petalas: PR5252's normalization and determinant-image interface.
David Ganz: the atlas character-equation framework. Local-algebra
filtrations, finite-field norms and determinant algorithms are classical.
Their notices remain in the retained source files. New independent audit,
norm-ambiguity control and packaging prepared for Charan / theon199 with
substantial OpenAI Codex assistance. No subagents or human review claimed.
New work is Apache-2.0, as is the repository and retained source.
19 changes: 19 additions & 0 deletions research/f9-character-audit/REFERENCE.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"source_repository": "aliromman/integer-mult-bounds",
"source_pr": 5459,
"source_head": "bef3575ddb19c44434a7e2460a353eac7c4d9387",
"files": [
{
"local_path": "source/PR5459-README.md",
"path": "research/frobenius-tensor-characters/README.md",
"git_blob": "b62f9a906e6ed49605684cca52a221f064924461",
"sha256": "31573ba91ac69caff5b8e5a42ce7fd0d80a6d54673c08d7f225c9ee08e0e0893"
},
{
"local_path": "source/PR5459-verify.py.txt",
"path": "research/frobenius-tensor-characters/verify.py",
"git_blob": "4d0edc29d6a0c859f40148ee0fe87a05147f16c9",
"sha256": "2e80a73f0990a83396485899e8d03fa9f8b6549ec189e5be93aa2d46a3edf68a"
}
]
}
78 changes: 78 additions & 0 deletions research/f9-character-audit/RESULT.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,78 @@
{
"coverage": {
"cutoff3_complete": 72,
"cutoff9_two_tail": 11208,
"mixed_dense_seed83": 83,
"mixed_linear_complete": 576,
"mixed_single_tail_complete": 376
},
"determinant_spectra": {
"cutoff3_complete": {
"1": 9,
"2": 9,
"3": 9,
"4": 9,
"5": 9,
"6": 9,
"7": 9,
"8": 9
},
"cutoff9_two_tail": {
"1": 5604,
"2": 5604
},
"mixed_dense_seed83": {
"1": 10,
"2": 10,
"3": 11,
"4": 15,
"5": 8,
"6": 10,
"7": 11,
"8": 8
},
"mixed_linear_complete": {
"1": 72,
"2": 72,
"3": 72,
"4": 72,
"5": 72,
"6": 72,
"7": 72,
"8": 72
},
"mixed_single_tail_complete": {
"1": 376
}
},
"division_free_determinants": 11280,
"field": "F3[i]/(i^2+1); a+3b encodes a+b*i",
"generator_basis_products": 156978,
"negative_controls": [
"forbidden_linear_height",
"invalid_nonlinear_tail",
"singular_tangent",
"corrupted_substitution_column",
"semilinear_p_frobenius",
"wrong_characteristic_exponent",
"norm_only_false_positive",
"integer_mod9_is_not_a_field",
"off_by_one_character_exponent"
],
"norm_ambiguity_witness": {
"actual_determinant": 1,
"actual_norm": 1,
"algebra": "F9[x]/x^9",
"counterfeit_determinant": 3,
"counterfeit_norm": 1,
"exact_character_rejects_counterfeit": true,
"map": "identity"
},
"restriction_of_scalars_determinants": 163,
"schema": "f9-character-audit/v1",
"scope": "Finite independent corroboration of automorphism characters; no new kappa or full theorem proof.",
"seed": 83,
"source_head": "bef3575ddb19c44434a7e2460a353eac7c4d9387",
"substitution_maps": 12315,
"transcript_sha256": "a638540ca188e30c9c4c2a03da0b989f707bd7abecbbd6fe0ce604a73b398c36"
}
30 changes: 30 additions & 0 deletions research/f9-character-audit/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
{
"schema_version": 1,
"base_commit": "32890bc5de034ab8fc93ac88ead7279a6a416d04",
"files": [
{
"path": "certificates/selected-result.json",
"usage": "provenance",
"git_blob": "fc3d4ba105e1f097d0d7d051a308281e86ab1446",
"sha256": "66974efdced4083c00025f97d95d83909a226cdf801edb9301c195c6641f6903"
},
{
"path": "docs/research/agent-task-catalog.json",
"usage": "provenance",
"git_blob": "f126dd2e2dad2b669e75d1d0d0bd05c600725602",
"sha256": "f7a48bfa2659b88378282a8eee7d9fe52cdf505594124c4d1686b58510fffd72"
},
{
"path": "research/etale-tensor-determinant-image/README.md",
"usage": "provenance",
"git_blob": "0f07df6ce2a8c43ea1fcc5f0081ee3532da28208",
"sha256": "2ec18042a1a63d5fd5da246f4f6060c5fb66cff338f25a2a1b95e3ea8b4f0fba"
},
{
"path": "research/truncated-tensor-characters/README.md",
"usage": "provenance",
"git_blob": "9dac5ac07eb867ff2ff44bd8f033d0ac1114fb82",
"sha256": "2ebd7660dc342ea7a20c3c67dd58530b8ebf3d224ca13c5f689956338d3a32d7"
}
]
}
Loading
Loading