Skip to content

Prove the sharp four-qubit Clifford tensor threshold T(4)=13 - #7766

Open
aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-079
Open

aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-079

Conversation

@aliromman

@aliromman aliromman commented Nov 19, 2026 •

Copy link
Copy Markdown
Contributor

Scoped native-algebra theorem: the full Gaussian-dyadic four-qubit Clifford alphabet is pointwise tensor-independent exactly at widths f >= 13. Thus T(4)=13. Width eleven has exact nullity 2,733,412,864. Two inflated modules remain absent at width twelve, giving nullity at least 10,677,394. Every quotient row occurs at width thirteen. No new kappa follows.

Read the proof, all 81 multiplicities and finite certificates, checker, source pins, external mathematical inputs and credits. This resolves and extends the width-ten question in PR #7747.

Width Projective Gram result
10 Nullity at least 14,400 from a degree-120 Dickson block
11 Exact nullity 2,733,412,864; exact rank 12,125,935,463,936
12 Nullity at least 10,677,394
13 and above Full rank 12,128,668,876,800

The width-eleven quotient uses the conjugate natural representation and character (-1)^d 2^(5d). Its only missing quotient rows are 9 and 22, of degrees 595 and 3213. At width twelve, the Pauli-invariant subspace is exactly that quotient, so the inflated copies of both rows remain absent. The width-thirteen quotient has character (-1)^d 2^(6d) and all 81 multiplicities positive. Schur products propagate full rank to every later width. Keeping the Gaussian phase and the correct natural/conjugate sector is necessary.

The published ordinary Sp(8,2) character table is a mathematical input. The CTblLib 1.3.11 archive and exact table member were SHA-256 authenticated; the unchanged source extractor rederived the complete retained projection. Every multiplicity is an exact nonnegative integer. Degree sums, two bin formulas and independent ten-/twelve-tuple orbit norms agree. These checks do not reconstruct the table from group multiplication.

A separate table-independent theorem gives T(n)>=2n+3 for every positive n divisible by four. Every tuple stabilizer in the minus quadratic form contains a negative Dickson transvection. Inducing the actual Bell-line character times this sign gives an absent even-sector module. Its degree is 2^(n-1)(2^n-1). For n=4 it gives the width-ten block and explicit trace-based null coefficients, with identity coefficient 120.

Finite checks cover all 200,787 four-spaces and a separate singular-space census, 34,816 transvection point actions, 18,496 transvection pairs and all 14,400 sign products in a complete small orthogonal group. Literal checks cover 65,536 Pauli/Bell characters, 65,536 Bell inner products and 5,120 images under all twenty Clifford generators. Exterior-square traces agree with direct minors. Plus-type, longer-tuple, omitted-sign and changed-character controls distinguish the scope and the missing module.

Python 3.12, standard library only:

python3.12 -B scripts/research_package.py --package research/clifford-four-qubit-threshold

Both registered commands print:

PASS_CLIFFORD_FOUR_QUBIT_THRESHOLD
Sharp threshold T(4)=13; width eleven nullity 2733412864; width twelve nullity >= 10677394
Width thirteen: all 81 quotient rows occur; full Gram rank 12128668876800
Four qubits at width ten: absent degree 120, nullity >= 14400, T(4) >= 11
200787 four-spaces; independent singular-space census 1,119,1071,765,0
65536 Pauli characters; 65536 Bell inner products; 5120 literal Clifford Bell images
Independent signed quotient sums: minus multiplicity 0, plus multiplicity 1
Written extension: T(n) >= 2n+3 for every positive n divisible by four

The README gives the optional source-archive command. That command also passed. The unchanged width-nine source checker, normal/optimized registered replay, syntax/indentation, committed bytes/source history/modes, export and sealed read-only Git-free serial replay pass. Hosted CI did not certify this package. The plan job failed in the shared test_current_ci_section_matches_selected_record: the base guide names frontier6030 while the selected record requires make frontier7000-verify. The log reports 760 tests, one failure and 24 skipped; package replay was skipped. This package changes no shared CI file. Local replay remains the scientific evidence.

Nick Petalas (@petalas) supplied the width-nine quotient proof, projection and unchanged checker. alephnan (@alephnan) supplied the odd-sector and quadratic-character framework in PR #6714, with its stated OpenAI Codex assistance and prior credit. Ali Romman (@aliromman) supplied the pointwise framework in PR #5526. The character data credit the ATLAS and Thomas Breuer’s CTblLib. The Dickson homomorphism is the classical Taylor Theorem 11.43.

The all-n Dickson statement is written mathematics with finite checks at n=4. No full four-qubit group, tensor matrix or trillion-entry null vector was materialized. Full even-sector nullities, other qubit congruence classes, sharp conditioning, native implementation and complete caller pricing remain open. The full three-qubit suite, selected cold replay, Lean and Docker were not run. All five framework assumptions and the selected frontier remain unchanged. No independent human/formal-kernel acceptance or global literature priority is claimed.

Base: canonical main e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Seven retained files have exact pins; no unmerged ancestry is asserted. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. Canonical claim.

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.

1 participant