{"id":"4e6ccd9f-fee9-4969-9d34-37159c98a09c","arxiv_id":"2606.13965","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Chebyshev rational functions with prescribed poles are shown to be explicit multipoint Padé approximants to 1/sqrt(x^2-1), with recurrences, convergence proofs, and noise-breakdown numerics.","lead":"Multipoint Padé approximants are rational functions that interpolate a function and its derivative at several points, useful for analytic continuation in physics. This paper shows that Chebyshev rational functions give explicit such approximants for 1/sqrt(x^2-1), with recurrences, convergence proofs, and numerical evidence that noise breaks them like ordinary Padé approximants.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 6.3's convergence proof for the n-th roots of unity node set is invalid as written: the factors (w-c_{n,k})/(1-c_{n,k}w) are not Blaschke factors for complex c, so the product estimate and uniform lower bound do not follow.","rationale":"The reader's weakest assumption pointed to the missing branch convention and to the inadequate summability argument in Theorem 6.3. I agree partially: the branch issue is real but not fatal for Theorem 5.2, because the interpolation can be proved from the algebraic identity (23), and the rational functions are branch-invariant under z→1/z. The more serious issue is Theorem 6.3, whose proof uses an invalid individual-factor estimate for complex c. This does not by itself disprove the convergence theorem, but it leaves the triangular-node convergence claim without a rigorous argument. Since the main multipoint-Padé identification remains credible and the convergence gap is fixable, the reader's CONDITIONAL verdict is appropriate; my read does not move it, hence UNCHANGED.","tokens_in":16030,"tokens_out":41107,"duration_ms":393538,"concrete_test":"Take n=8 (or 16) roots of unity a_{n,k}, compute the inner-root c_{n,k} of z^2-2a_{n,k}z+1=0, fix w=0.99 e^{0.1i} in the compact set |w|≤0.99, and compute m = min_k (1-|(w-c_{n,k})/(1-c_{n,k}w)|)/(1-|c_{n,k}|). If m<0, the uniform lower bound in the proof of Theorem 6.3 is false for the actual node set, so the proof as written collapses. If m≥0 for all k and all tested w, then the claimed estimate may be repairable; a further check is to compute the [n-1/n] approximants for n=8,16,32,64 and measure sup_{|x|=2}|R_n(x)-1/sqrt(x^2-1)| to see whether the theorem's convergence actually holds.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The core multipoint-Padé identification (Thm 5.2) is robust: identity (23), T_n^2+(1-x^2)U_{n-1}^2=1, gives an algebraic proof of the double-node interpolation independent of the square-root branch. The proof's statement that 'x=a_i implies z=c_i' is a branch-convention slip (it holds only for the inner Joukowski root), not a fatal flaw. The load-bearing gap is in Theorem 6.3. After setting w=1/z∈D, the proof claims f_n(w)=∏ b_{n,k}(w) with b_{n,k}(w)=(w-c_{n,k})/(1-c_{n,k}w), then uses |f_n(w)|≤exp(-∑(1-|b_{n,k}(w)|)) and 1-|b_{n,k}(w)|≥C(1-|c_{n,k}|). For complex c_{n,k}, these individual factors are not Blaschke factors: |b_{n,k}(w)| can exceed 1 when Im w and Im c have the same sign and both are close to the unit circle, so the inequality fails. The product becomes a Blaschke product only after pairing conjugate c's, which requires denominators 1-\\bar c w and a separate uniform estimate. The paper neither proves that estimate nor carefully establishes ∑(1-|c_{n,k}|)→∞ for roots of unity; the 'fill in the unit circle' sentence is a sketch, not a proof. Thus the advertised locally uniform convergence for the triangular node set is unsupported as written, weakening the 'explicit convergent family' component of the central claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies rational Chebyshev functions built from finite Blaschke products with prescribed poles outside [-1,1]. It derives three-term recurrences (Theorems 3.1, 3.2) and a Thiele-type continued fraction (Corollary 3.3), extends the construction to complex nodes (Section 4), and proves that the ratio U_{n-1}/T_n is a multipoint Padé approximant of type [n-1/n] to phi(x)=1/sqrt(x^2-1) at double nodes (Theorem 5.2). It also gives determinant formulas for general multipoint Padé approximants (Theorem 5.3), proves locally uniform convergence for real nodes satisfying sum(1-|c_k|)=infinity (Theorem 6.1) and for the triangular node set of n-th roots of unity (Theorem 6.3), and presents numerical experiments on noise-induced breakdown of multipoint Padé approximants (Section 7).","tokens_in":16440,"tokens_out":25939,"duration_ms":231764,"significance":"If all claims are correct, the paper provides one of the few explicit, convergent families of multipoint Padé approximants for a function with a branch cut, together with computable recurrences and a continued fraction. The identity [T_n]^2+(1-x^2)[U_{n-1}]^2=1 (Prop. 4.3) is particularly clean and is the algebraic backbone of the interpolation result. The convergence theorem for the real-node case (Thm 6.1) follows from standard Blaschke-product facts and is a nice extension of the classical Chebyshev-polynomial convergence. The numerical study of noise is qualitative but illustrates a plausible extension of the Costin–Dunne–Meynig phenomenon. However, as detailed below, the proof of Theorem 6.3 has a gap, the branch convention for complex nodes is not stated, and there are indexing and sign errors in auxiliary statements. With these repaired, the paper would be a solid contribution to explicit multipoint Padé approximation.","major_comments":[{"comment":"The proof of Theorem 6.3 is not valid as written. The product f_n(w) = ∏_{k=1}^n (w-c_{n,k})/(1-c_{n,k}w) is claimed to be a finite Blaschke product because the set {c_{n,k}} contains conjugate pairs. While the full product is indeed Blaschke (denominators can be rearranged to 1-\\bar c w when the set is conjugation-invariant), the individual factors are not Blaschke factors for complex c: |(w-c)/(1-cw)| can exceed 1 inside D. Consequently the estimates |f_n(w)| ≤ exp(-∑(1-|b_{n,k}(w)|)) and 1-|b_{n,k}(w)| ≥ C(1-|c_{n,k}|) are unjustified. Moreover, the assertion that ∑(1-|c_{n,k}|)→∞ for the n-th roots of unity is only sketched via the phrase “fill in the unit circle”; this requires a proof. The theorem may be true, but the presented argument does not establish it. Please supply a correct proof, e.g., by applying the standard Blaschke-product estimate to the paired conjugate factors and","section":"Section 6, Theorem 6.3"},{"comment":"The branch of the square root is not specified for complex nodes, and the proof of Theorem 5.2 contains a branch-convention slip. In Section 2, z(x) is defined as the unique Joukowski root with |z|>1. Then for x=a_i one has z(a_i)=1/c_i, not z(a_i)=c_i. The proof states “x=a_i implies z=c_i,” which is incorrect under the stated convention. The interpolation claim of Theorem 5.2 is likely true and can be obtained from Prop. 4.3 and the partial fraction expansions (24)–(27), but the proof as written is not rigorous. Please state explicitly that c_k is chosen with |c_k|<1, i.e., the inner Joukowski root, and give a correct derivation of the interpolation conditions, or use the algebraic identity (23).","section":"Sections 2, 4, and 5, Theorem 5.2"},{"comment":"The initial conditions for the recurrence (14) are inconsistent. From the definition U_n(cost)=sinθ_{n+1}(t)/sint, one obtains U_0(x)=sinδ_1(t)/sint = -sqrt(a_1^2-1)/(x-a_1), not U_0=0. What the remark calls U_1 is in fact U_0. This indexing error propagates to the initialization of the recurrence and potentially to the continued fraction (15). Please correct the initial values and verify that the subsequent formulas for U_n are indexed consistently.","section":"Section 3, Remark after Theorem 3.2"},{"comment":"The determinant formula in Theorem 5.3 is false as stated. Expanding the displayed (n+1)x(n+1) determinant along the last row gives detM - ∑ detM_i/(x-a_i) (with M_i defined as in the proof after eq. (43)), not detM + ∑ detM_i/(x-a_i). For n=1 the theorem would assert P_1(x)/ω_1(x) = φ'(a1) - φ(a1)/(x-a1), which does not equal T_1(x)=(1-a1 x)/(x-a1). The sign error originates in the linear system (42): the right-hand side should have a minus sign. This theorem needs to be corrected or explicitly repairable; it is a standalone result but is advertised as part of the paper's contributions.","section":"Theorem 5.3, eq. (45)"}],"minor_comments":[{"comment":"The abstract contains a typo: “RA TIONAL” should be “RATIONAL”.","section":"Abstract"},{"comment":"In the first paragraph, “they they showed” is a duplicated word.","section":"Section 3"},{"comment":"The proof states z-z^{-1} = -2√(x^2-1), but with the convention in Section 2, z-z^{-1} = 2√(x^2-1). The squared identity is unaffected, but the sign should be corrected for consistency.","section":"Proposition 4.3"},{"comment":"The phrase “standard fact about Blaschke products” is terse. Since the argument is in the exterior domain, specify that one applies the Blaschke theorem in the variable w=1/z and then transfers the conclusion back to z.","section":"Theorem 6.1"},{"comment":"For even n, the n-th roots of unity include ±1, which lie in [-1,1] and are excluded by the standing assumption. The remark about disregarding ±1 should be made precise in the triangular setting, where the number of effective nodes then depends on n.","section":"Theorem 6.3"},{"comment":"The noise experiments are described qualitatively. While the paper makes clear this is numerical evidence, adding a brief description of how the threshold n_c is extracted from the pole-zero plots would improve reproducibility.","section":"Section 7"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is short and contains a genuinely useful explicit family of multipoint Padé approximants. The main construction (Theorems 3.1, 3.2, 5.2) appears sound in substance, but the current write-up has several issues that block acceptance: the proof of Theorem 6.3 is not rigorous, the branch convention for complex nodes is not fixed, the indexing of U_n is off in a remark, and Theorem 5.3 contains a false sign. These are eminently fixable, but they require a careful revision. I recommend major revision rather than rejection, because the central identification and the real-node convergence theorem are valuable and likely correct. The paper's scope fits math.CA well."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Core take: the main interpolation theorem is right and new, and the recurrences are useful. The convergence theorem for triangular node sets is not proved as written, and the noise section is only numerical; those are repairable but need work.\n\nThe genuinely new content is the identification of Chebyshev rational functions as multipoint Padé approximants with double nodes (Thm 5.2), the three-term recurrences (Thms 3.1/3.2), and the continued fraction (Cor 3.3). The identity T_n^2+(1-x^2)U_{n-1}^2=1 (Prop 4.3) gives a branch-free algebraic proof of the double-node interpolation, which is clean and convincing. The determinant formula (Thm 5.3) is a useful representation; its proof has a sign slip in the cofactor expansion around eq. (45) — missing the standard (-1)^{i+j} — but the determinant matches the stated coefficients, so it's cosmetic.\n\nThe soft spots are structural, not fatal. Section 4 never states which root of sqrt(a_k^2-1) is chosen for complex a_k; the real-node case is unambiguous, but the complex construction needs a convention ensuring |c_k|<1. Theorem 6.1 (Newtonian case) is fine, but Theorem 6.3 is not. The proof claims f_n is a finite Blaschke product after pairing conjugates, yet the factors (w-c)/(1-cw) are not Blaschke for complex c — |·| can exceed 1 inside the disk. To make the argument work you need to pair c with \\bar c before writing the Blaschke product, and then prove uniform estimates on the paired factors; the paper does neither. The summability statement for the c_{n,k} coming from n-th roots of unity is also asserted with a one-line sketch. So the advertised locally uniform convergence for triangular nodes is currently unsupported.\n\nThe noise section is illustrative: no code, no seeds, no uncertainties on the fitted slopes. The observation that the breakdown order grows like log_{10}(1/epsilon) and that the slope depends on node distribution is plausible and consistent with [9], but it's evidence, not a theorem.\n\nBottom line: the central multipoint Padé identification is correct, the recurrences are new, and the paper is genuinely useful to people working on analytic continuation with multiple interpolation points. But it needs a revision to fix the branch convention, the sign slip, and to either give a real proof for Thm 6.3 or weaken it to a conjecture. I'd send it to referees; the core is solid enough to justify their time.","headline":"Core multipoint Padé result is correct and new; Thm 6.3's proof is a real gap, and the noise section is numerical only — worth refereeing after fixes.","tokens_in":16973,"tokens_out":3705,"would_cite":false,"duration_ms":32372,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["30E05","33C47","42C05","30B70","33F05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Chebyshev rational functions provide explicit multipoint Padé approximants to 1/√(x²−1), interpolating both the function and its derivative at each prescribed node.","keywords":["multipoint Padé approximants","Chebyshev rational functions","Blaschke products","continued fractions","interpolation","noise","Froissart doublets","analytic continuation"],"falsifier":"For the triangular node set a_{n,k}=e^{2πik/n}, compute c_{n,k} using the branch with |c_{n,k}|<1 and evaluate ∑_{k=1}^n (1−|c_{n,k}|); if this sum does not tend to infinity as n grows, then the proof of Theorem 6.3 cannot hold and the claimed convergence for the roots-of-unity scheme collapses.","tokens_in":15848,"feed_emoji":"📐","tokens_out":11599,"duration_ms":107951,"temperature":0.7,"pith_summary":"The paper shows that the Chebyshev rational functions—rational analogues of Chebyshev polynomials built from finite Blaschke products—give explicit multipoint Padé approximants to the function φ(x)=1/√(x²−1), which has a branch cut on [−1,1]. For distinct nodes a_k outside the cut, the ratio U_{n−1}/T_n matches both φ and its derivative at every a_k, which is exactly the condition for a type [n−1/n] multipoint Padé approximant at double nodes. The paper proves three-term recurrence relations and an R_II-type continued fraction for these functions, and establishes locally uniform convergence to φ on the complement of the cut under a divergence condition on the Blaschke parameters. It also gives numerical evidence that adding small random noise to the interpolation data triggers a breakdown with spurious poles and zeros, and that these spurious pairs accumulate near the interpolation nodes rather than on the natural boundary.","feed_headline":"Chebyshev rationals give explicit multipoint Padé approximants","feed_subtitle":"A rational ratio matches 1/√(x²−1) and its derivative at every node, with recurrences and noise breakdown.","key_machinery":"The key object is the finite Blaschke product f_n(z)=∏_{k=1}^n (z−c_k)/(1−c_k z), where the c_k are related to the interpolation nodes by the Joukowski map x=½(z+1/z). The rational functions T_n and U_n are defined through f_n: T_n=½(f_n+1/f_n), and U_n=(f_{n+1}−1/f_{n+1})/(z−z^{−1}). This machinery carries the argument because the ratio U_{n−1}/T_n equals φ(x)·(1−f_n²)/(1+f_n²); since f_n(c_i)=0, the ratio matches φ and φ′ at each a_i. The same identity turns convergence into the standard Blaschke-product problem of whether f_n→0 in the unit disk, which is governed by the divergence of ∑(1−|c_k|).","core_discovery":"The central claim is Theorem 5.2: for the Chebyshev rational functions constructed from a finite Blaschke product with zeros at c_k = a_k − √(a_k²−1), the ratio U_{n−1}/T_n interpolates φ(x)=1/√(x²−1) and its derivative at each a_k. Equivalently, it is a multipoint Padé approximant of type [n−1/n] at the double nodes {a_k, a_k}. The proof uses the identity (U_{n−1}/T_n)(x) = φ(x)·(1−f_n(z)²)/(1+f_n(z)²), where z is the inverse Joukowski variable; at x=a_k, z=c_k and f_n vanishes, forcing the ratio to φ(a_k), with a short calculation giving the derivative match. For real a_k with ∑(1−|c_k|)=∞, the paper proves locally uniform convergence to φ on C∖[−1,1] and a convergent continued fraction ex","pith_inferences":["If convergence extends to complex nodes under a suitable branch choice—which the paper does not specify—the same rational family could serve as a practical tool for analytic continuation from scattered finite data, particularly in settings where only a finite number of function values are known.","The observed dependence of the breakdown order's logarithmic slope on node distribution suggests an optimization problem: arranging interpolation nodes to maximize the noise threshold; testing whether symmetric or circular layouts are optimal is a direct extension of the numerics.","The explicit identity T_n²+(1−x²)U_{n−1}²=1 could be used to derive rigorous a posteriori error bounds in the presence of noise, converting the numerical evidence into a provable statement about where the approximant is reliable.","The migration of spurious poles and zeros toward the interpolation nodes suggests a noise-detection heuristic: clusters of nearby poles and zeros in a computed multipoint Padé approximant may flag corrupted data points."],"forward_implications":["The functions U_{n−1}/T_n provide an explicit, computable family of multipoint Padé approximants to 1/√(x²−1) for any choice of distinct nodes outside [−1,1].","Under the condition ∑(1−|c_k|)=∞, the associated R_II-type continued fractions converge locally uniformly, giving a continued-fraction representation of 1/√(x²−1).","The determinant formula in Theorem 5.3 lets one construct double-node multipoint Padé approximants for general analytic functions from divided-difference data.","The numerical noise study shows a breakdown phenomenon quantitatively similar to the single-point Padé case, with the new feature that spurious poles and zeros migrate to the interpolation nodes as noise grows.","Symmetrically arranged interpolation nodes appear less sensitive to noise than asymmetric arrangements, suggesting the geometry of the node set controls the stability threshold."],"fun_headline_variants":["Chebyshev rationals yield multipoint Padé with node derivative match","Multipoint Padé via Chebyshev rationals: exact interpolation at nodes","Rational Chebyshev functions give multipoint Padé and noise effects","Chebyshev rationals give multipoint Padé with recurrences and noise"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"For complex nodes, the construction needs a branch of √(a_k²−1) such that every c_k lies inside the unit disk and the Blaschke divergence condition holds; the paper does not specify this branch, and its roots-of-unity convergence argument relies on a summability assertion that is not demonstrated.","fun_headline_variants_meta":{"raw":{"variants":["Chebyshev rationals yield multipoint Padé with node derivative match","Multipoint Padé via Chebyshev rationals: exact interpolation at nodes","Rational Chebyshev functions give multipoint Padé and noise effects","Chebyshev rationals give multipoint Padé with recurrences and noise"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000926,"raw_usage":{"total_tokens":3798,"prompt_tokens":733,"completion_tokens":3065,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":477,"completion_tokens_details":{"reasoning_tokens":2984}},"tokens_in":477,"tokens_out":3065,"duration_ms":23069,"temperature":1.0,"reasoning_tokens":2984,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T11:33:47.978927+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For the triangular node set a_{n,k}=e^{2πik/n}, compute c_{n,k} using the branch with |c_{n,k}|<1 and evaluate ∑_{k=1}^n (1−|c_{n,k}|); if this sum does not tend to infinity as n grows, then the proof of Theorem 6.3 cannot hold and the claimed convergence for the roots-of-unity scheme collapses.","supporting_citations":[],"review_version":1}