{"id":"67b85336-70cf-4076-8684-5878b8108ec7","arxiv_id":"1908.00881","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper re-proves known theorems of Sinajova, Rankin, and Kuperberg on spherical point configurations using spherical Euclidean distance matrices and the Perron-Frobenius theorem, though one proof has a gap.","lead":"This note gives simpler linear algebra proofs of three known theorems about points on a sphere, using distance matrices and Perron-Frobenius. The proofs are clear, but the proof of Kuperberg's theorem contains a gap that would need fixing.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The Kuperberg proof's block decomposition in Eq. (10) omits irreducible components whose Perron root is less than 1; such components can occur under the theorem's hypotheses, so the split conclusion does not follow as written.","rationale":"The reader's weakest assumption is exactly the point I found independently: Eq. (10) does not follow from multiplicity alone because irreducible blocks with Perron root < 1 are permitted. My 6-point example satisfies all hypotheses of Theorem 5.1 and makes the false intermediate claim concrete. This is a genuine gap in the proof of Kuperberg's theorem as written, not merely a stylistic issue or a disagreement with consensus. The Sinajova and Rankin arguments appear sound; the construction above even suggests a repair for Theorem 5.1, since a sub-1 block can be appended to one of the n - r Perron blocks to obtain a larger simplex subspace. Because the manuscript's stated central claim is to give proofs of all listed theorems, and one proof is incomplete, the conditional verdict is appropriate. I agree with the reader's assessment and would not change it. The test described would settle whether the concern lands: if the example is accepted as satisfying the hypotheses and no permutation yields only two irreducible Perron blocks, then Eq. (10) is false and the proof needs revision; the theorem itself may still stand.","tokens_in":8061,"tokens_out":13849,"duration_ms":140066,"concrete_test":"Run the proof's Eq. (10) on the explicit 6-point configuration whose Gram matrix is B = blockdiag(B1, B2, B3) with B1 = B2 = [[1,-1],[-1,1]] and B3 = [[1,-1/2],[-1/2,1]]. Set Delta = I - B and D = 2(E-I) + 2Delta. Verify: D has zero diagonal and off-diagonal entries {4, 3, 2}, all >= 2; Dw = e with w = (1/8)(1,1,1,1,0,0); rank(B) = 4; and e^T w = 1/2, so D is a unit spherical EDM satisfying every hypothesis of Theorem 5.1. Then check whether any permutation makes Delta block diagonal with exactly n - r = 2 irreducible blocks of spectral radius 1. It does not: Delta has three irreducible components, one with spectral radius 1/2. This disproves the intermediate assertion in Eq. (10).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The crucial step is in Section 5, immediately after Lemma 3.1. From m(lambda_max(Delta)) = n - r >= 2 the proof concludes that Delta is reducible and that, after a permutation, Q Delta Q^T has exactly n - r irreducible diagonal blocks, each with lambda_max = 1 (Eq. 10). Perron-Frobenius only forces at least n - r blocks with spectral radius 1; it does not forbid additional irreducible blocks with spectral radius < 1. Such blocks are possible while satisfying every hypothesis. For example, take Delta = diag(A, A, C) with A = [[0,1],[1,0]] and C = [[0,1/2],[1/2,0]]. Then lambda_max(Delta) = 1 with multiplicity 2, so for n = 6 the rank of B = I - Delta is 4 and D = 2(E-I) + 2Delta is a unit spherical EDM of embedding dimension 4 with all off-diagonal entries at least 2. The hypotheses 2 <= n - r <= r hold, yet Delta has three nonzero irreducible components, not n - r = 2. The proof then derives D_i = 2(E-I) + 2 Delta_i and applies Lemma 4.1 to each Delta_i; the 1/2-component belongs to no D_i, so the stated orthogonal split is not established. The conclusion of Theorem 5.1 may still be true (the small component can be merged with one of the lambda_max = 1 blocks), but that repair is not in the manuscript.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This note proposes a unified linear-algebraic proof of four classical theorems on spherical point configurations: Sinajova's theorem on orthonormal representations of graphs, Rankin's two dispersion theorems for n=r+2 and n=2r, and Kuperberg's orthogonal-splitting theorem for r+2≤n≤2r. The common device is to write a unit spherical Euclidean distance matrix D as D=2(E−I)+2Δ. Lemma 3.1 shows that under this normalization λmax(Δ)=1 and the embedding dimension is n minus the multiplicity of that eigenvalue. The Perron–Frobenius theorem is then applied to the nonnegative matrix Δ. Section 3 proves Sinajova's theorem, Section 4 proves Rankin's n=r+2 theorem, and Section 5 derives Kuperberg's theorem, with Rankin's n=2r theorem presented as a special case.","tokens_in":8373,"tokens_out":8881,"duration_ms":87579,"significance":"If all proofs were correct, the paper would be a compact and attractive unification: the EDM formulation makes the role of the Perron–Frobenius theorem transparent, and the proofs are genuinely elementary and free of fitted parameters. The derivations of Sinajova's theorem and Rankin's n=r+2 theorem are clean and sound. However, the proof of Kuperberg's theorem currently rests on an unjustified block-decomposition claim in Section 5, and since Rankin's n=2r theorem is deduced from Kuperberg's theorem, the paper's central claim is not fully established as written. The gap appears repairable, but the repair is not present in the manuscript.","major_comments":[{"comment":"The Perron–Frobenius theorem does not imply that QΔQᵀ has exactly n−r nonzero irreducible diagonal blocks all with λmax=1. It implies only that there are at least n−r irreducible components with Perron root 1; additional irreducible components with Perron root strictly less than 1 are allowed. Such a case satisfies every hypothesis of Theorem 5.1: take n=6 and Δ=diag(A,A,C), where A=[[0,1],[1,0]] and C=[[0,1/2],[1/2,0]]. Then λmax(Δ)=1 with multiplicity 2, so B=I−Δ has rank 4, and D=2(E−I)+2Δ is a unit spherical EDM of embedding dimension r=4; all off-diagonal entries of D are at least 2, and 2≤n−r≤r. Yet Δ has three nonzero irreducible components rather than the n−r=2 asserted in Eq. (10). Therefore the displayed decomposition is false in general, and the conclusion that the configuration splits into n−r simplex classes does not follow from the proof as written. Since Theorem 5.1 is also used to obtain Rankin's n=2r theorem, the proof of that result is likewise incomplete. A repair would need to handle the low-Perron-root blocks explicitly, for example by merging them into neighboring Perron components, but no such argument appears in the manuscript.","section":"Section 5, Eq. (10)"}],"minor_comments":[{"comment":"The displayed inequality \"r ≤ n−k\" is backwards; the reasoning in the preceding sentence gives m(λmax(Δ)) ≤ k, and hence r = n−m(λmax(Δ)) ≥ n−k, which is the lower bound needed for the theorem.","section":"Section 3, final paragraph"},{"comment":"The phrase \"at least one of the off-diagonal diagonal entries of D is 2\" should be \"at least one of the off-diagonal entries of D is 2\".","section":"Section 5, paragraph after Theorem 5.1"},{"comment":"\"subsapces\" is a typo for \"subspaces\".","section":"Example 5.1"},{"comment":"The proof, described only as similar to Lemma 4.1, would be clearer with an explicit rank computation showing how the padded zero block contributes no additional rank; the statement is true under the standing assumption that D is a unit spherical EDM, so λmax of the padded matrix is 1.","section":"Lemma 5.1"}],"recommendation":"major_revision","confidential_remarks":"The paper is well written and the Sinajova and first Rankin proofs are sound. The only substantive issue is the block-decomposition gap in Section 5; the counterexample shows the current proof is invalid, but the theorem itself is not contradicted and a repair seems achievable. I recommend asking the author to revise the proof of Theorem 5.1 to account for irreducible components with Perron root less than 1."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing to know: this note gives short linear-algebraic proofs of three known theorems in spherical point configurations, using spherical Euclidean distance matrices and the Perron-Frobenius theorem. The results are not new; the value is the unified machinery. And it mostly works. The Sinajova proof is clean, the Rankin proof is solid, and the example at the end illustrates the geometry nicely. But the Kuperberg proof has a genuine gap.\n\nThe problem is equation (10). From the Perron-Frobenius theorem and the fact that λ_max(Δ) has multiplicity n−r ≥ 2, the author concludes Δ is block diagonal with exactly n−r irreducible blocks, each with spectral radius 1. That does not follow. Perron-Frobenius gives at least n−r such blocks; there can also be irreducible blocks with spectral radius less than 1. The stress-test example—three blocks, two with spectral radius 1 and one with spectral radius 1/2—satisfies all the hypotheses of Theorem 5.1 but has three irreducible components, not n−r = 2. So as written, the split into the subspaces L_i is not established. The theorem itself is known, and the gap looks repairable: you can likely merge the small block with an adjacent λ=1 block and recover the same conclusion. But that repair is not in the manuscript.\n\nOther issues are minor. There is a typo in Section 3 (an inequality direction in the nonexistence part), and the author rightly acknowledges that Naszódi and Polyanskii already used the same EDM-plus-Perron-Frobenius idea for Rankin's theorem. So the novelty is the unified treatment and the Sinajova proof, which is nice but not a game-changer.\n\nWho should read this? Anyone teaching distance geometry or spherical codes will like the Sinajova proof and the elegant Lemma 3.1. The Kuperberg gap makes the note a little risky as-is, but it is specific and fixable. I would send it to a refereed venue—a short note like this deserves a referee—with a clear request to fix the block decomposition argument. The rest of the proof is easy to verify.","headline":"A neat, honest unification of three known theorems via EDM plus Perron-Frobenius; the Sinajova and Rankin proofs work, but the Kuperberg proof has a real gap in its block decomposition that looks repairable.","tokens_in":8851,"tokens_out":3556,"would_cite":false,"duration_ms":32834,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A18","51K05","52C17"],"pacs":[],"model":"deepseek-v4-flash","headline":"Four known theorems about spherical point configurations are reproved as corollaries of a single eigenvalue-multiplicity lemma for spherical Euclidean distance matrices.","keywords":["orthogonal representation of graphs","distance geometry","sphere packing","dispersion problem","Euclidean distance matrices","Perron-Frobenius theorem","spherical point configurations"],"falsifier":"Take any unit spherical configuration satisfying Kuperberg's hypotheses—say n points on the unit sphere in Rr with 2 ≤ n - r ≤ r and all pairwise squared distances at least 2—form D and Δ = D/2 + I - E, and compute the Perron-Frobenius block decomposition of Δ. If any irreducible block has spectral radius strictly less than 1 while λmax(Δ) = 1 has multiplicity n - r, the proof's equation (10) is unjustified; finding even one such example would invalidate the proof as written, while checking a regular crosspolytope should produce exactly r blocks of spectral radius 1.","tokens_in":7849,"feed_emoji":"📐","tokens_out":8074,"duration_ms":74953,"temperature":0.7,"pith_summary":"This note claims that four classical theorems about point configurations on a unit sphere—a graph orthonormal-representation dimension theorem, two packing bounds of Rankin, and Kuperberg's splitting theorem—are all consequences of a single linear-algebraic fact about spherical Euclidean distance matrices. The fact, proved as Lemma 3.1, is that for any unit spherical EDM D written as D = 2(E - I) + 2Δ, the normalized matrix Δ has largest eigenvalue 1, and the embedding dimension of the configuration equals n minus the multiplicity of that eigenvalue. From this, the four theorems follow by applying the Perron-Frobenius theorem to nonnegative irreducible blocks of Δ. A sympathetic reader should care because the paper replaces several separate geometric arguments with one linear algebra calculation, making the common structure of the theorems visible.","feed_headline":"Four sphere theorems from one distance-matrix identity","feed_subtitle":"The largest eigenvalue is 1; its multiplicity gives the embedding dimension, and that fact carries all four proofs.","key_machinery":"The load-bearing object is the decomposition of a unit spherical EDM D as D = 2(E - I) + 2Δ, where E is the all-ones matrix and Δ is a symmetric nonnegative matrix with zero diagonal. Lemma 3.1 is the identity λmax(Δ) = 1, with the vector w satisfying Dw = e serving as an eigenvector for λmax(Δ), and the rank formula r = n - m(λmax(Δ)). Because the Gram matrix is B = E - D/2 = I - Δ, this decomposition converts spherical geometry into nonnegative-matrix spectral data, so Perron-Frobenius controls irreducibility, positivity, and block structure.","core_discovery":"The central discovery is that the geometry of widely separated points on a unit sphere is encoded in the spectrum of a normalized nonnegative matrix built from the squared distances. Specifically, for any unit spherical Euclidean distance matrix D, setting D = 2(E - I) + 2Δ gives a symmetric nonnegative matrix Δ with zero diagonal; the Gram matrix of the configuration is I - Δ, so Δ has largest eigenvalue exactly 1, and the configuration's embedding dimension is n minus the multiplicity of λmax(Δ). The paper then shows that rank considerations force the contradiction in Rankin's n = r + 2 theorem, force the block decomposition in Kuperberg's splitting theorem, and, through the adjacency matrix of a graph, give the dimension formula d(G) = n - k for orthonormal representations. The theorems themselves are not new; the contribution is that each is presented as a corollary of the same eigenvalue-multiplicity identity combined with Perron-Frobenius theory.","pith_inferences":["The eigenvalue-multiplicity formula suggests a general necessary condition for any spherical point configuration with prescribed minimal distance: the normalized distance matrix's largest eigenvalue 1 and its multiplicity constrain the number of points that can sit on a given sphere. This is an extension beyond the four theorems treated in the paper.","The proof's distinction between the origin lying in the relative interior versus relative boundary of a block's point set could be developed into a classification of the rigid-motion types admitted by Kuperberg's splitting, since it records whether the zero eigenvector block has positive support.","A likely testable extension is to replace the unit sphere by a sphere of radius ρ: the scaling of Δ should shift the eigenvalue condition, possibly yielding analogous packing statements for other minimal-distance thresholds. The paper does not pursue this.","For orthonormal graph representations, the same machinery might generate dimension bounds for graphs with weighted edges, since edge weights enter Δ and Perron-Frobenius still controls the spectral radius."],"forward_implications":["Rankin's n = r + 2 theorem follows immediately: if all pairwise squared distances exceeded 2, then Δ would be entrywise positive and hence irreducible, forcing the embedding dimension to be n - 1 instead of n - 2.","Kuperberg's splitting theorem follows from the block structure of Δ: the n - r irreducible blocks of spectral radius 1 correspond to mutually orthogonal subspaces L1,...,L_{n-r}, each carrying ri + 1 of the points.","Rankin's n = 2r theorem is the special case of Kuperberg's theorem where every block has size 2, forcing each pair to be antipodal and the configuration to be a regular r-crosspolytope.","The dimension formula d(G) = n - k for orthonormal graph representations is read off as m(λmax(Δ)) = k for the normalized adjacency matrix of the graph.","All four proofs share the same template: write D = 2(E - I) + 2Δ and apply Lemma 3.1, which unifies previously separate geometric arguments into one linear-algebraic scheme."],"supporting_citations":[{"why":"Supplies the theorem on vector representations of graphs that the paper reproves as its Theorem 3.1.","marker":"[14]"},{"why":"Supplies Rankin's two theorems on spherical point configurations that the paper reproves as Theorems 4.1 and 4.2.","marker":"[12]"},{"why":"Supplies Kuperberg's splitting theorem, the target generalization that the paper reproves as Theorem 5.1.","marker":"[6]"},{"why":"Supplies the Gram matrix relation B = E - D/2 and the fact that e lies in the column space of an EDM, both used in the proof of Lemma 3.1.","marker":"[5]"},{"why":"Supplies the characterization of spherical EDMs used in Theorem 2.2 to connect the sign of e^T w to the sphere radius.","marker":"[4]"},{"why":"Supplies the classical characterization of Euclidean distance matrices as negative semidefinite on e⊥, cited in Theorem 2.1.","marker":"[13]"}],"fun_headline_variants":["Distance matrix spectrum proves sphere theorems","One eigenvalue identity unifies sphere theorems","Perron-Frobenius ties sphere point theorems","Sphere theorems via spectral multiplicity trick","Distance matrix: the key to four sphere proofs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof of Kuperberg's theorem assumes that when λmax(Δ) = 1 has multiplicity n - r, the Perron-Frobenius block decomposition of Δ consists exactly of n - r irreducible blocks, each with spectral radius 1; if a block with spectral radius below 1 appears, the claimed orthogonal splitting does not follow from the argument as written.","fun_headline_variants_meta":{"raw":{"variants":["Distance matrix spectrum proves sphere theorems","One eigenvalue identity unifies sphere theorems","Perron-Frobenius ties sphere point theorems","Sphere theorems via spectral multiplicity trick","Distance matrix: the key to four sphere proofs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000301,"raw_usage":{"total_tokens":1648,"prompt_tokens":767,"completion_tokens":881,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":383,"completion_tokens_details":{"reasoning_tokens":817}},"tokens_in":383,"tokens_out":881,"duration_ms":7650,"temperature":1.0,"reasoning_tokens":817,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:32:17.354084+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take any unit spherical configuration satisfying Kuperberg's hypotheses—say n points on the unit sphere in Rr with 2 ≤ n - r ≤ r and all pairwise squared distances at least 2—form D and Δ = D/2 + I - E, and compute the Perron-Frobenius block decomposition of Δ. If any irreducible block has spectral radius strictly less than 1 while λmax(Δ) = 1 has multiplicity n - r, the proof's equation (10) is unjustified; finding even one such example would invalidate the proof as written, while checking a regular crosspolytope should produce exactly r blocks of spectral radius 1.","supporting_citations":[{"cited_title":"ˇSiˇ najov´ a","cited_arxiv_id":null,"evidence_quote":"Supplies the theorem on vector representations of graphs that the paper reproves as its Theorem 3.1."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Rankin's two theorems on spherical point configurations that the paper reproves as Theorems 4.1 and 4.2."},{"cited_title":"Kuperberg","cited_arxiv_id":null,"evidence_quote":"Supplies Kuperberg's splitting theorem, the target generalization that the paper reproves as Theorem 5.1."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Gram matrix relation B = E - D/2 and the fact that e lies in the column space of an EDM, both used in the proof of Lemma 3.1."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the characterization of spherical EDMs used in Theorem 2.2 to connect the sign of e^T w to the sphere radius."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the classical characterization of Euclidean distance matrices as negative semidefinite on e⊥, cited in Theorem 2.1."}],"review_version":1}