{"id":"b038d320-1fdc-46bc-a8a1-e551b7afa8c2","arxiv_id":"2607.22576","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Matrix-valued rational minimax approximants with a common denominator are proved to exist on dense point sets, with Kolmogorov/Ruttan optimality certificates and an equivalence to the m-d-Lawson dual conditions.","lead":"This paper proves that matrix-valued functions can be approximated as rationally as single functions, with all entries sharing one denominator and the worst error made as small as possible. It supplies conditions under which such an approximation is provably best, including when it is computed from boundary samples by an existing algorithm.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Discrete minimax problem can fail to have a solution even when m ≥ n_ij+d+2; §5's certificate rests on an unproven existence assumption.","rationale":"The paper's primary practical contribution is the discrete bridge: Theorem 5.2 connects strong duality to Ruttan's certificate, and §5.3 interprets m-d-Lawson optimality conditions as Kolmogorov dual criteria. These claims are explicitly conditional on the finite-set primal problem having a solution and on the dual denominator not vanishing on X. The paper does not prove existence for finite X, and Theorem 2.1 is inapplicable to such sets. The scalar counterexample above shows the existence assumption is not automatically guaranteed by the standing sampling condition (1.4): the infimum is 0 but is not attained. This is exactly the reader's weakest assumption, and it is genuinely load-bearing for the algorithmic claims. It does not invalidate the continuum existence theorem or Ruttan's sufficient condition, but it shows the discrete theory is incomplete and the abstract's 'theoretical basis for certifying and computing' is overstated for arbitrary admissible finite sets. The secondary issue in Lemma 3.2 (bilinear-versus-sesquilinear convention for A⊆(T(Pν))⊥) is a proof-level gap that affects the count in Theorem 3.2, but it is downstream of the main certification argument and does not change the overall conditional assessment. Thus the reader's CONDITIONAL verdict remains appropriate.","tokens_in":22672,"tokens_out":31287,"duration_ms":309570,"concrete_test":"Demonstrate the counterexample rigorously: for X={0,1,2}, F(0)=0, F(1)=1, F(2)=0, n=0, d=1, show inf_R max_{x∈X} |F(x)-R(x)| = 0 via the sequence R_c(x) = c / (1 - x/(1+c)), and show no R∈R(0,1) attains this value by the normalization argument: R(x)=c/(1+βx), so R(0)=0 forces c=0, which makes R(1)=0, whereas error 0 requires R(1)=1. If this checks out, the §5 existence assumption is not automatically satisfied under (1.4), and the discrete certification claims need restatement.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The discrete results in §5 (Theorem 5.2 and the m-d-Lawson recovery) are conditional on the finite-set problem (1.2) having a solution and on the dual optimizer's denominator satisfying \\hat q(x_j) ≠ 0 on X. Theorem 2.1 explicitly does not cover finite X, and the paper provides no substitute existence result. This assumption is not innocuous: in the scalar case s=t=1, n=0, d=1, set X={0,1,2} and F(0)=0, F(1)=1, F(2)=0. Then m=3 satisfies (1.4). For c→0+ and β=-1/(1+c), R_c(x)=c/(1+βx) has denominators 1, c/(1+c), (c-1)/(1+c), all nonzero for c>0, and R_c(0)=c→0, R_c(1)=1+c→1, R_c(2)=c(1+c)/(c-1)→0. Hence the infimum of the max error is 0. But no R∈R(0,1) attains error 0: error 0 would require R(0)=0 and R(1)=1; with q(0)≠0 this forces c=0, which makes R(1)=0, a contradiction. Thus the discrete minimax problem has no solution, even though the sampling condition holds. Consequently, the equivalence in Theorem 5.2 and the recovery arguments in §5 do not apply to this simple scalar (and hence matrix-valued) input; the paper gives no criterion for when they do. The central continuum results remain plausible, but the advertised 'theoretical basis for certifying and computing' discrete approximants is incomplete.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a theoretical foundation for rational minimax approximation of continuous complex matrix-valued functions in the Frobenius norm, with all entries sharing a common denominator. The main contributions are: (1) an existence theorem for minimax approximants when the underlying point set is dense in itself (Theorem 2.1), extending Walsh's scalar theorem; (2) primal and dual Kolmogorov-type necessary conditions for local minimizers (Theorems 3.1 and 3.2); (3) a Ruttan-type sufficient condition for global optimality (Theorem 4.1) and its consequences for continuum, boundary, and discrete approximation (Theorem 4.2); and (4) an analysis of the discrete dual problem and the m-d-Lawson algorithm, claiming that strong duality is equivalent to Ruttan's condition and that the m-d-Lawson optimality equations coincide with Kolmogorov's dual criteria (Theorem 5.2 and Section 5.3). The paper is written in a classical approximation-theory style and explicitly acknowledges some limitations, such as the fact that Theorem 2.1 does not cover finite point sets and that the discrete quotient may not be well defined on the sampling set.","tokens_in":23051,"tokens_out":15891,"duration_ms":145170,"significance":"If the central claims are correct, this is a useful contribution. The existence theorem for matrix-valued common-denominator rational approximation on perfect sets is a genuine extension of Walsh's result, and the Ruttan-type certificate (Theorem 4.1) gives a practical, checkable sufficient condition for global optimality that could support computational methods. The paper also gives an honest discussion of the continuum-to-discrete passage, which is nontrivial even in the scalar case. The discrete duality analysis is potentially valuable for justifying algorithms such as m-d-Lawson. However, the manuscript has several load-bearing technical gaps: an unproved containment in Lemma 3.2, a non-Hermitian quadratic-form matrix in Section 4.1 due to missing conjugates, and a discrete existence gap that limits the scope of the advertised algorithmic certification theory. These issues do not appear to be merely cosmetic; they affect the proofs of Theorems 3.2, 4.1, and 5.2 as stated.","major_comments":[{"comment":"The discrete part of the paper is load-bearing for the advertised algorithmic certification, but it is built on an unproven existence assumption. The paper states in §4.2 that Theorem 2.1 cannot be applied to the finite set X and defines R_X via 'arg inf' in (4.11). In §5, Theorem 5.2 and the recovery arguments require a dual optimizer with q(x_j) ≠ 0 on X, but no criterion is given for when such a pair exists. The issue is not academic: in the scalar case s=t=1, n=0, d=1, take X={0,1,2} and F(0)=0, F(1)=1, F(2)=0. Then m=3 satisfies (1.4), and the sequence R_c(x)=c/(1+x·(-1/(1+c))) has maximum error tending to 0, but no rational R∈R(0,1) attains error 0 because q(0)≠0 forces c=0, which makes R(1)=0. Thus the discrete minimax problem has no solution. Consequently, the equivalence in Theorem 5.2 and the m-d-Lawson recovery argument do not apply to this simple input. The abstract's caveat","section":"§4.2 and §5 (Theorems 5.2 and the m-d-Lawson recovery)"},{"comment":"The proof of Lemma 3.2 is incomplete at the crucial step. After defining the linear map T in (3.14), the proof says 'we obtain the desired result (3.13) by directly verifying that A ⊆ (T(Pν))⊥.' This verification is not shown, and for complex polynomial bases it is not evident. For a vector in A evaluated at x, the orthogonality to T(ξ) involves sums of the form (f_ij q - p_ij)(x) times inner products between the basis functions evaluated at x and the coefficients of ξ p_ij, together with analogous denominator terms. A direct expansion does not yield identically zero unless a specific basis and a specific conjugation convention are chosen and a nontrivial identity is proved. Since Lemma 3.2 is the sole justification for the subspace dimension bound (3.13) that feeds into Theorem 3.2's Carathéodory argument, the proof must be supplied. The same issue affects the consistency of Lemma 3.1,","section":"§3.3, Lemma 3.2"},{"comment":"The matrix H(x) defined in (4.3)–(4.6) is not Hermitian as written. In (4.4b), the (ℓ,u) entry of H_1^{(ij)}(x) is ψ_{ℓ-1}(x)ψ_{u-1}(x), and in (4.5) the entry of H_2(x) is (∥F(x)∥² - ∥ê∥)φ_{ℓ-1}(x)φ_{u-1}(x). For complex-valued basis functions, the quadratic form u(x;G,h)=∥F h - G∥² - |h|²∥ê∥ requires rank-one blocks built from ψ ψ^H and φ φ^H, not ψ ψ^T and φ φ^T. Without the conjugate on the second factor, H(x) is not Hermitian, so the condition H⪰0 in (4.7) is not well defined. The proof of Theorem 4.1 and its use in Theorem 4.2 and Theorem 5.2 all rely on this positive semidefinite matrix. This is a fixable but essential correction: the definitions must be made consistent with a fixed convention for coefficient vectors and polynomial evaluation.","section":"§4.1, Eqs. (4.2)–(4.6)"},{"comment":"The abstract claims that 'when the original minimax problem admits a solution, strong duality is equivalent to Ruttan's sufficient optimality condition.' The theorem as stated proves an equivalence between Ruttan's condition for a rational approximant and the equality d(ŵ)=∥ê∥_{∞,X} for a dual maximizer whose associated denominator is nonzero on X. This is not the same as a blanket equivalence between strong duality and Ruttan's condition. Moreover, the sufficiency direction of the proof invokes (5.18), a support-concentration statement from [40, Theorem 5.1], and uses it to assert that weights at non-extreme points vanish. Without a proof of (5.18) or a precise statement of the hypotheses under which it holds, Theorem 5.2 is conditional on an external result that is not included in the manuscript. The authors should either prove (5.18) or clearly state it as an assumption, and align the","section":"§5.2, Theorem 5.2 and Abstract"}],"minor_comments":[{"comment":"Typo: 'continuo us' should be 'continuous'.","section":"Abstract"},{"comment":"The phrase 'Ruttan’s sufficient condition (4.1)' appears to refer to (4.7), since (4.1) defines the auxiliary function u(x;G,h). Please correct the equation reference.","section":"Theorem 5.2 statement"},{"comment":"The notation 'R_X ∈ arg inf' is nonstandard when the infimum may not be attained. The paper already notes that Theorem 2.1 does not cover finite X, so the notation should be changed to something like 'inf' or the non-attainment should be explicitly acknowledged at this point.","section":"§4.2, Eq. (4.11)"},{"comment":"In the text following (5.19), the index range '0 ≤ ℓ0 ≤ n_{ij}' should be '0 ≤ ℓ0 ≤ n_{i0j0}' to match the fixed entry (i0,j0).","section":"§5.3"},{"comment":"In the proof of Lemma 3.1, the construction of G and h from the separating vector c involves a^H ψ and b^H φ; the relationship between this complex-conjugate pairing and the inner product ⟨Ê, ·⟩ in (3.3) needs to be spelled out. Even if Lemma 3.2 is repaired, this conjugation step should be made explicit for the complex case.","section":"§3.3"},{"comment":"The paper relies heavily on the authors' own preprints [37] and [40], especially for the dual formulation, the m-d-Lawson algorithm, and the support-concentration result (5.18). Since these are not yet published, the manuscript should state which results are taken from those preprints and which are new here, and ideally make the needed external results precise.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses a relevant problem and the existence result for perfect sets appears to be a solid contribution. However, the optimality and duality sections contain proof gaps that are central to the advertised claims: Lemma 3.2's subspace containment is asserted without proof and is delicate for complex bases; the H-matrix in Section 4.1 is not Hermitian as written; and the discrete existence gap illustrated by the scalar counterexample means the algorithmic certification claims are not supported in the stated generality. These are fixable in principle, but they require substantive additions rather than minor edits. I would recommend major revision and a careful re-review of the revised proofs, especially the complex-conjugation conventions throughout Sections 3 and 4."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The matrix-valued extension of Walsh, Kolmogorov, and Ruttan is real, and the continuum half of the paper is mostly sound. But the discrete half is not as complete as the abstract claims: the strong-duality/Ruttan equivalence in §5 rests on an existence assumption for finite point sets that can actually fail, with a simple scalar counterexample.\n\nWhat is new and good: Theorem 2.1 extends Walsh's existence argument to common-denominator matrix-valued approximants on sets dense in themselves, and the denominator-preserving diagonal extraction looks correct. The Kolmogorov primal/dual criteria (Theorems 3.1/3.2) and the Ruttan-type sufficient condition (Theorem 4.1) are genuine extensions, not just notation changes. Theorem 4.1's proof is clean, and the observation in §5.3 that the dual orthogonality conditions reduce to Kolmogorov's criteria under (5.14) gives a useful interpretation of the m-d-Lawson iteration.\n\nSoft spots, in proportion. Lemma 3.2 asserts the containment A ⊆ (T(Pν))⊥ with 'directly verifying' — that is a load-bearing step for the dual Kolmogorov theorem, and it is not immediately obvious for complex polynomial bases with the sesquilinear inner product. The paper needs to spell it out. More seriously, §5 assumes the finite-set minimax problem (1.2) has a solution and the dual optimizer's denominator does not vanish on X. Theorem 2.1 explicitly does not cover finite X, and no substitute existence theorem is given. The stress-test example is on point: s=t=1, n=0, d=1, X={0,1,2}, F(0)=0, F(1)=1, F(2)=0 satisfies (1.4), yet no R∈R(0,1) attains the infimum (0). The paper's Theorem 5.2 and the recovery arguments therefore do not apply to this input; the advertised 'theoretical basis for certifying and computing' discrete approximants only covers cases where the infimum is attained, and the paper gives no criterion for when that happens.\n\nWho this is for: approximation theorists and people doing multiport rational modeling or nonlinear eigenvalue problems, who will value the continuum foundation and the dual interpretation, but should be cautious about applying the discrete certificate blindly.\n\nRecommendation: deserves a serious referee and likely a major revision. The continuum results are strong enough to publish, but the discrete section needs either a finite-X existence theorem (under suitable conditions) or an explicit statement that the theory is conditional on attainment. I'd engage with it and cite the continuum results.","headline":"Strong continuum results for matrix-valued rational minimax, but the discrete certificate theory has a load-bearing existence gap.","tokens_in":23542,"tokens_out":3983,"would_cite":true,"duration_ms":35970,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["41A52","41A50","65D15","49K35","41A20","90C46"],"pacs":[],"model":"deepseek-v4-flash","headline":"For continuous matrix-valued functions, rational minimax approximants with a shared denominator exist on point sets with no isolated points, and a positive-semidefinite Ruttan-type certificate guarantees global optimality; for sampled discr","keywords":["rational minimax approximation","matrix-valued functions","common denominator","Frobenius norm","Kolmogorov criterion","Ruttan condition","strong duality","m-d-Lawson iteration"],"falsifier":"Find a finite sample X and continuous matrix-valued F where the dual maximizer w has an induced denominator q with q(x_j)=0 for some node but the error gap max_x ||F(x)-R(x)||^2 - d(w) is positive: that would directly falsify Theorem 5.2's equivalence without the denominator hypothesis. Even simpler: a finite X for which the infimum in (1.2) is not attained would falsify unlimited application of Theorem 2.1 to discrete problems.","tokens_in":22537,"feed_emoji":"🧮","tokens_out":5819,"duration_ms":56201,"temperature":0.7,"pith_summary":"This paper builds the missing theoretical floor for rational minimax approximation of matrix-valued functions whose entries share one common denominator, measured in the Frobenius norm. It proves, extending Walsh's scalar existence result, that a best approximant exists whenever the approximation set is dense in itself. It then derives necessary optimality conditions of Kolmogorov type and a sufficient Ruttan-type condition: if certain extreme error points and positive weights make a constructed Hermitian matrix positive semidefinite, the candidate is a global minimax approximant. For analytic functions on a continuum, the same certificate shows when boundary or discrete boundary-sample solutions also solve the original continuum problem. For finite node sets, the paper proves that strong duality in the dual formulation, including the practical condition that the dual denominator is nonzero at every node, is equivalent to the Ruttan certificate, and that the equations solved by the m-d-Lawson iteration are exactly the Kolmogorov dual criteria.","feed_headline":"Matrix minimax fits exist, and a certificate proves they are best","feed_subtitle":"Existence, optimality criteria, and duality-based certificates for common-denominator rational matrix approximation.","key_machinery":"The load-bearing object is the class R(s,t) of matrix-valued rational functions with a shared scalar denominator q(x) and entry numerators of prescribed degrees, with error measured by the Frobenius norm. The argument moves through three mechanisms: a Walsh-style diagonal extraction that preserves one common denominator to prove existence; the variational Kolmogorov conditions, which translate local optimality into inner-product inequalities at the extreme error points; and the Ruttan certificate matrix H = Σ ω_k H(z_k), a Hermitian block matrix built from the error at extreme points whose positive semidefiniteness forces global optimality. The discrete half of the paper identifies this cert","core_discovery":"The central claim is that the matrix-valued rational minimax problem with common denominator admits a rigorous existence and optimality theory parallel to scalar rational approximation. The main theorems assert: existence of a minimax approximant on any set dense in itself; a primal Kolmogorov criterion and a dual Kolmogorov criterion characterizing local minimizers through extreme error points; a Ruttan-type sufficient condition for global optimality in which a weighted sum of Hermitian matrices over extreme points is positive semidefinite; a continuum-to-boundary transfer showing that a Ruttan certificate obtained on the boundary or a discrete subset certifies the continuum solution; and,","pith_inferences":["I infer that the common-denominator structure lets the matrix problem be decoupled once the denominator is fixed: for a fixed q, the numerators separate entrywise, so algorithms that alternate between denominator search and entrywise least-squares solves are natural consequences of this theory.","The paper leaves uniqueness, stability under boundary sampling, and discrete-to-continuum convergence open; a testable extension is to quantify how the Ruttan certificate degrades as boundary nodes are thinned, perhaps by monitoring the smallest eigenvalue of H.","The equivalence in Theorem 5.2 suggests that if the m-d-Lawson gap fails to close on a finite sample, the cause may be a vanishing dual denominator rather than a genuinely harder instance; reparameterizing or adding a regularization term that keeps q nonzero could restore strong duality.","Since Theorem 2.1 explicitly excludes finite sets, the discrete existence question is still open; one could test whether a limiting argument from dense sets containing the sample, or a barycentric parametrization, yields existence on finite X directly."],"forward_implications":["If Theorem 2.1 holds, every continuous matrix-valued rational minimax problem on a self-dense set has an attained optimum, so numerical methods converge to a well-defined target rather than an infimum that may be missed.","If a Ruttan certificate is found for an analytic function on a Jordan domain, minimax approximants computed on the boundary or on a finite boundary sample containing the extreme points are automatically minimax on the whole domain.","If the computed dual solution in the discrete problem satisfies the nonzero-denominator condition and closes the duality gap, it is provably a global minimax approximant rather than merely a stationary point.","The orthogonality equations underlying m-d-Lawson coincide with the Kolmogorov dual criteria, so the iteration's weights and support points carry direct optimality meaning.","The duality gap can serve as a computable certificate of global optimality, replacing the impractical direct verification of the Ruttan matrix."],"fun_headline_variants":["Matrix minimax: existence and proof of best fit","Certified best matrix fits: existence and optimality","Matrix rational fits: existence plus a global optimality certificate","Proving best matrix fits: existence and Ruttan certificate","Matrix minimax decoded: existence, optimality, and algorithms"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The discrete-theory results assume that the finite-set minimax problem has a solution and that the dual optimizer's denominator is nonzero at every sampled node; the paper's existence theorem covers only point sets dense in themselves, so this assumption is unproven and the paper itself notes strong duality is not universally satisfied.","fun_headline_variants_meta":{"raw":{"variants":["Matrix minimax: existence and proof of best fit","Certified best matrix fits: existence and optimality","Matrix rational fits: existence plus a global optimality certificate","Proving best matrix fits: existence and Ruttan certificate","Matrix minimax decoded: existence, optimality, and algorithms"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000208,"raw_usage":{"total_tokens":1253,"prompt_tokens":771,"completion_tokens":482,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":515,"completion_tokens_details":{"reasoning_tokens":401}},"tokens_in":515,"tokens_out":482,"duration_ms":4961,"temperature":1.0,"reasoning_tokens":401,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T12:07:16.415092+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find a finite sample X and continuous matrix-valued F where the dual maximizer w has an induced denominator q with q(x_j)=0 for some node but the error gap max_x ||F(x)-R(x)||^2 - d(w) is positive: that would directly falsify Theorem 5.2's equivalence without the denominator hypothesis. Even simpler: a finite X for which the infimum in (1.2) is not attained would falsify unlimited application of Theorem 2.1 to discrete problems.","supporting_citations":[],"review_version":1}