{"id":"7db76b31-298a-4553-aacb-bc7623415a2a","arxiv_id":"1908.03462","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A polynomial-transform version of the Davis-Kahan theorem that bounds distances between any two corresponding contiguous eigenspaces, with affine transforms as a tractable special case.","lead":"This paper extends the Davis-Kahan theorem, a standard tool for bounding how much two matrices' eigenvectors can differ, by allowing a polynomial transformation of one matrix before the comparison. The extension can produce tighter bounds and applies to any consecutive block of eigenvectors, with a graph example where the bound becomes exactly zero.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The advertised universality 'any two symmetric matrices' is not established: Theorem 5 is conditional on the existence of a polynomial p satisfying Constraints 1 and 2, and the paper never proves such a p always exists, even for affine transforms.","rationale":"The central theorem and its proof are internally consistent: the interval choices (7) and (8) do satisfy the Davis-Kahan hypotheses, and the delta definitions ensure that the open interval contains exactly the intended block eigenvalues. The sole unresolved point is whether a transform satisfying Constraints 1 and 2 exists for every pair of spectra with nonzero boundary eigengaps. This existence is essential to the paper's advertised universality, but it is only asserted in the introduction and invoked through an algorithm in a separate paper. The reader identified this same gap, and our reading agrees. A quick examination suggests an affine transform may always be feasible by taking a large positive slope and choosing the intercept to satisfy the linear inequalities in Section VI, but the manuscript does not supply this argument. Therefore the verdict should remain conditional: the theorem is correct as stated, but the universal extension needs a supporting existence proof or a softened claim.","tokens_in":16309,"tokens_out":25613,"duration_ms":228373,"concrete_test":"Solve the linear feasibility problem for affine transforms in Section VI: for interval choice (8) and c1>0, the conditions reduce to linear inequalities in (c1,c0); check whether for every pair of spectra satisfying Assumption 2 there is a feasible point (e.g., choose c1 large and c0 satisfying the bounds derived from (13),(14)). If a short existence lemma follows, add it; if a counterexample exists, weaken the universal claim in Section II to require the user to verify the constraints.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section II claims that for any two symmetric matrices with nonzero boundary eigengaps a valid DK interval setup can always be found. This is the load-bearing extension beyond the standard theorem. However, Theorem 5 and Corollary 1 only prove a bound conditional on a polynomial p satisfying Constraints 1 and 2A/B; the existence of such a p for arbitrary spectra satisfying Assumption 2 is asserted but not demonstrated. Section VI gives explicit formulas for affine transforms but no feasibility argument, and Section VII's proof of concept relies on a special case where Lsym is exactly d^{-1}L, with the general algorithm deferred to Paper II. If for some spectra no admissible transform exists, the 'any two' claim fails and the extension applies only to user-verified cases. This is a missing proof in the central theory, not merely a computational detail.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper extends the Davis-Kahan (DK) theorem to compare the subspaces spanned by any r consecutive eigenvectors of two symmetric matrices. The main idea is to apply a polynomial matrix transform p(·) to one of the matrices, which preserves eigenvectors but moves eigenvalues so that a DK-type bound becomes applicable. The central result, Theorem 5 and Corollary 1, states that if a polynomial p satisfies Constraints 1 and 2A or 2B, then the projector distance and the Frobenius distance (up to an orthogonal rotation) are bounded by ||p(Φ)-Ψ|| divided by an eigenvalue-separation factor δ. Theorem 3 treats the special case of the first r eigenvectors and proves that, under nonzero r-th eigengaps, a DK interval always exists, yielding a bound in terms of a between-matrix eigengap. A proof-of-concept example for d-regular graph Laplacians is given, where the affine transform c1 = d^{-1}, c0 = 0 exactly maps L to Lsym, and the algorithm from a companion paper is said to identify this transform automatically.","tokens_in":16518,"tokens_out":16794,"duration_ms":158352,"significance":"The paper offers a genuinely useful idea: using polynomial matrix transforms to relax the restrictive eigenvalue-interval structure of the DK theorem and to tighten the resulting bound. The conditional Theorems 5 and Corollary 1 are carefully proved in Appendix D, and Lemma 2 provides a sharp constant c_{n,r} = sqrt(2 min(r,n-r)) for the relation between the two distance metrics. Theorem 3 is a clean and valid extension of the DK theorem to first-r eigenvector comparisons. If the existence of admissible transforms for arbitrary spectra is established, this work would have broad applicability in graph signal processing, spectral clustering, and spiked covariance models. However, the advertised universality for 'any two symmetric matrices' is not proved in the manuscript, and the proof of concept depends on a special spectral relation and on an algorithm deferred to a companion paper.","major_comments":[{"comment":"","section":"Section II (last paragraph), Section V-C/V-D, Section VII"},{"comment":"","section":"Section V-D (Remark 4 and the paragraph after Corollary 1)"}],"minor_comments":[{"comment":"","section":"Appendix D (proof of Theorem 5, interval choice (8))"},{"comment":"","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The central conditional theorem is sound, and the missing existence proof seems plausibly fillable for affine transforms. If the authors can supply a feasibility lemma for the affine case, the paper would meet its advertised scope. The companion-paper dependence in Section VII is a concern for a standalone theory paper: at minimum, the authors should state precisely what is assumed from Paper II for the existence and automatic identification of the transform."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my read. The paper extends Davis-Kahan by applying a polynomial matrix transform to one of the two matrices. Theorem 5 is the main new result: if a polynomial p satisfies their Constraints 1 and 2, then you get the standard DK inequality with p(Phi) - Psi in the numerator and a transformed eigengap in the denominator. I checked the proof in Appendix D and it is correct; the constraints are exactly what is needed for the interval requirements of the original theorem. Corollary 1 follows cleanly via their Lemma 2. Theorem 3, the between-matrix eigengap bound for the first r eigenvectors, is a nice self-contained contribution; I had not seen the max(phi_{r+1}-psi_r, psi_{r+1}-phi_r) denominator before.\n\nThe core idea is genuinely useful. Transforming one matrix preserves eigenvectors but moves eigenvalues, so you can create a positive separation where the standard DK setup has none. That matters for comparing adjacency versus Laplacian eigenvectors and for tightening perturbation bounds.\n\nThe soft spot is the gap between the abstract's 'any two symmetric matrices' and what is actually proved. Theorem 5 is conditional on the existence of a polynomial satisfying Constraints 1 and 2. The paper never proves such a polynomial always exists, even among affine transforms. Section VI gives formulas for affine maps but no feasibility argument. The proof of concept uses d-regular graphs, where Lsym = d^{-1}L exactly, so the affine transform is known by inspection and gives a zero bound. That is a good illustration, not a demonstration of the general claim. The missing existence argument is the difference between 'we can tune a bound when a transform exists' and 'we can always find such a transform.' If the authors want the universal claim, they need to prove it, or at least prove it for affine transforms, or soften the language to 'whenever an admissible transform exists.'\n\nThe paper is clearly written, the conditional result is solid, and the related literature is handled fairly. The typos in Appendix D ('Contraints' and a mix-up of 2A/2B) are minor.\n\nMy verdict: this deserves a serious referee. It is not ready as is, but the conditional theorem and Theorem 3 are publishable contributions, and the overclaim is fixable. I would not desk-reject.","headline":"The polynomial-transform extension of Davis-Kahan is a genuinely new conditional bound, but the advertised universality for arbitrary spectra is not proven; Theorem 3's between-eigengap formula is a nice standalone contribution.","tokens_in":16994,"tokens_out":3581,"would_cite":true,"duration_ms":37715,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A42"],"pacs":[],"model":"deepseek-v4-flash","headline":"Polynomial transform extends Davis–Kahan eigenvector bound to any block","keywords":["Davis-Kahan theorem","polynomial matrix transform","affine transform","eigenspace distance","graph shift operator","canonical angles","eigenvector perturbation"],"falsifier":"A concrete negative test is to enumerate all possible orderings of n transformed eigenvalues achievable by polynomials of degree at most d for a given spectrum, and check whether any ordering places the r middle eigenvalues between the outside ones as Constraints 1 require; a spectrum where no admissible ordering exists, despite nonzero boundary eigengaps, would falsify the claim that the extension applies universally to any two symmetric matrices.","tokens_in":16134,"feed_emoji":"📐","tokens_out":7181,"duration_ms":66497,"temperature":0.7,"pith_summary":"This paper extends the Davis–Kahan theorem, the standard tool for bounding how far the eigenspaces of two symmetric matrices can be, so that it applies to any corresponding consecutive block of eigenvectors rather than only the leading r. The device is a polynomial matrix transform: applying p to one matrix leaves its eigenvectors unchanged but moves its eigenvalues, so the separation required by Davis–Kahan is shifted from the fixed spectra to transformation parameters the user controls. The paper proves that if the transform satisfies two explicit constraints on where the transformed eigenvalues lie, the usual subspace-distance bound holds with denominator δ_i and numerator ||p(Φ)-Ψ||, and the standard theorem is a special case. Because the transform can be chosen to shrink the matrix difference and enlarge the eigengap, the new bounds are guaranteed to be no worse than classical Davis–Kahan bounds. A proof-of-concept on d-regular graphs shows the method automatically recovers the exact eigenvector agreement between unnormalised and normalised graph Laplacians.","feed_headline":"Polynomial transform extends Davis–Kahan eigenvector bound to any block","feed_subtitle":"Eigenvalue restrictions move to transform parameters, so the same bound covers reversed spectra and tightens.","key_machinery":"The central object is the polynomial matrix transform p(Φ): by the spectral mapping property for symmetric matrices, if (φ, w) is an eigenpair of Φ then (p(φ), w) is an eigenpair of p(Φ), so eigenvectors are untouched while eigenvalues are relocated. The paper's Constraints 1 and 2A/2B are the load-bearing conditions: they ensure that after transformation, the r eigenvalues of p(Φ) in the block of interest and the corresponding block of Ψ can be enclosed in Davis–Kahan intervals S1, S2 separated by δ_i > 0. With these constraints, the paper obtains the bound ||W_j W_j^T (I - V_j V_j^T)|| ≤ ||p(Φ) - Ψ|| / δ_i for every unitarily invariant norm, and the Frobenius variant with constant c_{n,r} = $\\sqrt$(2 min(r, n - r)) from Lemma 2, which relates the two subspace distance metrics via canonical angles.","core_discovery":"The paper's central claim is Theorem 5 and Corollary 1: for symmetric matrices Φ and Ψ with nonzero jth and (j+r)th eigengaps, any polynomial p satisfying Constraints 1 and 2A (or 2B) yields the bound ||W_j W_j^T (I - V_j V_j^T)|| ≤ ||p(Φ) - Ψ|| / δ_i for every unitarily invariant norm, and ||W_j - V_j Q||_F ≤ c_{n,r} ||p(Φ) - Ψ||_2 / δ_i for some orthogonal Q. The paper asserts that this extension applies to any two symmetric matrices, excluding degenerate cases, and to any r consecutive corresponding eigenvectors, with the original Davis–Kahan theorem recovered as the special case j = 0, p(x) = x; consequently the extended bounds are at least as tight as classical ones. The transform is the mechanism: since eigenvectors of p(Φ) are eigenvectors of Φ, the subspace distance is unchanged while the spectral positioning is adjustable. The proof-of-concept example with d-regular graphs is central: for these graphs L_sym = $d^{{-1}}$L, so the affine transform with c1 = $d^{{-1}}$, c0 = 0 maps L exactly to L_sym and the extended bound is identically zero, whereas the standard Davis–Kahan bound is generally nonzero.","pith_inferences":["The authors leave implicit that the zero-bound phenomenon provides a practical certificate: if a user can find an admissible transform mapping Φ exactly to Ψ, the bound certifies exact eigenspace agreement; applying this to empirically estimated graph spectra would give a testable equivalence test between graph shift operators.","An extension not pursued here is to apply the same transform device to normal matrices or to non-symmetric spectra via a Jordan-form version of the spectral mapping, though the interval geometry would need substantial reworking.","The dependence of the bound on δ_i suggests a data-driven heuristic the paper does not develop: among candidate ranks r and offsets j, choose the block that maximizes the between-matrix separation, since a larger denominator directly shrinks the bound before any optimization of p."],"forward_implications":["For any two symmetric matrices whose spectra have nonzero boundary eigengaps around the compared block, the extended bound applies even when the compared eigenvalues occupy opposite ends of the spectrum, a case the classical theorem cannot handle.","Because the standard Davis–Kahan theorem is the special case j = 0 with p(x) = x, the new bound is at least as tight as the classical bound in every setting where both apply.","Users can choose the polynomial to minimize ||p(Φ) - Ψ||_2 and maximize the interval separation δ_i, making the bound an optimization target rather than a fixed quantity.","In the d-regular graph example, the bound is identically zero when the transform maps the unnormalised Laplacian to the normalised one, so the method automatically identifies the equality of the corresponding eigenspaces."],"supporting_citations":[{"why":"Supplies the original Davis–Kahan theorem that the paper extends.","marker":"[4]"},{"why":"Provides the theorem statement (p. 211–212) and the interval-separation formulation used as Theorem 2.","marker":"[2]"},{"why":"Establishes the polynomial spectral mapping: eigenvectors of p(Φ) are eigenvectors of Φ with eigenvalues p(φ), the basis of the transform device.","marker":"[10]"},{"why":"Defines the two subspace distance metrics and supplies the Frobenius–canonical-angle relations used in Lemma 2.","marker":"[22]"},{"why":"Provides Proposition 2.2 and equation (2.6) used to relate the Frobenius metric to sin canonical angles in the proof of Lemma 2.","marker":"[25]"},{"why":"Supplies the rank–norm inequality ||X||_F ≤ sqrt(rank(X)) ||X||_2 that produces the constant c_{n,r}.","marker":"[1]"}],"fun_headline_variants":["Polynomial transform tightens Davis-Kahan for any symmetric pair","Davis-Kahan bound generalized to arbitrary symmetric matrices via transform","Move eigenvalue gaps to transform parameters, widen Davis-Kahan scope","Tighter eigenvector distance bound for all symmetric matrices","Polynomials bend Davis-Kahan to cover every consecutive eigen-block"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The theorem's breadth rests on the assumption that for any two symmetric spectra with nonzero jth and (j+r)th eigengaps, some polynomial (at least an affine one) exists whose transformed eigenvalues satisfy Constraints 1 and 2; this existence is stated and demonstrated in examples but not proven here.","fun_headline_variants_meta":{"raw":{"variants":["Polynomial transform tightens Davis-Kahan for any symmetric pair","Davis-Kahan bound generalized to arbitrary symmetric matrices via transform","Move eigenvalue gaps to transform parameters, widen Davis-Kahan scope","Tighter eigenvector distance bound for all symmetric matrices","Polynomials bend Davis-Kahan to cover every consecutive eigen-block"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001424,"raw_usage":{"total_tokens":5749,"prompt_tokens":952,"completion_tokens":4797,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":568,"completion_tokens_details":{"reasoning_tokens":4713}},"tokens_in":568,"tokens_out":4797,"duration_ms":37921,"temperature":1.0,"reasoning_tokens":4713,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:13:19.961120+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete negative test is to enumerate all possible orderings of n transformed eigenvalues achievable by polynomials of degree at most d for a given spectrum, and check whether any ordering places the r middle eigenvalues between the outside ones as Constraints 1 require; a spectrum where no admissible ordering exists, despite nonzero boundary eigengaps, would falsify the claim that the extension applies universally to any two symmetric matrices.","supporting_citations":[{"cited_title":"The Rotation of Eigenvectors by a P er- turbation. III,","cited_arxiv_id":null,"evidence_quote":"Supplies the original Davis–Kahan theorem that the paper extends."},{"cited_title":"Bhatia, Matrix Analysis , Berlin, Germany: Springer Science & Business Media, 2013","cited_arxiv_id":null,"evidence_quote":"Provides the theorem statement (p. 211–212) and the interval-separation formulation used as Theorem 2."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes the polynomial spectral mapping: eigenvectors of p(Φ) are eigenvectors of Φ with eigenvalues p(φ), the basis of the transform device."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the two subspace distance metrics and supplies the Frobenius–canonical-angle relations used in Lemma 2."},{"cited_title":"Minimax sparse principal subspace est imation in high dimensions,","cited_arxiv_id":null,"evidence_quote":"Provides Proposition 2.2 and equation (2.6) used to relate the Frobenius metric to sin canonical angles in the proof of Lemma 2."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the rank–norm inequality ||X||_F ≤ sqrt(rank(X)) ||X||_2 that produces the constant c_{n,r}."}],"review_version":1}