{"id":"2640a397-ec91-41b1-aec9-447fcea309e0","arxiv_id":"2506.13242","paper_version":7,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A new rational tensor decomposition multiplies 4x4 matrices in 48 scalar multiplications, extending the record from complex to rational coefficients and to rings with 1/2.","lead":"This paper presents a rational-coefficient algorithm that multiplies two 4x4 matrices with 48 non-commutative scalar multiplications, matching the best complex-number algorithm while working over any ring with an inverse of 2. It also provides an optimized straight-line program and mentions a similar improvement for 3x4 by 4x7 matrices.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central claim rests on an unverified finite tensor identity: the 48-term decomposition (Equations 25–72 and Appendix B) must be checked exactly, since a single sign or index error would invalidate the algorithm.","rationale":"The reader's weakest assumption is exactly the load-bearing point: the correctness of the explicit tensor decomposition in Equations (25)–(72) and Appendix B. I agree with that diagnosis. The paper has substantial independent support in the form of an explicit certificate, straight-line programs, and PLinOpt source files, and the main theorem is decidable by a finite exact computation, so this is a verifiable rather than speculative risk. The complexity-constant inconsistencies and the abstract's ring-generality overstatement are real but secondary: they affect presentation and auxiliary claims, not the existence of a 48-multiplication rational algorithm. Since the decisive check is straightforward and the current evidence is asserted rather than machine-verified, keeping the paper CONDITIONAL is appropriate: if the identity check passes, the central claim is established; if it fails, the paper should be rejected. No adjustment to the reader's verdict is needed.","tokens_in":39355,"tokens_out":8736,"duration_ms":100366,"concrete_test":"Fetch the machine-readable files data/4x4x4_48_rational_L.sms, _R.sms, and _P.sms from the PLinOpt repository (or parse Appendix B), and in a computer algebra system with exact rational arithmetic compute the 16×16×16 tensor τ_{i,j,k} = Σ_{r=1}^{48} L_{r,i} R_{r,j} P_{k,r}. Compare τ against the 4×4 matrix-multiplication tensor T, with T_{(a,b),(b,c),(a,c)} = 1 and T = 0 otherwise, for all 4096 index triples. Also run the straight-line program on two random 4×4 matrices over ℚ and over 𝔽_7, and compare each output with the ordinary matrix product. If every triple matches and both runs agree, the central existence claim is confirmed; any mismatch in a single entry would refute it.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's main theorem is existential: the 48 rank-one terms in Equations (25)–(72), equivalently the L, R, P matrices of Appendix B, must sum to the 4×4 matrix-multiplication tensor. This identity is the entire content of the central claim; without it the algorithm computes some other trilinear form and the title assertion fails. The paper presents the decomposition as a certificate and provides machine-readable source files, which is real evidence, but it does not give a step-by-step proof or a machine-checked verification. The matrices are dense and contain many signs and denominators, so a transcription error in any row could silently break the identity. The isotropy derivation in Section 3 explains the provenance of the decomposition but does not by itself prove that the written output is correct, and the final decomposition stands independently of that derivation. A secondary but real presentation issue is that the abstract's phrase 'any ring except those of characteristic 2' overstates generality: rings such as Z have characteristic 0 but no inverse of 2, whereas the body correctly requires an inverse of 2. This affects the statement of the theorem but not the existence of the algorithm itself.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims a rational-coefficient tensor decomposition for non-commutative 4x4 matrix multiplication with 48 rank-one terms, obtained by applying an isotropy to the complex-valued AlphaEvolve decomposition. The core content is the explicit decomposition in Equations (25)-(72), its LRP representation in Appendix B, and two straight-line programs with claimed complexity constants. The paper also mentions a companion rational 63-multiplication algorithm for 3x4 by 4x7 matrices. The central assertion is existential: the 48 displayed terms should sum to the 4x4 matrix-multiplication tensor over any ring containing an inverse of 2, a condition that the abstract incorrectly weakens to 'any ring except those of characteristic 2'.","tokens_in":39524,"tokens_out":7240,"duration_ms":84447,"significance":"If the decomposition is correct, this is a significant and useful result: it matches the best known rank of 48 for 4x4 matrix multiplication over the complex numbers while extending to rings with an inverse of 2, and it provides explicit straight-line programs and rational coefficients suitable for exact computation. The paper's strengths are its concrete, finite certificate (trilinear forms and LRP matrices), the provision of machine-readable source files in PLinOpt, and the potential for direct verification. However, the certificate is not formally verified in the manuscript, and there is an internal inconsistency in the claimed leading constant, so the significance is conditional on a correct verification and a corrected presentation.","major_comments":[{"comment":"The central claim that the 48 rank-one terms in Equations (25)-(72), equivalently the L, R, P matrices in Appendix B, sum to the 4x4 matrix-multiplication tensor is only asserted, not verified in the text. Because a single sign or coefficient error in any row would invalidate the algorithm, this identity is the load-bearing point of the paper. The reference to source files in Appendix A is helpful but does not by itself constitute a check. Please include a direct verification: either a short symbolic proof that the identity holds, a machine-checked certificate, or a minimal script that the reader can run to confirm the identity exactly.","section":"§3, Eqs. (25)-(72) and Appendix B"},{"comment":"The abstract states that the algorithm is 'valid over any ring except those of characteristic 2', which is false. Equations (25)-(72) contain coefficients 1/2, 1/4, and 1/8, so the algorithm requires an inverse of 2 in the coefficient ring. For example, the ring Z of integers has characteristic 0 but does not contain an inverse of 2. The body's statement 'over any ring containing an inverse of 2' is the correct generality; the abstract and any theorem statements should be aligned with it.","section":"Abstract and §1"},{"comment":"The abstract claims a running time of (347/32)n^{2+log_4 3}, while §4 reports 341 total operations and Equation (73) gives the leading coefficient 1 + 341/32 = 373/32 ≈ 11.65625. The count in Section 4 (104 + 84 + 1 + 119 + 33 = 341) matches 373/32, not 347/32. Please reconcile the operation count and the constant; as written, the claimed leading constant is internally inconsistent.","section":"Abstract versus §4, Eq. (73)"}],"minor_comments":[{"comment":"Please clarify that the 34 'multiplications (binary shifts)' counted in the straight-line programs are scalar multiplications by constants and are distinct from the 48 bilinear products p0,...,p47; otherwise the title's '48 multiplications' and the count of 341 operations may appear contradictory.","section":"§4, listings and counts"},{"comment":"The phrase '84 additions and 1 multiplications (binary shifts)' should read '84 additions and 1 multiplication (binary shift)'.","section":"§4, line before Eq. (73)"},{"comment":"The abstract claims a rational 63-multiplication algorithm for 3x4 by 4x7 matrices, but this manuscript does not provide the corresponding decomposition or certificate; it only refers to the twin note [3]. Please either state the claim as a reference to the companion note or include the certificate.","section":"§5 and Abstract"},{"comment":"The notation P_{*,i} in Definition B.1 should be explicitly defined as the i-th column of P; the current text 'P∗,i is Vect(Oi⊺)' is easy to misread.","section":"Appendix B, Definition B.1"},{"comment":"The typeset L, R, and P matrices are extremely dense and hard to audit. Adding a machine-readable checksum or a short verification command alongside the source-file references would substantially improve reproducibility.","section":"Appendix B"},{"comment":"Writing the denominator as 48-16 is unnecessarily opaque; since 48-16 = 32, please write 341/32 directly to avoid ambiguity.","section":"Eq. (73)"}],"recommendation":"major_revision","confidential_remarks":"The central decomposition is easy in principle to verify symbolically, and the authors clearly have the machinery to do so. I would want to see that verification and the corrected complexity constant before recommending acceptance. The abstract's overstatement about characteristic 2 should be fixed in revision; this is not merely cosmetic because it changes the claimed domain of validity. The companion 63-multiplication claim should be checked in [3] if it is to remain in the abstract."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core result is real: an explicit rational-coefficient tensor decomposition for 4x4 matrix multiplication with 48 scalar multiplications. That matches the best known complex-coefficient rank and improves on the 49-multiplication Strassen-based bound. The authors derive it by projecting AlphaEvolve's complex decomposition via an isotropy, and they provide the full LRP matrices plus straight-line programs. This is solid computational algebra.\n\nWhat's genuinely new is the rational decomposition itself and the technique of using the stabilizer to find a rational point in the orbit. The paper is honest about the derivation: it exhibits a certificate rather than claiming to prove a lower bound. The certificate is small (48 terms, 4x4 matrices) and the data files are linked. Any referee with a CAS can verify it in minutes. That's real evidence.\n\nSoft spots, in order of importance:\n\n1. The abstract says the algorithm is valid over \"any ring except those of characteristic 2.\" That is wrong as stated. The algorithm divides by 2, so it needs an inverse of 2; Z has characteristic 0 but no inverse of 2. The body corrects this in the alternative-basis section, but the abstract and the opening sentence overstate. Fix that.\n\n2. The complexity constant in the abstract (347/32) does not match the body (373/32 leading, 341/32 lower-order). Clearly a typo, but for a note whose contribution is partly about the running-time constant, it should be corrected.\n\n3. The 3x4x7:63 rational algorithm is mentioned in the abstract and conclusion, but the decomposition is in a twin-note. That is fine if it is clearly a separate result, but the abstract should either include it or state that it is in a companion paper.\n\nThe stress-test worry about the unverified tensor identity is, in my view, too strong. The LRP matrices are the identity; the paper asserts it and points to machine-readable source. It would be better practice to include a verification script, but the omission is a presentation issue, not a correctness hole.\n\nWho should read it: people working on fast matrix multiplication, both theoretical and exact computation. It is a useful data point and a nice example of isotropy projecting a complex algorithm onto Q. I would send it to a serious referee; the fixes are small.","headline":"A genuine rational 48-multiplication 4x4 algorithm with a checkable certificate; the abstract overstates ring generality and the complexity constant has a typo.","tokens_in":40091,"tokens_out":3936,"would_cite":true,"duration_ms":40183,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A69","68Q17","68Q25","68W30"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper presents an explicit 48-multiplication algorithm for 4x4 matrix multiplication using only rational coefficients, valid over any ring containing an inverse of 2.","keywords":["non-commutative matrix multiplication","tensor decomposition","tensor rank","4x4 matrix multiplication","isotropy action","rational coefficients","straight-line program","fast matrix multiplication"],"falsifier":"A direct verification settles the claim: take $4\\times 4$ matrices $A$ and $B$ with 32 independent indeterminates, run the straight-line program of Listings 1--4, and check that each of the 16 output expressions equals the corresponding entry of $A\\cdot B$. Equivalently, feed the 64 standard basis matrix pairs $(e_{ij},e_{kl})$ into the LRP representation and confirm that the 16 outputs are the right unit matrices.","tokens_in":39155,"feed_emoji":"✖️","tokens_out":12857,"duration_ms":119725,"temperature":0.7,"pith_summary":"The paper claims that two $4\\times 4$ matrices can be multiplied with 48 scalar multiplications using only rational coefficients, eliminating the complex-number arithmetic of the previous 48-multiplication algorithm. The claim is backed by an explicit tensor decomposition of type $16X^{2}Y^{2}Z^{2}+32XYZ$, i.e., a sum of 48 rank-one tensors with rational coefficients that reproduces the ordinary matrix product. Since the only denominators are powers of 2, the algorithm is valid over any ring containing an inverse of 2, including finite fields and non-commutative rings. The paper also contributes optimized straight-line programs (a leading constant of about 11.65 in the recursive complexity bound, and a variant whose leading constant is 7) and a companion rational 63-multiplication algorithm for $3\\times 4$ by $4\\times 7$ products.","feed_headline":"4x4 matrix product in 48 multiplications, no complex numbers","feed_subtitle":"The 48-multiplication algorithm now works over any ring with an inverse of 2, not just over the complex numbers.","key_machinery":"The central object is the matrix multiplication tensor and its decomposition into rank-one tensors; the mechanism is the isotropy action that preserves tensor rank. Concretely, for a decomposition whose terms are $M_i\\otimes N_i\\otimes O_i$, an isotropy $(U,V,W)$ sends each term to $(U^{-\\intercal}M_iV^{\\intercal})\\otimes(V^{-\\intercal}N_iW^{\\intercal})\\otimes(W^{-\\intercal}O_iU^{\\intercal})$, keeping the total number of multiplications unchanged. The paper picks one specific isotropy that maps the known complex decomposition to a rational one. The explicit runtime certificate is the list of 48 rank-one terms in Equations (25)--(72), encoded as the LRP matrices $L,R,P$ in Appendix B: the $i$-th product is $(L\\,\\mathrm{vec}(A))_i\\cdot(R\\,\\mathrm{vec}(B))_i$ and the output is $C=P\\cdot(\\text{products})$.","core_discovery":"On its own terms the paper shows that the best known 48-multiplication algorithm for $4\\times 4$ matrix multiplication, originally expressed over $\\mathbb{C}$, admits a rational point in its isotropy orbit. Using the stabilizer of the complex decomposition, the authors exhibit an isotropy---a triple of $4\\times 4$ matrices with determinant $\\pm1$---whose action, given by Equation (15), sends every coefficient to $\\mathbb{Q}$. The resulting certificate is the trilinear representation $m_1,\\dots,m_{48}$ in Equations (25)--(72), with type $16X^{2}Y^{2}Z^{2}+32XYZ$; contracting these rank-one terms with the input entries gives exactly the product matrix. Because all coefficients are rational, the algorithm is a genuine non-commutative matrix-multiplication algorithm over any ring with $2$ invertible.","pith_inferences":["A systematic consequence: for any tensor decomposition with a nontrivial stabilizer, searching the stabilizer's rational points may yield rational (or integral) representatives; the same orbit method could strip complex coefficients from other machine-discovered algorithms.","Valid over rings with $1/2$, the rational algorithm is immediately usable in exact-arithmetic and finite-field settings where complex arithmetic would be inappropriate or slower.","The paper leaves a numerical-stability study for future work; whether the rational form improves conditioning compared with the complex form is a concrete empirical question raised by this construction."],"forward_implications":["The 48-multiplication bound for $4\\times 4$ matrix product now holds over every ring with an inverse of 2, so characteristic 2 is the only ring characteristic where this bound is not obtained.","Recursive use of the optimized straight-line program gives complexity $\\left(1+\\frac{341}{32}\\right)n^{2+\\log_4 3}-\\frac{341}{32}n^2\\approx 11.65625\\,n^{2.792481250}-10.65625\\,n^2$.","The alternative-basis variant runs in $7n^{2+\\log_4 3}+o(n^{2+\\log_4 3})$ operations over any ring containing an inverse of 2.","The same isotropy technique yields a rational 63-multiplication algorithm for $3\\times 4$ by $4\\times 7$ matrices, matching the complex-coefficient record."],"supporting_citations":[{"why":"Supplies the original 48-multiplication complex-coefficient decomposition whose isotropy orbit is mined for a rational point.","marker":"[11]"},{"why":"Establishes the structure of the isotropy group of the matrix multiplication tensor that underlies the action.","marker":"[6]"},{"why":"Shows that isotropy acts transitively on rank-optimal 2x2 algorithms, motivating the orbit search approach.","marker":"[7]"},{"why":"Provides the earlier 47-multiplication algorithm in characteristic 2 and frames the record the paper extends to characteristic not 2.","marker":"[5]"},{"why":"Records the original decomposition and its stabilizer data, which the paper uses to choose the rationalizing isotropy.","marker":"[12]"},{"why":"Supplies the tensor-decomposition framework and the definition of the matrix multiplication tensor used in Section 2.","marker":"[10]"}],"fun_headline_variants":["4x4 matrix product in 48 multiplications, all rational","Rational 48-multiplication algorithm for 4x4 matrices","48-mult 4x4 matrix algorithm works over any ring with 2","No complex numbers: 48-mult algorithm for 4x4 matrix"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the explicit 48-term decomposition of Equations (25)--(72) sums exactly to the $4\\times 4$ matrix multiplication tensor; any sign, index, or transcription error in a single term would invalidate the algorithm.","fun_headline_variants_meta":{"raw":{"variants":["4x4 matrix product in 48 multiplications, all rational","Rational 48-multiplication algorithm for 4x4 matrices","48-mult 4x4 matrix algorithm works over any ring with 2","No complex numbers: 48-mult algorithm for 4x4 matrix"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000631,"raw_usage":{"total_tokens":2973,"prompt_tokens":1065,"completion_tokens":1908,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":681,"completion_tokens_details":{"reasoning_tokens":1828}},"tokens_in":681,"tokens_out":1908,"duration_ms":15700,"temperature":1.0,"reasoning_tokens":1828,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T00:36:22.255797+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct verification settles the claim: take $4\\times 4$ matrices $A$ and $B$ with 32 independent indeterminates, run the straight-line program of Listings 1--4, and check that each of the 16 output expressions equals the corresponding entry of $A\\cdot B$. Equivalently, feed the 64 standard basis matrix pairs $(e_{ij},e_{kl})$ into the LRP representation and confirm that the 16 outputs are the right unit matrices.","supporting_citations":[{"cited_title":"On varieties of optimal algorithms for the computation of bilinear mappings I","cited_arxiv_id":null,"evidence_quote":"Establishes the structure of the isotropy group of the matrix multiplication tensor that underlies the action."},{"cited_title":"On varieties of optimal algorithms for the computation of bilinear mappings II","cited_arxiv_id":null,"evidence_quote":"Shows that isotropy acts transitively on rank-optimal 2x2 algorithms, motivating the orbit search approach."},{"cited_title":"Fast matrix multiplication database [online]","cited_arxiv_id":null,"evidence_quote":"Records the original decomposition and its stabilizer data, which the paper uses to choose the rationalizing isotropy."}],"review_version":1}