{"id":"48883c20-0e0d-4197-b16b-76e0055dae4d","arxiv_id":"2607.21177","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Block-matrix Fourier multipliers admit h^{min(2,2γ−β−1)} generalized norm-resolvent convergence after a Wilson-type correction term, while the uncorrected symmetric-difference scheme converges only strongly.","lead":"Discrete (lattice) approximations of a wide class of matrix differential operators, including the bilayer graphene Hamiltonian, are shown to converge to their continuous limits with explicit error rates — provided the right discretization scheme or a correction term is used. The paper also connects three existing notions of resolvent convergence into one framework.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.10's proof of strong convergence without assumption (17) invokes the very assumption it claims to drop: it uses estimate (19), proven only under (17).","rationale":"The reader's weakest assumption, commutativity of G11 and G12, is a scope limitation rather than an internal flaw; the paper explicitly restricts to that 'supersymmetric-type' class. The more definite internal problem is Theorem 3.10: its proof uses (19), which is Lemma 3.3's estimate and is derived under (17), while the theorem is explicitly claimed to hold without (17). A concrete non-PSD symbol shows (19) can fail at hξ=1, where the correction term cancels the leading symbol. The same example does not immediately falsify (36), because the extra factor (G0±i)^{-1} contributes an O(h) there; so the concern is not that the conclusion is false, but that the manuscript's proof is incomplete and the strong-convergence claim is unsupported as written. This does not undermine Theorem 3.7 (which assumes (17)) or Proposition 3.9, so the reader's CONDITIONAL verdict remains appropriate. I found no basis for REJECT or for upgrading to ACCEPT without the proof repair.","tokens_in":22850,"tokens_out":25487,"duration_ms":225767,"concrete_test":"For d=m=1, γ=1, β=0, take G12=0 and G11(ξ)=-a(1+ξ^2)^{1/2} with a=0.919/sin(1), so Assumptions 1 hold but (17) fails. For h=2^{-N} (N=1,...,12), compute sup_{θ∈[-3π/2,3π/2]} ∥((G_h(θ/h)±i)^{-1}-(G_h^+(θ/h)±i)^{-1})(G0(θ/h)±i)^{-1}∥. Also record ∥(G_h^+(θ/h)±i)^{-1}∥ at θ=1 to confirm (19) fails. If the supremum is not O(h), Theorem 3.10 is false; if it is O(h), the theorem may be true but its proof must be repaired.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3 introduces Assumption 2: whenever dealing with G_h or G_h^+, one assumes (17), G11≥0. Lemma 3.3 then proves (19), the decay bound for (G_h^+(ξ)^2+1)^{-1}. Theorem 3.10 is announced as valid 'even when the assumption (17) is dropped,' but its proof of (36) uses (19) to obtain (40), ∥D(ξ)∥≤C(1+|ξ|^{2γ})^{-1/2}. Without (17), (19) is false in general. Concrete counter-symbol: d=m=1, G12=0, G11(ξ)=-a(1+ξ^2)^{1/2} with a≈1.093 (so γ=1, β=0, Assumptions 1 hold, but G11 is not PSD). At hξ=1, G11,h≈-0.918/h and f_h≈0.919/h, so G_h^+ has an eigenvalue near zero and ∥D∥=O(1), while (19) would give O(h). Thus the proof of (36) is circular/invalid as written. The final bound (36) may still be true because of the extra right factor (G0±i)^{-1}, but the argument does not establish it; the theorem and the surrounding claim need a direct proof, or assumption (17) must be reinstated.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies continuum limits of discretized matrix-valued Fourier multipliers with block symbols G0 = [[G11, G12], [G12*, -G11]]. Under assumptions that G11 is self-adjoint, G12 is normal and commutes with G11, an elliptic lower bound holds, and derivatives grow at most polynomially, it proves norm-resolvent convergence rates for two discretizations: one based on the square-root of the standard second difference (tilde G_h) and one based on the symmetric difference with a correction term (G_h^+). For the symmetric difference without correction it proves, in Proposition 3.9, that generalized norm resolvent convergence fails, while Theorem 3.10 claims generalized strong resolvent convergence even when the additional positivity assumption (17) is dropped. Section 4 embeds these results in the frameworks of generalized Weidmann convergence, QUE-convergence, and Barker convergence.","tokens_in":23145,"tokens_out":12441,"duration_ms":98763,"significance":"If the main results hold, this is a substantial extension of the work of Cornean–Garde–Jensen: it covers a wide class of block operator matrices including Dirac and bilayer graphene symbols, gives explicit rates, and clarifies when a correction term is necessary. The proof of Theorem 3.7, in particular Proposition 3.4 and the aliasing reduction to |j|≤1, is coherent and the rates agree with the earlier scalar and Dirac results. Proposition 3.9 is a clean demonstration that the correction term is genuinely needed for norm convergence. The connections to QUE- and Barker-type convergence are useful exposition. The main caveat is that the proof of Theorem 3.10 uses an estimate that is only proved under the positivity assumption (17), although the theorem is explicitly advertised as dropping that assumption; this is a load-bearing gap in the paper as written.","major_comments":[{"comment":"The proof obtains (40), the bound for D(ξ)=(G_h^+(ξ)±i)^{-1}, from estimate (19). But (19) is proved in Lemma 3.3 only under Assumption 2, which includes (17) for G_h and G_h^+. The theorem is announced as valid 'even when the assumption (17) is dropped', so the proof is circular. The failure of (19) without (17) is concrete: take d=m=1, G12=0, G11(ξ)=-a(1+ξ^2)^{1/2} with a≈1.093. Assumptions 1 hold with γ=1, β=0, but G11 is not pointwise non-negative. At hξ=1, G11,h≈-0.918/h and f_h≈0.919/h, so G_h^+ has an eigenvalue near zero and ∥D(ξ)∥=O(1), while (19) would give O(h). Thus (40) is false without (17), and the proof of (36) is invalid as written. The final inequality (36) may still be true because of the extra right factor (G0±i)^{-1}, but that requires a different argument.","section":"Theorem 3.10, proof of (36)"},{"comment":"The proof of the strong resolvent bound (37) inherits the same problem. For |j|=1 it bounds S_h(ξ+2πj/h) by '(C+Ch^γ)Ch^γ', using periodicity of G_h^+ combined with (40). Since (40) is not available without (17), the estimate ∥S_h∥≤Ch^γ in the aliasing region is unsupported. Consequently the strong convergence statement (37) and its consequence (38) are not established by the argument given. The final density step is itself fine, but it depends on (37).","section":"Theorem 3.10, proof of (37)"}],"minor_comments":[{"comment":"The definition f_h(ξ) = ( h ∑_{j=1}^m 4/h^2 sin^2(hξ_j/2) )^γ is correct for the symbol of (-hΔ_h)^γ but initially looks surprising because of the extra factor h. A one-line explanation that h times 4/h^2 is 4/h and that the small-ξ asymptotics is h^γ|ξ|^{2γ} would help readability.","section":"Eq. (16) and surrounding text"},{"comment":"The sentence 'F_h^* f_h F_h = -i d_h' and the parenthetical remark about the square for the second variant are terse. It would be clearer to state explicitly that for f_h(ξ)=sin(hξ)/h the corresponding operator is -i times the symmetric difference, and for f_h(ξ)=2/h |sin(hξ/2)| its square is -Δ_h.","section":"Introduction"},{"comment":"The lower bound in (34) is valid because A and D are invertible, but the reader must supply the easy identity ∥B∥=∥A^{-1}(ABD)D^{-1}∥≤∥A^{-1}∥∥ABD∥∥D^{-1}∥. A short comment would avoid confusion.","section":"Proposition 3.9"},{"comment":"In the two examples after Remark 4.12, the notation (χ_n)_j = δ_{j-1}^n is ambiguous; writing χ_n = δ_{j-1,n} or defining it explicitly would be clearer.","section":"Section 4.2"}],"recommendation":"major_revision","confidential_remarks":"The paper is within scope for math-ph and the central Theorem 3.7 appears sound and genuinely useful. The gap in Theorem 3.10 is localized but load-bearing for the advertised claim that strong convergence holds without (17). I would invite a revision: either provide a direct proof of (36) that does not use (19), or reinstate (17) and remove the 'even when (17) is dropped' claim. In the latter case the paper's main results still stand, but the advertised scope should be adjusted accordingly."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the center holds, the tail doesn't. Theorem 3.7 (norm-resolvent convergence for the corrected operator and for the square-root discretization) is a genuine extension of Cornean–Garde–Jensen to 2×2 block matrices whose off-diagonal blocks are normal and commute with the diagonal block. The proof route is coherent: the diagonalization of G0^2 is correct, the Taylor estimates in Prop. 3.4 check out, and the aliasing sum reduces to |j|≤1 as claimed. Prop. 3.9 is a clean proof that the uncorrected symmetric-difference scheme fails in norm, so the correction is genuinely necessary. The bilayer graphene example and the Barker-convergence equivalence (Prop. 4.10) are new, and the Barker section is a useful clarification of the Weidmann/QUE landscape.\n\nThe soft spot is Theorem 3.10. The theorem says the uncorrected H_h still converges strongly even when (17) is dropped, but the proof uses estimate (19), which Lemma 3.3 proves only under (17). This is not a cosmetic detail. Take m=d=1, G12=0, G11=−a(1+ξ^2)^{1/2} with γ=1, β=0, and choose a so that at hξ=1 the term G11,h+f_h nearly vanishes. Then G_h^+ has an eigenvalue near zero and ∥D∥=O(1), while (19) would give O(h). The proof of (36) is invalid as written. The final bound may still be true because of the extra factor (G0±i)^{-1}, but the argument does not establish it. Either (17) must be reinstated or a direct proof is needed.\n\nSecond, smaller: Theorem 3.7 defers part of the heavy lifting to [6] with an 'obvious' matrix adaptation. In this genre that is often acceptable, but the referee should ask for the full matrix-valued version of [6, Lemma 3.3] to be written out, since the rest of the proof is otherwise careful.\n\nThe scope limitation (Assumptions 1(ii)–(iii)) is real but not hidden; the authors position the result as a supersymmetric-type class. The convergence rate is equivalent to [6] by their own Remark 3.6, so the novelty is in generality rather than exponents.\n\nVerdict: send it to a serious referee. The paper deserves referee time; with Theorem 3.10 repaired or trimmed, it should be publishable. I would cite Theorem 3.7 and the Barker equivalence.","headline":"Main result is solid and a genuine extension; Theorem 3.10 has a real gap—its proof uses the very assumption it claims to drop.","tokens_in":23702,"tokens_out":4574,"would_cite":true,"duration_ms":37606,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["47A58","47B25","81Q10"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves uniform norm resolvent convergence, with explicit rates, for discrete lattice approximations to a wide class of matrix-valued Fourier multipliers, including Dirac and bilayer graphene Hamiltonians.","keywords":["norm resolvent convergence","Fourier multipliers","block operator matrices","Dirac operator","bilayer graphene","fermion doubling","correction term","lattice approximation"],"falsifier":"Compute the norm in (27) for the bilayer graphene symbol (γ=2, β=1) at h = 2^{-k}, k=1,...,8, using the sinc-function identification operators described in Example 1; Theorem 3.7 predicts a decay exponent of 2. If the fitted exponent is clearly below 2, the central bound is false.","tokens_in":22690,"feed_emoji":"⚛️","tokens_out":16519,"duration_ms":134005,"temperature":0.7,"pith_summary":"The paper establishes uniform norm resolvent convergence for a wide class of matrix-valued Fourier multipliers when approximated on a lattice. The operators are self-adjoint block matrices of the form [[G11, G12], [G12*, −G11]]; the class includes Dirac operators in dimensions 1–3 and the effective Hamiltonian of bilayer graphene. Two discretization schemes are studied: a nonlocal one derived from the square root of the standard second difference, which converges in norm without any correction when the symbol is even in each momentum variable, and the symmetric-difference scheme, which converges in norm only after adding a correction term based on (−hΔ_h)^γ; without it, convergence fails in norm and holds only strongly. For symbols growing like |ξ|^(2γ) with derivatives growing at most like |ξ|^β, the error is of order h^{min{2, 2γ−max{β,0}−1}}, so the rates are explicit — O(h) for Dirac operators and O(h^2) for bilayer graphene.","feed_headline":"Discretized Dirac and graphene models converge in norm when corrected","feed_subtitle":"Explicit rates: O(h) for Dirac, O(h^2) for bilayer graphene; without the correction, norm convergence fails.","key_machinery":"The argument turns on the block-diagonal form of G0^2, which follows from assuming the off-diagonal block G12 is normal and commutes with G11. This yields the resolvent bound (G0^2+1)^{-1} ≤ C(1+|ξ|^{2γ})^{-1}, and Taylor expansion controls the pointwise difference between each discrete symbol and the continuous one. For the symmetric-difference scheme, a correction term f_h(ξ) = (h∑ 4h^{-2} sin^2(hξ_j/2))^γ restores the lower bound at the Brillouin-zone boundary; without it, the pointwise resolvent difference stays O(1) there. The identification operators J_h, K_h built from biorthogonal generating functions turn the pointwise estimates into operator-norm bounds, with the neighboring-zone t","core_discovery":"The central discovery is that, when the off-diagonal block G12 of the symbol is normal and commutes with the diagonal block G11, the square of the full matrix symbol becomes block-diagonal, yielding a uniform pointwise resolvent bound with decay |ξ|^(−2γ). The paper proves that two natural discrete approximations — a nonlocal square-root-of-Laplacian scheme and a symmetric-difference scheme with a specific correction term — converge in norm to the continuum resolvent with error O(h^{min{2,2γ−max{β,0}−1}}). It also proves that the uncorrected symmetric-difference scheme does not converge in norm, with the resolvent difference remaining O(1) at the boundary of the Brillouin zone (the signature","pith_inferences":["The proof suggests a general design principle: any discretization whose symbol squares to a block-diagonal matrix with the correct lower bound will avoid fermion doubling; testing this on other lattice geometries (triangular, honeycomb) would be a natural next step.","The commutativity condition is restrictive but is satisfied by all supersymmetric-type symbols; the methods could likely be adapted to non-commuting blocks using a matrix-valued lower bound, at the cost of a weaker convergence rate.","The correction term's explicit form is flexible — only its abstract growth properties matter — so the proof should cover physically motivated corrections (e.g., Wilson fermions) as long as they satisfy the same symbol estimates.","The strong resolvent convergence of the uncorrected operator suggests that some spectral information (e.g., absolutely continuous spectrum) still converges even without a correction; quantifying exactly what is lost in norm versus retained strongly could refine practical guidance for lattice simulations."],"forward_implications":["For Dirac operators in dimensions one, two, and three, the corrected symmetric-difference discretization converges in norm at rate O(h); for the bilayer graphene Hamiltonian, the rate is O(h^2).","The uncorrected symmetric-difference discretization never converges in norm for this class, so any numerical scheme based on it must include a correction to obtain spectral approximation guarantees.","The convergence implies Hausdorff convergence of spectra and essential spectra, and lower semicontinuity of discrete eigenvalues for perturbed operators, with the same rate for isolated eigenvalues.","The nonlocal square-root-of-Laplacian discretization converges without a correction term whenever the symbol is even in each momentum variable, offering a doubling-free alternative for such symbols."],"fun_headline_variants":["Corrected discretizations converge in norm for Dirac and bilayer graphene","Discretized Dirac operators fail norm convergence without correction","Explicit O(h) rates for corrected discretized Dirac and graphene","Norm convergence of discretized matrix multipliers requires correction","Bilayer graphene discretization: correction ensures O(h^2) norm convergence"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof relies essentially on the assumption that the off-diagonal block G12 of the matrix symbol is normal and commutes with the diagonal block G11, so that the square of the full matrix G0 is block-diagonal; if that commutation fails, the lower-bound estimate on the resolvent that drives the convergence rates no longer holds.","fun_headline_variants_meta":{"raw":{"variants":["Corrected discretizations converge in norm for Dirac and bilayer graphene","Discretized Dirac operators fail norm convergence without correction","Explicit O(h) rates for corrected discretized Dirac and graphene","Norm convergence of discretized matrix multipliers requires correction","Bilayer graphene discretization: correction ensures O(h^2) norm convergence"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000286,"raw_usage":{"total_tokens":1468,"prompt_tokens":643,"completion_tokens":825,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":387,"completion_tokens_details":{"reasoning_tokens":753}},"tokens_in":387,"tokens_out":825,"duration_ms":7528,"temperature":1.0,"reasoning_tokens":753,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T08:15:49.974654+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the norm in (27) for the bilayer graphene symbol (γ=2, β=1) at h = 2^{-k}, k=1,...,8, using the sinc-function identification operators described in Example 1; Theorem 3.7 predicts a decay exponent of 2. If the fitted exponent is clearly below 2, the central bound is false.","supporting_citations":[],"review_version":1}