{"id":"d3136386-9441-4de5-8bd2-cfeebedd6944","arxiv_id":"1908.04228","paper_version":2,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A set of complex symmetric matrices is simultaneously diagonalizable by congruence exactly when the common kernel has the expected dimension and a related set of reduced matrices is simultaneously diagonalizable by similarity.","lead":"A new theorem gives a complete answer to when several complex symmetric matrices can be turned into diagonal matrices at the same time by a single congruence transformation. The criterion reduces the question to an older, easier problem about simultaneous diagonalization by similarity, so it can be checked in finitely many steps.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"The reader's verdict of ACCEPT is appropriate. The proof of Theorem 14 is internally consistent: the forward direction correctly derives S^T A_j S = D_j and invertibility of S from invertibility of the reduced pencils, and the converse correctly applies Theorem 7 after kernel reduction. The matrices L_j are well-defined up to simultaneous similarity: any two choices of Q from Lemma 10 differ by a block matrix with zero top-right block and invertible top-left block, so L_j' = S^{-1}L_jS and SDS is invariant. The finite procedure is legitimate because the maximum pencil rank can be found as the largest size of a non-identically-vanishing minor, and a rank-maximizing λ0 exists outside the vanishing variety of those minors. The only mathematical error in the manuscript is Remark 11, which incorrectly claims that an orthogonal basis for the bilinear form z·w yields a unitary Q; this is false for non-real complex orthogonal matrices and fails when the common kernel is totally isotropic. Since the remark is never used, the central theorem stands. The reader's identified weakest assumption, Takagi's factorization, is a standard and correct theorem, so it does not constitute a load-bearing concern.","tokens_in":12731,"tokens_out":28056,"duration_ms":281549,"concrete_test":"Run a numerical battery on random complex symmetric matrices (e.g., m=3, n=5, nonsingular pencil): compute r by a non-vanishing minor, choose λ0, form L_j = A(λ0)^{-1}A_j, verify SDS via commutation plus diagonalizability, construct Q as in Theorem 7, and confirm Q^T A_j Q is diagonal to machine precision across 1000 trials. This would catch any hidden ordering or algebraic error in the constructive proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No load-bearing concern found. Theorem 14's reduction of simultaneous diagonalization by congruence to simultaneous diagonalization by similarity is rigorously proved: the necessary kernel-intersection condition follows from Lemma 8 and Theorem 9, and the converse uses Lemma 10 plus Theorem 7 on the nonsingular reduced pencil. The only invocation of external theory is Takagi's factorization, a standard theorem, which is used correctly to diagonalize the complex symmetric blocks in Eq. (3.7). A minor inaccuracy appears in Remark 11: an orthonormal basis for the bilinear form z·w gives a complex orthogonal Q (Q^T Q = I), not a unitary Q in the usual sense, and such a basis need not exist when the common kernel is totally isotropic. This remark is not used in any proof and does not affect the central claim.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper characterizes simultaneous diagonalization by congruence (SDC) of a finite set of complex symmetric matrices. After defining the linear pencil A(λ)=Σ λ_j A_j and its maximum rank r, the authors prove in Theorem 14 that A_1,...,A_m are SDC if and only if dim(∩ ker A_j)=n−r and the reduced r×r matrices L_j = \\tilde A(λ0)^{-1}\\tilde A_j, obtained after a kernel reduction, are simultaneously diagonalizable by similarity (SDS). Since SDS is equivalent by Theorem 3 to pairwise commutation plus individual diagonalizability, the criterion is checkable in finitely many steps. The proof proceeds through a nonsingular-pencil case (Theorem 7, using Takagi factorization), a diagonal-case kernel reduction (Lemma 8), and a general kernel reduction (Lemmas 9 and 10); two examples illustrate the procedure, including a case that is not SDC.","tokens_in":12836,"tokens_out":13636,"duration_ms":152012,"significance":"The result is a complete solution to a long-standing question and provides a clean, externally checkable criterion: the SDC problem is reduced to the classical SDS problem, whose own criterion is pairwise commutation and diagonalizability. The derivation is rigorous and self-contained modulo standard matrix-analysis theorems, uses no fitted parameters, and is not circular. The finite-step procedure and the worked examples make the criterion concrete, and the applications to evolution algebras and blind source separation are plausible. The paper does not provide a complexity analysis or a numerical algorithm for finding a maximizing λ0, but the central mathematical characterization is sound.","major_comments":[],"minor_comments":[{"comment":"The block-decomposition argument constructs n1 from the first run of identical diagonal entries of D(j). If all D(j) are scalar multiples of the identity, then p_j=n for every j and the quantity α(j)_2 = α^j_{n1+1} is undefined. This endpoint case is trivial (take d=1 and diagonalize B(λ0) directly), but it should be stated explicitly so that the proof covers all cases.","section":"Theorem 7, proof after Eq. (3.3)"},{"comment":"The procedure requires λ0 ∈ C^m with rank A(λ0)=r but does not explain how such a point is to be obtained. Because the maximum rank is attained on a nonempty Zariski-open set, a generic choice works; adding one sentence to that effect, or an algebraic elimination method, would make the advertised 'finite number of steps' claim precise. Section 4's note that an efficient method is future work is acceptable, but the gap between procedure and algorithm should be acknowledged in §3.3.","section":"§3.3, step (2), and Definition 5"},{"comment":"The remark is incorrect as stated: orthogonality of columns with respect to the bilinear form ⟨z,w⟩=z·w gives Q^T Q=I, i.e., Q is complex orthogonal, not unitary in the usual sense Q^*Q=I. Moreover, such an orthonormal basis for this form need not exist when the common kernel is totally isotropic. The remark is not used in any proof, so the central conclusions are unaffected, but it should be corrected or deleted.","section":"Remarks 11"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The thing to know: this paper actually solves the problem it claims to solve. It gives the first complete criterion for when an arbitrary finite set of complex symmetric matrices is simultaneously diagonalizable by congruence (SDC), with no nonsingularity assumption. The reduction to the classical SDS problem is clean and, as far as I can tell, correct. If you work in matrix analysis or blind source separation, this is worth your time.\n\nThe main idea is to look at the linear pencil A(λ) = Σ λ_j A_j, take its maximum rank r, and note that SDC forces the common kernel to have dimension n − r. After reducing to that kernel, the problem becomes an SDC problem for an r × r pencil that is nonsingular at a maximizing λ0. For such pencils, SDC is equivalent to simultanous diagonalizability by similarity of the matrices A(λ0)^{-1} A_j. The proof of the converse uses Takagi's factorization, which is a standard theorem and is applied correctly. The finite-step procedure at the end is genuinely useful and the examples are worked through properly.\n\nSoft spots, in proportion: the biggest practical gap is finding λ0 with maximum pencil rank. The authors acknowledge this and give no algorithm, which means the criterion is not yet a turnkey numerical test. That's a real limitation for applications, but it does not touch the mathematics. The only outright error I found is in Remark 11: an orthonormal basis for the bilinear form z·w gives a complex orthogonal matrix (Q^T Q = I), not a unitary matrix in the usual sense, and such a basis need not exist when the common kernel is totally isotropic. But that remark is not used in any proof, so it's cosmetic. The citation pattern looks fine; the self-citation to the evolution algebra paper is relevant and not self-serving.\n\nWho is this for? Anyone working on simultaneous diagonalization, quadratic forms, evolution algebras, or BSS. The paper deserves a serious referee — I would send it out without hesitation. If I were refereeing, I'd ask for a note about λ0 computation and a corrected Remark 11, but I'd recommend acceptance without demanding major changes.","headline":"A rigorous, self-contained solution to a long-standing problem in matrix analysis; worth a serious referee despite a few minor blemishes.","tokens_in":13323,"tokens_out":1569,"would_cite":true,"duration_ms":20266,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A","65K","90C","94A"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that a finite set of complex symmetric matrices is simultaneously diagonalizable by congruence exactly when its common kernel has the maximal possible dimension and the reduced matrices $L_j$ are simultaneously…","keywords":["simultaneous diagonalization via congruence","complex symmetric matrices","matrix pencil","maximum pencil rank","simultaneous diagonalization via similarity","kernel reduction","evolution algebras","blind source separation"],"falsifier":"Search over 2-by-2 and 3-by-3 complex symmetric pairs $(A_1,A_2)$: if any pair satisfies $\\dim(\\ker A_1 \\cap \\ker A_2) = n - r$ and $L_2 = \\tilde{A}(\\lambda_0)^{-1} \\tilde{A}_2$ is diagonalizable, but no nonsingular $P$ makes both $P^T A_1 P$ and $P^T A_2 P$ diagonal, then Theorem 14 is false.","tokens_in":12550,"feed_emoji":"🔢","tokens_out":10380,"duration_ms":91935,"temperature":0.7,"pith_summary":"This paper claims to close the long-standing problem of deciding when a finite set of complex symmetric matrices can be simultaneously diagonalized by congruence (SDC): when one nonsingular matrix $P$ makes every $P^T A_j P$ diagonal. The authors show the question reduces to a lower-dimensional problem at the size of the maximum pencil rank $r$: one first removes the common kernel, then forms reduced matrices $L_j = \\tilde{A}(\\lambda_0)^{-1} \\tilde{A}_j$. The original matrices are simultaneously diagonalizable by congruence exactly when the kernel has the maximal possible dimension and the reduced matrices are simultaneously diagonalizable by similarity. Because simultaneous diagonalization by similarity has a classical pairwise test, the result turns SDC into a finite, checkable procedure. A reader should care because the same question underlies blind source separation, optimizations over quadratic forms, and the recognition of evolution algebras.","feed_headline":"One test decides when complex symmetric matrices diagonalize together","feed_subtitle":"Question reduces to checking r-by-r reduced matrices for commutation and diagonalizability.","key_machinery":"The load-bearing object is the linear matrix pencil $A(\\lambda) = \\sum_{j=1}^m \\lambda_j A_j$ and its maximum rank $r = \\max_\\lambda \\operatorname{rank} A(\\lambda)$. A first lemma shows the common kernel of the $A_j$ sits inside the kernel of $A(\\lambda_0)$ for a maximal point $\\lambda_0$, and the two coincide exactly when $\\dim(\\bigcap_j \\ker A_j) = n - r$. This equality is what allows Lemma 10 to compress the matrices by congruence to $\\tilde{A}_j \\oplus 0_{n-r}$, with $\\tilde{A}_j$ of size $r$ and the reduced pencil $\\tilde{A}(\\lambda_0)$ invertible. Then Theorem 7 does the main work: for a nonsingular pencil, $P^T A(\\lambda_0)^{-1} A_j P$ diagonalizes by similarity exactly when $P^T A_j P$ diagonalizes by congruence, using the identity $(P^T A(\\lambda)P)(P^{-1}A(\\lambda)^{-1}A_j P) = P^T A_j P$ and a blockwise diagonalization of the symmetric matrix $B(\\lambda_0)$. The reduced matrices $L_j = \\tilde{A}(\\lambda_0)^{-1} \\tilde{A}_j$ inherit the property $\\sum_j (\\lambda_0)_j L_j = I_r$, so only $m-1$ pairwise commutation checks are needed.","core_discovery":"The central theorem states that complex symmetric matrices $A_1,\\ldots,A_m$ with maximum pencil rank $r$ are SDC if and only if $\\dim(\\bigcap_j \\ker A_j) = n - r$ and the reduced matrices $L_j = \\tilde{A}(\\lambda_0)^{-1} \\tilde{A}_j$ are SDS (simultaneously diagonalizable via similarity), where $\\lambda_0$ is any point where the pencil $A(\\lambda) = \\sum_j \\lambda_j A_j$ attains its maximum rank. The kernel condition is necessary: under SDC the common kernel must be exactly the kernel of the pencil at a maximal point, of dimension $n - r$. When it holds, the matrices compress by congruence to $\\tilde{A}_j \\oplus 0_{n-r}$ with invertible reduced pencil, and the main transfer theorem converts diagonalization by congruence of the $\\tilde{A}_j$ into diagonalization by similarity of the $L_j$. Combined with the classical criterion that a family is SDS iff its members pairwise commute and each is diagonalizable, this yields a three-step decision procedure. The proof of the converse direction leans on the standard factorization that every complex symmetric block can be diagonalized by a unitary congruence with real nonnegative diagonal entries.","pith_inferences":["A natural next step is to turn the decision procedure into a numerical algorithm; the main computational bottleneck the paper leaves open is an efficient way to locate a point $\\lambda_0$ where the pencil attains its maximum rank.","For approximate joint diagonalization, the kernel condition $\\dim(\\bigcap_j \\ker A_j) = n - r$ suggests that cost functions should penalize or exploit the common kernel explicitly, something the ad-hoc cost functions mentioned in the paper do not do.","The same reduction may extend to other settings, such as Hermitian matrices under *-congruence, where an analogous maximal-rank point and kernel reduction would need a replacement for the unitary factorization step.","In the real case, Theorem 14 would need the additional constraint that the eigenvectors and eigenvalues of the reduced matrices $L_j$ be real; the paper notes this but does not develop the real criterion."],"forward_implications":["Any finite set of complex symmetric matrices can be decided in finitely many steps: compute $r$, test the kernel dimension, then test the reduced matrices for pairwise commutation and individual diagonalizability.","The complex SDC problem for arbitrarily many matrices is thereby reduced to the classical similarity problem, for which a simple pairwise test exists.","The criterion extends earlier results that handled only pairs or required at least one nonsingular matrix; the kernel reduction removes the nonsingularity restriction.","In the motivating application, an algebra is an evolution algebra exactly when its structure matrices pass this SDC test, giving a finite criterion for recognizing evolution algebras.","For exact blind source separation, the result identifies precisely when a set of measured second-characteristic-function matrices can be jointly diagonalized to recover the sources."],"supporting_citations":[{"why":"Supplies the unitary congruence factorization used to diagonalize the symmetric blocks in Theorem 7 and the classical SDS criterion of Theorem 3.","marker":"[12]"},{"why":"Establishes the unitary version of the problem for pairs, the baseline this paper generalizes to arbitrary families.","marker":"[10]"},{"why":"Extends the unitary reduction to families, another reference point for the full SDC question.","marker":"[11]"},{"why":"Provides a lemma and the quadratic-programming application that the nonsingular-pencil proof in Theorem 7 builds on.","marker":"[14]"},{"why":"Supplies the recurring theorem for pairs of quadratic forms that the nonsingular-pencil argument follows.","marker":"[22]"}],"fun_headline_variants":["Finite-step test settles simultaneous diagonalization by congruence","SDC decided: reduce to commuting diagonalizable matrices","Kernel condition and commutativity decide congruence diagonalization","Reduce SDC to classical simultaneous similarity problem","One condition plus commuting: congruence diagonalization test"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The converse direction of the main theorem assumes the classical factorization that every complex symmetric matrix can be diagonalized by a unitary congruence to a real nonnegative diagonal matrix; if that standard result were false, the constructed congruence in the proof would not exist.","fun_headline_variants_meta":{"raw":{"variants":["Finite-step test settles simultaneous diagonalization by congruence","SDC decided: reduce to commuting diagonalizable matrices","Kernel condition and commutativity decide congruence diagonalization","Reduce SDC to classical simultaneous similarity problem","One condition plus commuting: congruence diagonalization test"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001457,"raw_usage":{"total_tokens":5842,"prompt_tokens":904,"completion_tokens":4938,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":520,"completion_tokens_details":{"reasoning_tokens":4865}},"tokens_in":520,"tokens_out":4938,"duration_ms":37540,"temperature":1.0,"reasoning_tokens":4865,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:47:04.890622+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Search over 2-by-2 and 3-by-3 complex symmetric pairs $(A_1,A_2)$: if any pair satisfies $\\dim(\\ker A_1 \\cap \\ker A_2) = n - r$ and $L_2 = \\tilde{A}(\\lambda_0)^{-1} \\tilde{A}_2$ is diagonalizable, but no nonsingular $P$ makes both $P^T A_1 P$ and $P^T A_2 P$ diagonal, then Theorem 14 is false.","supporting_citations":[{"cited_title":"A.; Johnson, C","cited_arxiv_id":null,"evidence_quote":"Supplies the unitary congruence factorization used to diagonalize the symmetric blocks in Theorem 7 and the classical SDS criterion of Theorem 3."},{"cited_title":"P., Horn R","cited_arxiv_id":null,"evidence_quote":"Establishes the unitary version of the problem for pairs, the baseline this paper generalizes to arbitrary families."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Extends the unitary reduction to families, another reference point for the full SDC question."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides a lemma and the quadratic-programming application that the nonsingular-pencil proof in Theorem 7 builds on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the recurring theorem for pairs of quadratic forms that the nonsingular-pencil argument follows."}],"review_version":1}