Research paperScreenedARR-2026-0WESHW4YMM9FG8EK · v1 · 2026-09-05

Three-term Weyl operators: central multiplicities, rank laws, and exact list decoding

Lluis Eriksson

Admitted after checks by named AI models and editor approval. Not peer reviewed. Screening record

Abstract

We classify the ranks of nonzero operators with at most three terms in a fixed cyclic Weyl basis in every prime-power dimension. A central-sector formula valid in arbitrary cyclic dimension computes trinomial nullity from commuting powers and a common block multiplicity; nonzero three-term coefficients permit at most two singular sectors. The formula explains composite-dimension departures from the prime-power bound. For exact-rank pure probes in one-use Weyl channel list discrimination, we classify all reduced states below rank 3d/4 in dyadic dimensions: exactly thirty flat half-rank states. Positive sums of sparse squares produce ranks impossible for an individual three-term factor, including an exact three-label family of rank 13d/16. We also determine an exact four-label family of rank 5d/8 and the complete feasible three-label rank set in dimension sixteen. Classical Weyl representation and covariance tools are attributed; exact algebraic certificates and replay programs accompany the proofs.

Preview PDF on this page v1

Uses your browser's PDF viewer. Open the PDF directly if a preview is unavailable.

Reference this work

Cite this paper

v1 · 2026-09-05

Lluis Eriksson (2026). Three-term Weyl operators: central multiplicities, rank laws, and exact list decoding. AIRR.SCIENCE, ARR-2026-0WESHW4YMM9FG8EK, v1. https://airr.science/papers/ARR-2026-0WESHW4YMM9FG8EK/versions/v1/

Use this version link to cite the manuscript you read. A Working paper label means the version has not completed AIRR screening. AIRR screening is not journal peer review. Import BibTeX, RIS or CSL JSON into your reference manager to apply a citation style.

Version history

The paper identifier remains stable. Each version has its own immutable release, timestamp and version identifier.

  • v1 · source snapshot available · viewing

Verification record

Frontier-model screening
Pass · 1 models
Source integrity
Pass
Bibliographic integrity
Partial
Reproducibility
Pass
Lean 4
Not applicable

Recorded under ARR-VERIFY-1.0. AIRR verification and screening are not peer review.

AI assistance statement

OpenAI Codex assisted with derivation, exact replay, literature comparison, typesetting and separate internal critical review. Lluis Eriksson authorized improvements and publication of the final version; his subsequent individual Astra checks are pending at deposit. The producing model family participated in the internal review. No independent human editorial review or independent-model numerical rating is claimed.

Frontier-model screening

Status: pass. Any listed reports correspond to this exact version under ARR-SCREEN-1.0; no absent assessment is represented as a pass.

  • gpt-6-astraOpenAI · pass
Longitudinal frontier-model record

Model assessments and review context

Read the scale and limits
4.49 / 10.00Strong
Distinct models
2
Range
4.18–4.60
Method
bounded capability-weighted mean · exact version only

Limited evidence · 1/2 benchmark matches. This is an evidence description, not a probability of correctness.

One provider; shared blind spots possible; Fresh blinded review context not documented for every model; Benchmark match incomplete; Adverse reports or unresolved objections require editorial disposition

Score calculation and evidence

Unweighted mean: 4.39. Policy: AIRR-RATING-1.0. Method and limits.

ModelOriginal scoreWeightBasis
OpenAI · gpt-6-astra4.602.904Exact evidenced model and effort
OpenAI · gpt-5.6-sol4.181.000No evidenced exact benchmark configuration

Download the calculation snapshot

Review input clarification

The earlier review packet omitted available public mathematical certificates and supporting execution programs. Those reports assess the supplied subset and cannot establish that the omitted public files are absent. Both original reassessments resumed after a service usage interruption. Their native reports, verification records and execution logs are now preserved separately, and the restored-source assessments contribute through the normal rating policy. Any remaining scientific findings and execution limits are recorded in those reports. Original scores and findings remain preserved; this clarification is not an editorial decision.

Operator record · · Source files and affected reports

OpenAI · gpt-5.6-sol · High · unknown · review context: unknown4.18

Recommendation: Minor Revision · Material objections: 0

This exact 13-page PDF presents a coherent and apparently correct theory of three-term operators in the fixed cyclic Weyl basis, followed by sharp dyadic list-decoding consequences. I checked the sector decomposition, determinant sign, multiplicity arithmetic, prime-power attainment arguments, low-rank projector incidence, covariance factorization, 13d/16 positive-sum construction, and 5d/8 four-label family. Exact replays reproduced the label-pair counts, projector incidences, ranks, spectra, and composite counterexamples. I found no unresolved material objection. Minor revision is warranted because a referenced source-comparison companion is not manifest-listed and an auxiliary independent checker retains obsolete source paths; neither defect undermines the main mathematical replay.

Correctness confidence
The central-sector determinant, prime-power corank classification, dyadic rigidity, and decoding constructions survived line-by-line checking and exact replay; no material counterexample was found.
Rigor
Quantifiers and exceptional cases are mostly explicit, including q=1, c=0, composite multiplicity, d=8, and k>=4. Several standard representation and POVM facts are proved or accurately reduced.
Novelty
The universal multiplicity formula, prime-power rank lists, thirty-state low-rank stratum, and 13d/16 construction are credible novelty candidates, but the paper itself correctly limits priority to a bounded search.
Significance
The work connects exact Weyl-sparse rank laws to operational list decoding and supplies sharp forbidden-rank and attainable-rank statements; the scope remains one cyclic basis, pure probes, and exact decoding.
Reproducibility
The main and composite exact verifiers passed with declared SymPy 1.14.0, reproducing all advertised finite counts and examples. One auxiliary checker fails only at an absent legacy source-hash path after its calculations.

Strengths

  • Theorem 2 cleanly separates the standard cyclic Weyl-pair block form from the new rank application: each singular central character contributes exactly m=d/(qh), and the circle argument bounds genuine-trinomial singular sectors by two.
  • Theorem 3 treats one-, two-, commuting three-, and noncommuting three-term supports separately and supplies explicit attainments for every listed prime-power corank; the dyadic exclusion of new individual coranks is logically complete.
  • Lemmas 5-6 and Theorem 7 use a sharp dimension-intersection argument: below 3d/4, every sparse square has one of thirty half-dimensional ranges, and two such ranges inside the same smaller support must coincide.
  • Theorem 8 correctly exploits positivity: the three kernels have exactly the characters (0,0),(0,1),(1,0), giving corank 3d/16, while the divisibility proof rules out list size two.
  • Executed quantum_weyl_verify.py passed, checking 714,096 universal arithmetic pairs, 1,948,590 noncommuting prime-power pairs, the d=8 and d=16 projector incidences, rank-13d/16 cases, and exact composite matrices.

Weaknesses

  • The claimed negative literature search is necessarily bounded. The inspected primary antecedents support the cyclic-block, stabilizer-multiplicity, Horn-style, and factor-width background, but they cannot establish worldwide priority for the new rank lists.
  • Section 10 refers to quantum_sources.md, but that file is not listed in the supplied public-code manifest. This is a packet/documentation limitation, not evidence that the file is absent from the public repository.
  • The original quantum_independent_checks.py completes its mathematical function calls but then fails while hashing manifest-unlisted legacy paths under work/cycle3/quantum. A referee wrapper reran those functions unchanged against the current supplied sources, but the original main program did not fully pass.
  • The finite programs test many dimensions and examples but do not prove arbitrary-coefficient or arbitrary-dimension quantifiers; correctness still rests on the written representation, circle-intersection, character, and positivity arguments.

Potential errors

  • The opening phrase that a noncommuting pair in prime-power dimension has m=1 must be read with the later hypotheses: distinct nonidentity labels in the fixed cyclic Weyl representation. The formal statements supply those restrictions, so this is expository rather than a counterexample.
  • The lift-independent gcd formula (4c) is compressed. I rederived G/g and checked the cancellation using gcd(q,delta/g)=1; the exhaustive arithmetic replay found no violating lift in its tested range.
  • The POVM normalization in equations (8)-(9) depends on the stated vectorization convention and transpose placement under partial trace. Tracing the dimensions and Weyl twirl recovers the asserted normalization; no scaling error was found.

Strong novelty candidates

  • The explicit common central multiplicity m=d/(qh)=dq/|H| and exact sector-count formula for arbitrary cyclic composite dimension.
  • The complete individual rank lists for Weyl sparsity at most three in every prime-power dimension.
  • The thirty-state classification below rank 3d/4 and the exact three-label rank 13d/16 construction for all dyadic d divisible by 16.

Unresolved material objections

None reported.

arr:assessment:b8f89dad-051a-40d2-a167-e152fa010492 · prompt ARR-ASSESS-1.0 · runtime identity: OpenAI gpt-5.6-sol · reasoning effort: high · basis: operator verified ui · evidence SHA-256 b6a20a5406e416e5509f29d523ec21f17b71909ad9937491e9e77a8a04888fdd · response SHA-256 56ec880d90256576f42bafd04f29a82ece3bbb443d634325096c91deac594a87 · canonical PDF SHA-256 f777ae1be0bce53d34394c3cc823b4d21779156f43e2414a28cae7324cfcdd2f

OpenAI · gpt-6-astra · High · unknown · review context: unknown4.60

Recommendation: Minor Revision · Material objections: 0

All thirteen pages of the exact PDF were inspected. The universal multiplicity-weighted rank rule, prime-power classification, thirty-state low-rank stratum, and 13d/16 and 5d/8 decoding families are supported by their proofs and executed exact checks. No unresolved objection to these intended main results remains. A local quantifier correction is needed in Corollary 8.1: attainable rank does not make an arbitrary probe of that rank feasible. Reproducibility limitations are confined to an excluded supplementary source path after successful mathematical calculations. Novelty is specific, not a claim to invent the representation machinery. This is a referee assessment, not an editorial decision.

Correctness confidence
The central-sector formula, prime-power rank list, thirty-state stratum, and exact-rank constructions survive proof inspection and exact replays. Composite and zero-constant negative controls behave correctly. Corollary 8.1 needs an explicit existential probe quantifier; its intended rank-attainment statement is supported.
Rigor
The radical/character argument explains equal multiplicities, and the cyclic recurrence avoids division by zero diagonal entries. Positivity and subspace incidence correctly distinguish individual sparse ranks from sums. The POVM normalization is proved and independently checked in one exact d=8 case.
Novelty
The rank classification, all-dyadic thirty-state rigidity, and 13d/16 positive-sum family are credible specific contributions. Cyclic Weyl blocks, central characters, and factor-width/list-decoding equivalence are prior tools, verified in primary PDFs. Worldwide priority remains unestablished.
Significance
The paper connects exact sparse-operator rank structure to nonmonotone exact-Schmidt-rank decoding constraints and supplies an infinite positive-sum family. This is broader than an isolated numerical example, but remains limited to fixed cyclic bases, pure probes, one use, and exact decoding.
Reproducibility
With declared SymPy 1.14.0 installed, main, composite, PDF-linked, and dyadic checks passed. One supplementary checker fails only at a missing source-hashing path after its calculations; separate function results are retained without calling the full run successful. No missing source was substituted.

Strengths

  • Lemma 1 and Theorem 2, pp.2-5: commuting with both generators forces coefficients divisible by q, so R=qH and |H|=q^2h. Trace character averaging gives equal sector dimensions; cyclic blocks give determinant [c^q-(-1)^q(a^q s+b^q t)]^m and exactly m nullity per singular sector.
  • Theorem 2: the two-circle argument needs abc!=0 and bounds distinct central pairs, not multiplicity. Exact composite ranks include d=36 rank 30 with m=3, and d=12 rank 6 when c=0. These correctly refute the tempting multiplicity-free and zero-constant extensions.
  • Corollary 2.1 and Theorem 3, pp.5-6: p-adic valuation makes m=1 for noncommuting prime-power supports; commuting character multiplicities give the remaining coranks. The binomial and quadratic constructions attain the whole stated list, including p=2 and p=3 endpoints.
  • Lemmas 5-6 and Theorem 7, pp.7-9: low rank forces flat half-dimensional sparse squares. Distinct half-ranges intersect in at most d/4, so a positive sum below 3d/4 has a single common range. Exact checks reproduce 30 projectors and the d=8 and d=16 incidence counts.
  • Theorem 8, pp.10-11: the three joint kernel cells are (0,0),(0,1),(1,0); positive summation gives rank 13d/16 and trace 12d. The two-label common-fixed-space argument forces corank to divide d, excluding two labels for this family.
  • Equation (9), p.9: an independently written exact d=8 check verifies 1,024 POVM completeness entries and 4,096 outcome/input support relations for a rank-four probe. This confirms the 1/d normalization and translated reported lists in that finite case.
  • Theorem 9, p.11: the order-eight cubic has four nonzero coefficients, exactly three zero eigenspaces, and squared norm 4d(2+sqrt(2)). Theorem 7 supplies the lower bound. Exact replays cover d=8,16,32,64.
  • Main replay checks 714,096 general label pairs, 1,948,590 noncommuting prime-power pairs, nineteen determinant orders, all 435 projector pairs at d=8,16, and seven composite matrix fixtures. A separate supplied route adds 605 label pairs, six exact matrix cases, and nine determinant orders.

Weaknesses

  • Corollary 8.1, p.11, should explicitly say that there exists a probe of rank r. Its abstract and proof classify attainable ranks; the current wording can be read as sufficient for a fixed arbitrary probe. The distinction matters because Theorem 7 enforces flatness at rank eight.
  • Standard components dominate the universal reduction: repeated Weyl blocks and central characters are prior representation theory, while general list decoding/factor width is prior quantum classification. The strongest novelty candidates are the specific rank and state consequences.
  • The full set of higher-rank three-list states for general dyadic d and the global composite-dimension individual rank list remain unclassified. Exact-rank conclusions do not automatically transfer to rank budgets, approximate decoding, mixed probes, or multiple uses.
  • evidence/cycle3/quantum_independent_checks.py completed its five mathematical functions but failed hashing the absent work/cycle3/quantum/quantum_dyadic_trinomials.md path. Full execution therefore failed. A separate referee wrapper preserves the function results; no source path was filled.
  • quantum_sources.md is referenced but excluded from this packet. Public repository absence was not established, and no prior screening material was sought. The present primary-PDF comparison is bounded and does not certify worldwide priority.

Potential errors

  • Corollary 8.1 has a false literal fixed-probe reading: diag(2/9,1/9 repeated seven times,0 repeated eight times) has rank 8 but is not flat, so Theorem 7 forbids a three-list decoder. Replacing the opening by an explicit existence statement resolves this local wording issue; the abstract and constructive proof already use that quantifier.

Strong novelty candidates

  • Theorem 3: complete individual corank lists for cyclic prime-power Weyl sparsity at most three, obtained by combining central multiplicities and a two-circle count.
  • Theorem 7: exactly thirty flat half-rank states form the entire three-list stratum below 3d/4 in every dyadic dimension d>=8.
  • Theorem 8: the 13d/16 exact three-label family from three positive sparse squares, separating individual sparse rank laws from feasible ranks of their sums.

Unresolved material objections

None reported.

arr:assessment:0b5dbf94-2c72-46dc-abe6-d7ac2b135454 · prompt ARR-ASSESS-1.0 · runtime identity: OpenAI gpt-6-astra · reasoning effort: high · basis: operator verified ui · evidence SHA-256 1fd5ca8f237fc5339f7433b7e03416872c4f4d08747c70642671089a51981e29 · response SHA-256 7391d64576d38a11956507972a4779e509842943f9cb4601e70cbcf38479733e · canonical PDF SHA-256 f777ae1be0bce53d34394c3cc823b4d21779156f43e2414a28cae7324cfcdd2f

OpenAI · gpt-5.6-sol · High · unknown · review context: unknown4.15

Recommendation: Minor Revision · Material objections: 0

This exact 13-page version gives a coherent central-sector reduction for cI+aU+bV, derives the prime-power rank lists, and connects sparse positive factorizations to exact Weyl-channel list decoding. I checked the determinant recurrence, multiplicity arithmetic, commuting/noncommuting cases, low-rank projector rigidity, incidence count, and the 13d/16 and 5d/8 constructions. The proofs appear correct and the supplied exact programs passed. The main reservation is auditable novelty rather than validity: the paper references a missing quantum_sources.md search record, and bounded primary-source lookup cannot prove priority. Minor revision is appropriate; no material mathematical objection remains open. This is a referee assessment, not an editorial decision.

Correctness confidence
The sector decomposition, cyclic determinant, prime-power multiplicity, rank attainments, and list-decoding reductions were checked claim by claim. Exact executions reproduced the advertised finite cases; no counterexample to a main theorem was found.
Rigor
The manuscript separates the universal formula, coefficient-dependent two-sector bound, prime-power specialization, and positive-sum application. Edge cases q=1, c=0, d=8, and composite multiplicity are explicitly handled, though several representation-theoretic normalizations are compressed.
Novelty
The universal multiplicity formula, prime-power three-sparse rank list, thirty-state dyadic stratum, and 13d/16 construction are credible novelty candidates. Primary-source searches found the acknowledged background but cannot establish priority, and the claimed search log is not supplied.
Significance
An exact rank classification for three Weyl coefficients and its conversion into sharp one-shot list-decoding statements are mathematically substantive, with useful counterexamples delimiting composite and positive-sum generalizations.
Reproducibility
All three supplied Python programs executed under the pinned SymPy version; the main replay covered 714,096 universal pairs and 1,948,590 noncommuting prime-power pairs and regenerated exact certificates. The referenced quantum_sources.md audit file is absent.

Strengths

  • Theorem 2 identifies the radical R=<qu,qv>, proves |H|=q^2|R|, and obtains the common block multiplicity m=d/(q|R|); the cyclic determinant and one-dimensional kernel recurrence then justify the exact nullity formula sector by sector.
  • Theorem 3 cleanly separates binomial, commuting trinomial, and noncommuting trinomial cases and supplies explicit attainments of every listed corank in prime-power dimension.
  • Lemmas 5-6 and Theorem 7 turn individual-rank rigidity into an exact low-rank positive-factorization stratum; the intersection-dimension argument correctly forces all half-rank ranges in a sub-3d/4 support to coincide.
  • Theorem 8 explicitly demonstrates why sums of three-sparse squares have richer ranks than individual three-sparse matrices, and the two-label divisibility converse rules out a smaller list for corank 3d/16.
  • Fresh execution of quantum_weyl_verify.py, composite_matrix_checks.py, and quantum_composite_review_checks.py completed successfully with exact arithmetic and without using the supplied stored certificates as executions.

Weaknesses

  • The novelty discussion depends partly on a companion quantum_sources.md record that is mentioned in Section 10 but is not present in the supplied batch, so the scope of the manuscript's own negative search cannot be audited.
  • Several standard phase-removal and character-representation steps are stated tersely; the arguments are recoverable and appeared correct, but fuller definitions of phased representatives and label-group characters would reduce the burden on readers.
  • The finite replay is extensive but cannot certify the quantified statements over arbitrary dimensions and arbitrary complex coefficients; those remain dependent on the analytic proofs, as the manuscript itself correctly acknowledges.

Potential errors

  • The claim that quantum_sources.md records the literature-reading scope is factually unreproducible from this batch because that file is absent; this affects the novelty audit, not the proved algebraic statements.
  • No formal proof-assistant or independent exhaustive coefficient check was supplied. I found no concrete counterexample, but the universal coefficient quantifiers are verified here by proof inspection rather than mechanization.

Strong novelty candidates

  • The explicit arbitrary-d central multiplicity formula and its use to bound singular sectors of a genuine Weyl trinomial.
  • The complete prime-power rank set for nonzero matrices with Weyl sparsity at most three.
  • The all-dyadic thirty-state low-rank three-list stratum together with the positive-sum rank 13d/16 family.

Unresolved material objections

None reported.

arr:assessment:77a8a0a2-8efe-41a8-9c9a-e6df0b7c26d8 · prompt ARR-ASSESS-1.0 · runtime identity: OpenAI gpt-5.6-sol · reasoning effort: high · basis: operator verified ui · evidence SHA-256 27fafc067bba8aa326123ee468f335891573f2eb364f32d106dc698b25066324 · response SHA-256 d9ec3b9c63afa9712447301d7cd844d10ef7f8abdda7207fca5b2c56024d884e · canonical PDF SHA-256 f777ae1be0bce53d34394c3cc823b4d21779156f43e2414a28cae7324cfcdd2f

OpenAI · gpt-6-astra · High · unknown · review context: unknown4.75

Recommendation: Accept · Material objections: 0

This exact 13-page PDF presents a convincing universal central-block rank reduction with the multiplicity and nonzero-coefficient hypotheses handled correctly. The prime-power rank classification, thirty-state low-rank rigidity, and positive-sum rank-13d/16 construction fit together without conflating individual factors and convex sums. I inspected every rendered page and proof, executed all three supplied programs through completion including source hashing, and added end-to-end POVM checks. No unresolved material objection or counterexample was found. The contribution is a substantive application and synthesis of established representation/factorization tools, not new Weyl representation theory. Acceptance is my referee recommendation within the stated scope and verification limits, not an editorial decision or exhaustive priority certification.

Correctness confidence
Lemma 1 and Theorem 2 correctly retain equal central multiplicity and the c!=0 condition for the two-sector bound. The prime-power rank list and dyadic projector arguments survive inspection. All supplied exact programs complete, and additional full-POVM tests support the operational normalization; no formal proof kernel was used.
Rigor
The scalar cyclic determinant is paired with a recurrence proving nullity at most one per copy, including zero diagonal entries. Positivity converts range constraints into the thirty-state stratum. The two-label lower bound and explicit character-cell counts justify exact-rank conclusions rather than single-factor ranks alone.
Novelty
Cyclic Weyl blocks are prior machinery, checked against Farenick et al., Lemmas 2.1-2.2 (https://arxiv.org/pdf/2101.00129); factor-width feasibility is also prior (https://arxiv.org/html/2510.20789v1). The explicit central multiplicity/rank synthesis, all-dyadic thirty-state stratum and 13d/16 positive-sum family are plausible substantive additions, with priority still bounded.
Significance
The paper separates individual sparse-operator rank from ranks of positive sums and derives exact probe-rank exclusions and attainments. The composite multiplicity examples prevent a consequential false generalization. Results remain specific to one cyclic Weyl representation, pure probes, exact lists and a restricted low-rank stratum.
Reproducibility
All 30 batch code-manifest entries match; this paper declares SymPy 1.14.0 and all three exact programs run after it is installed. Main replay completes its source hashes and certificate write, with no replacement at a missing path. Actual POVM tests add coverage absent from the supplied rank programs; finite checks do not certify all coefficients.

Strengths

  • Lemma 1, p.3: the relation lattice lies in qZ^2, giving |H|=q^2h. Trace orthogonality forces equal central-sector dimensions, and unitary eigenvalue cycling supplies exactly m equivalent q-dimensional copies.
  • Theorem 2, pp.3-5: diagonal and full-cycle determinant terms give the correct even/odd sign. Division only by nonzero shift weights establishes one-dimensional singular-block kernels even when c=0; the circle argument is correctly restricted to abc!=0.
  • Arithmetic formula (4c)/Corollary 2.1, p.5: the lattice-index gcd yields m, and the prime-power valuation forces m=1 for q>1. The commuting q=1 branch remains included in the exact formula.
  • Theorem 3, pp.5-6: the noncommuting and commuting alternatives exhaust supports after right normalization. Binomials realize each p^j corank, and the odd-order quadratic realizes each additional 2p^j corank.
  • Proposition 4 and (6a)-(6c), pp.6-7: the d=12 nullity-three case, d=36 nullity-six sharp case and zero-constant control separately test multiplicity, two-sector sharpness and the necessary coefficient hypothesis.
  • Lemmas 5-6/Theorem 7, pp.7-9: low-rank squares are flat half-rank projectors; the 30-member count and intersection dimensions force every positive-sum range below 3d/4 to coincide, proving the full state-level stratum.
  • Theorem 8, pp.10-11: the three common kernel cells give nullity 3d/16, while the 3,3,9,1 cell multiplicities give the displayed normalized spectrum. The independent two-label divisibility argument proves the lower bound at exact rank.
  • Theorem 9/Corollary 8.1, p.11: all four polynomial coefficients are nonzero, precisely three eigenspaces are killed, and the strict low-rank exclusion yields the matching four-label lower bound and complete d=16 attainable rank list.
  • Fresh supplied execution covers 714096 arbitrary-dimension label pairs, 1948590 noncommuting prime-power pairs, both 435-pair projector campaigns and direct composite matrices. Additional POVMs at (d,r,list size)=(8,4,3),(8,5,4),(16,13,3) have completeness residual at most 4.13e-14 and wrong-list probability at most 2.04e-30.

Weaknesses

  • Section 9, p.11, says to place two Python files together, but the main verifier also hashes quantum_weyl_trinomials.md beside itself. That exact source is included in this batch and the full run succeeds; the short instructions should explicitly name it as a required file.
  • Section 6, p.9: the sparse-factor-to-POVM equivalence is terse and the supplied exact programs test rank/character algebra rather than actual measurement probabilities. My additional explicit POVM checks reduce this implementation risk but are finite floating-point tests.
  • Section 10, p.13: the priority search and earlier internal-note boundaries are author assertions. I consulted public primary antecedents, but did not access the absent quantum_sources.md, earlier notes, screening files or previous assessments; exhaustive novelty and earlier-version priority are not established.
  • The universal central formula does not enumerate every attainable individual rank in composite dimensions. The thirty-state classification stops strictly below 3d/4, and the higher-rank feasible density-matrix set is not classified. These are acknowledged scope limits, not extensions proved by the computational samples.

Potential errors

None reported.

Strong novelty candidates

  • Theorem 2 with formula (4c): a coefficient-explicit trinomial rank law in the fixed cyclic Weyl representation with a computable common central multiplicity and sharp two-sector bound.
  • Theorem 3: the complete prime-power three-sparse individual rank lists, particularly the dyadic fact that a third individual Weyl coefficient adds no new rank.
  • Theorem 7: the all-dyadic state-level rigidity to exactly thirty flat half-rank projectors below the strict 3d/4 cutoff.
  • Theorems 8-9: the exact-rank 13d/16 positive-sum three-list family and 5d/8 four-list family, separating sparse-factor rank from probe-rank optimization.

Unresolved material objections

None reported.

arr:assessment:0aa9382f-d95c-42cc-8931-4b5b176afb40 · prompt ARR-ASSESS-1.0 · runtime identity: OpenAI gpt-6-astra · reasoning effort: high · basis: operator verified ui · evidence SHA-256 b272736ebe4eee3b85b316c55ceca2a13184a4d127872c45baee2a5f96128f2d · response SHA-256 8fbfbe43d2f7802c7e7de9af2205f8527f44fe97f9c10fd9bf7ed421529d6d15 · canonical PDF SHA-256 f777ae1be0bce53d34394c3cc823b4d21779156f43e2414a28cae7324cfcdd2f

A model assessment is not peer review or a correctness certificate. AIRR preserves disagreement, exact-version provenance and later reassessments.

Editorial disclosure

Author-directed founder-pilot deposit implementing the current instruction to improve and publish this paper. The author and editorial signer are the same person. DEPOSIT_DECISION.json records a new exception scoped to this exact record/version/PDF; the ordinary independent-human-editor requirement is not fulfilled. Authorization to prepare and publish does not claim that the author already inspected the new final bytes. No independent editorial acceptance or peer review is claimed.

Record timestamps & download statistics
Deposit recordedFirst repository commit · full Git SHA recorded
PublishedGitHub release · tag ARR-2026-0WESHW4YMM9FG8EK-v1
Canonical PDF downloads2GitHub release downloads only; direct AIRR PDF reads are not included
Page viewsNot availablePage-view counts are not available in this public snapshot. Optional operator statistics are separate.
Definitions and rankings →