{"id":"2aed61c0-5d6a-4d01-a785-5414191128c1","arxiv_id":"2504.14487","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Pfaffian point processes with the finite-rank commutator property have Gaussian counting fluctuations, and the Sine_1 and Sine_4 processes satisfy this property.","lead":"This paper proves a central limit theorem for counting statistics of Pfaffian point processes that satisfy a new finite-rank commutator property, and applies it to the Sine_1 and Sine_4 random matrix processes. The result gives Gaussian fluctuations for step-function statistics, a regime not covered by earlier smooth-function CLTs.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 2.2's cumulant formula as printed uses the antisymmetrized kernel K=ZK and is inconsistent: for Sine4 counts it gives O(L^2) variance rather than the log L of §3.1, so the proof of Theorem 1.2 does not work without changing the kernel convention.","rationale":"The reader's weakest assumption isolates the same primary defect, and I agree it is load-bearing. Proposition 2.2 is the engine of the paper: Theorem 1.2 derives from it through the V_k estimates, and Section 3 verifies conditions only after those estimates. A wrong kernel in the cumulant formula does not change a constant; it changes the growth order of the variance from log L to L^2, so the normalization in Theorem 1.2 could not yield a Gaussian limit. The error is correctable—replace K by the original 2x2 kernel in Proposition 2.2 and Lemma 2.4, and Lemma 2.3 becomes unnecessary—but as printed the central proof is not valid. I also note the one-sentence deferral of Assumption (A)(v) in the proof of Theorem 1.3 ('an argument similar to that in Lemmas 3.2 verifies...'); this is a secondary gap. Both support a CONDITIONAL verdict: the idea is plausible, but the manuscript must be revised before the statements can be relied upon. Hence no change to the reader's verdict.","tokens_in":23759,"tokens_out":33038,"duration_ms":252225,"concrete_test":"Evaluate the n = 2 cumulant from Proposition 2.2 for the Sine4 process on I_L with the trace taken over K = ZK. If the result is 1/2 ∫_{I_L} Tr(K(x,x)) dx + 1/2 ∫∫_{I_L^2} ||K(x,y)||_F^2 dxdy = L^2/8 + O(L), while the variance from (1.3) is (1/2π^2) log L + O(1), the printed kernel convention is wrong. A sharper check: run the cycle decomposition for k = 1; with K = ZK the formula yields 0 for ∫ρ_1, whereas with the original 2x2 kernel it gives λ∫a(x,x)dx, matching (1.2).","verdict_should_be":"UNCHANGED","load_bearing_attack":"Proposition 2.2 as printed places the antisymmetrized kernel K = ZK of (1.1) inside the trace Tr(K(x1,x2)...K(xk,x1)). Read literally, this is false. For the Sine4 counting statistic on I_L = (-L,L), the k = 1 term is 1/2 ∫_{I_L} Tr(K(x,x)) dx = 0 because Tr(ZK) = 0, and the k = 2 term is 1/2 ∫∫_{I_L^2} ||K(x,y)||_F^2 dxdy. Since the (1,1) entry of K is λ IS(x-y), which tends to ±1/2 at large separation, this term is of order L^2. Section 3.1 instead gives Var = (1/2π^2) log L + O(1) from (1.3). The proof's cycle expansion (2.8)-(2.11) yields the printed trace only if the scalar entries K_{ij} in the Pfaffian cycles are entries of the original 2x2 kernel K0 (before multiplication by Z); the k = 1 term then gives 1/2∫ f^2 Tr(K0(x,x)) = ∫ f^2 λ a(x,x), recovering ρ_1. Lemma 2.4 has the same ambiguity: its 'all-ones' case evaluates to λ^k Tr(A^k), the original kernel's (1,1)-entry, whereas (ZK0)_{11} = λ b. Thus the V_k estimates and the proof of Theorem 1.2 rest on an inconsistent kernel convention; as printed, the theorem is unproved.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a class of Pfaffian point processes satisfying a finite-rank commutator property (FRCP) and proves, via the method of moments and cumulants, a central limit theorem for the normalized counting statistic (Theorem 1.2). The result is then applied to the Pfaffian Sine_4 and Sine_1 processes, which are shown to satisfy FRCP, and extended to scaled step-function statistics (Theorem 1.3). The proof strategy follows Soshnikov's cumulant approach for determinantal processes, with new technical lemmas for the Pfaffian cycle decomposition and for controlling remainder terms through the FRCP data.","tokens_in":24093,"tokens_out":15448,"duration_ms":127819,"significance":"If correct, this provides the first CLT of its kind for a broad class of Pfaffian point processes beyond the finite-rank case, covering bulk scaling limits of the orthogonal and symplectic ensembles. The FRCP framework is a natural analogue of the conditions used by Soshnikov and could be a useful tool for subsequent work on Pfaffian fluctuations. The paper also gives explicit variance asymptotics and identifies the correct log L scaling for Sine_4 and Sine_1. However, the present manuscript contains several notation inconsistencies and one substantial unproved verification, so the results as printed are not established.","major_comments":[{"comment":"The cumulant formula and the subsequent definition of V_k place the antisymmetrized kernel \\mathbf{K}=ZK inside the trace, but the proof of the Pfaffian cycle decomposition and Lemma 2.4 evaluate the trace using the entries of the original kernel K. With \\mathbf{K} inside the trace, the k=1 term vanishes and the k=2 term for the Sine_4 counting statistic on I_L is of order L^2, contradicting the variance Var = (1/2\\pi^2)\\log L + O(1) computed in Section 3.1. Concretely, Tr(\\mathbf{K}(x,y)\\mathbf{K}(y,x)) = Tr(ZK(x,y)ZK(y,x)) has a (1,1)-entry proportional to IS(x-y)^2, which is bounded away from zero at large separation, so its integral over I_L^2 is O(L^2). The derivation works only if the trace is taken over the original 2x2 kernel before multiplication by Z. This inconsistency must be corrected consistently in Proposition 2.2, the definition of V_k, Lemma 2.4, and the proof of Theorem 1.2; as printed, the proof does not establish the theorem.","section":"Proposition 2.2; equations (2.8)–(2.11); Lemma 2.4; Section 3.1"},{"comment":"The FRCP data for the Sine_1 process is stated as (4, f^{(i)}, g^{(i)}, h^{(i)}, e^{(i)}, 1, 1), but Definition 1.1 requires α+β=0 when λ=1. The computation just above shows that D_L B_L + A_L - A_L^2 is a finite-rank operator, which corresponds to α=1, β=-1. Unless the data are corrected to α=1, β=-1, the hypotheses of Theorem 1.2 are not verified for Sine_1, and the Sine_1 part of Theorem 1.3 is unsupported. The final values of α and β must also be propagated into Lemma 2.4 and the step-function argument.","section":"Section 3.2"},{"comment":"The verification of Assumption (A)(v) for step functions is dispatched in a single sentence: 'an argument similar to that in Lemmas 3.2 verifies Assumption (A)(v).' This is load-bearing: Assumption (A)(v) requires bounds of order o(Var) for inner products involving operators with an arbitrary number of interval restrictions χ_{I_L^{(i)}} A_L and A_L^*, and the reduction to Lemma 3.2 is not automatic because the localized operators do not satisfy the same FRCP data on the subintervals without additional argument. No estimates for these intermediate products are supplied. Until this verification is written out, Theorem 3.4 and hence the step-function CLT of Theorem 1.3 are not proven.","section":"Section 3.3, proof of Theorem 1.3, verification of Assumption (A)(v)"},{"comment":"The proof of Theorem 3.4 is only a concise outline. Equation (3.23) introduces constants C_{i_1,...,i_k} without definition, and the phrase 'By Lemma 2.4, it suffices to prove...' skips the required analogue of Lemma 2.4 under Assumption (A), where the operators A, B, D are modified by interval restrictions and the finite-rank commutator data are positioned inside each interval. A complete justification of the decomposition into merged-sequence traces and the rank-one remainder terms is needed. This gap is closely related to the previous comment on Assumption (A)(v).","section":"Section 3.3, proof of Theorem 3.4"}],"minor_comments":[{"comment":"There are numerous typographical errors, including 'Fixed an integer N' for 'Fix an integer N', 'patitions' for 'partitions', 'commutate' for 'commutator', 'FRCR' for 'FRCP', and inconsistent use of 'Sine4' vs 'Sine_4'. These should be corrected.","section":"Throughout"},{"comment":"The variance formula for Sine_1 contains the term IS(2L)^2 - IS(2L); it may be helpful to recall that IS(2L) tends to 1, so this term is O(1), but the notation should be consistent.","section":"Section 3.2"},{"comment":"In the bound after the alternating series argument, the integration limits in the second term are printed as ∫_{⌊x⌋+2}^{⌊x⌋+1}, which is reversed; it should read ∫_{⌊x⌋+1}^{⌊x⌋+2}.","section":"Lemma 3.3"},{"comment":"When verifying condition (iii) of Theorem 1.2, the paper cites ‖A_L - A_L^2‖_1 = O(log L) but does not specify the δ required in condition (iii); since Var is O(log L), any δ>1 works, but this should be stated explicitly.","section":"Section 3.1"},{"comment":"In the proof of Lemma 2.4, the notation K is used for both the original matrix kernel and the antisymmetrized kernel; this is the source of the major inconsistency and should be resolved by distinct symbols throughout.","section":"Section 2"}],"recommendation":"major_revision","confidential_remarks":"The FRCP framework is a promising extension of Soshnikov's approach to Pfaffian processes, and the Sine_4/Sine_1 applications are natural. However, the notation inconsistency in Proposition 2.2, the incorrect FRCP constants for Sine_1, and the missing verification of Assumption (A)(v) make the current version unproven. These appear fixable without changing the core strategy, so I recommend major revision rather than rejection. The authors should also be asked to make the proof of Theorem 3.4 genuinely complete rather than a sketch."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The finite-rank commutator property is a real new device, and the explicit commutator computation for Sine4 in §3.1 is the best part of the paper. The step-function CLT for Sine4 and Sine1 is a genuine advance over Leblé (C^4) and Lambert (C^3), since counting statistics are exactly the non-smooth case those results miss. The paper is self-contained, the moment/cumulant route is the right one, and the variance asymptotics check out.\n\nThe soft spot is load-bearing, and the stress-test note is right. Proposition 2.2's displayed cumulant formula puts the antisymmetrized kernel K = ZK inside the trace. Read literally, the k=1 term is Tr(ZK)/2 = 0, so the expectation of the counting statistic vanishes; the k=2 term for Sine4 counts on (-L,L) is order L^2, contradicting the log L variance in §3.1. (2.8) itself gives ρ1 = 0 for n=1, which cannot be right. The proof of the proposition and Lemma 2.4 only work if the trace is over the original 2×2 kernel before the Z multiplication; Lemma 2.4's all-ones cycle uses λ a, the original (1,1)-entry, while (ZK)_11 = λ b. The authors conflate the two kernels, and a reader has to re-derive the cumulant formula before trusting anything. With the original kernel, the n=2 cumulant matches (1.3) and the V_k estimates go through, so this is a correctable notational error — but as printed, Theorem 1.2 is unproved.\n\nTwo smaller issues. The Sine1 FRCP data in §3.2 says (α,β)=(1,1), but the displayed relation is DB + A − A^2, which needs β = −1 to satisfy α+β = 0 for λ = 1. And the verification of Assumption (A)(v) for step functions in the proof of Theorem 1.3 is one sentence; given the four families of inner products, that must be written out. There are also many typos, but those are cosmetic.\n\nCitations look right: Soshnikov, Kargin, Leblé, Lambert, Costin-Lebowitz are all covered, and the novelty claim against them holds. This is a paper for random matrix and point process people. It deserves referee time, not a desk reject, but the request should be for a corrected version with the kernel convention fixed and (A)(v) filled in before the proofs are reviewed as they stand.","headline":"The FRCP idea is genuinely new and the Sine4 commutator computation is the strong part, but Proposition 2.2's cumulant formula puts the antisymmetrized kernel in the trace, the variance comes out O(L^2) instead of log L, and Theorem 1.2 is unproved as printed — correctable, but not ready as is.","tokens_in":24655,"tokens_out":23124,"would_cite":false,"duration_ms":180476,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60G55","30B20","30H20"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves a central limit theorem for counting and step-function linear statistics of Pfaffian point processes, covering the bulk-scaling limits of the orthogonal and symplectic random matrix ensembles.","keywords":["Pfaffian point processes","central limit theorem","linear statistics","finite-rank commutator property","Sine4 process","Sine1 process","random matrix ensembles","moment method"],"falsifier":"Compute the second and fourth cumulants of the Sine_4 count on $(-L,L)$ directly from the cumulant formula of Proposition 2.2 and compare them with the claimed variance $\\frac{1}{2\\pi^2}\\log L+O(1)$; any cumulant that grows like a positive power of $L$ would show the normalization is wrong.","tokens_in":23516,"feed_emoji":"🎲","tokens_out":16002,"duration_ms":135761,"temperature":0.7,"pith_summary":"Pfaffian point processes govern configurations whose correlation functions are Pfaffians of an antisymmetric 2x2 kernel, including eigenvalue configurations of the orthogonal and symplectic random matrix ensembles. The paper's aim is a general central limit theorem: whenever such a process satisfies a finite-rank commutator property and its variance grows, the centered and normalized counting statistic is Gaussian in the limit. Applications are given to the Pfaffian Sine_4 and Sine_1 processes, the universal bulk-scaling limits of these ensembles, for both interval counts and finite linear combinations of interval indicators. The proof works by showing that all cumulants of order three and higher are negligible compared with the appropriate power of the variance, using a combinatorial decomposition of Pfaffian correlation functions into traces of products of the matrix kernel.","feed_headline":"Pfaffian point processes: counting statistics go Gaussian","feed_subtitle":"New finite-rank commutator condition yields central limit theorems for the sine_4 and sine_1 bulk limits.","key_machinery":"The argument runs through a cumulant expansion for Pfaffian linear statistics. Proposition 2.2 expresses the $n$-th cumulant of $S_f$ as a sum over partitions of $[n]$ of integrals of $\\operatorname{Tr}(K(x_1,x_2)\\cdots K(x_k,x_1))$, with $K=ZK$; the combinatorial step is a Pfaffian-cycle decomposition of the correlation function into 'necklaces.' The finite-rank commutator property (FRCP) then supplies the operator identities $A^\\dagger B-BA=\\sum f^{(i)}\\otimes g^{(i)}$ and $DB-(\\alpha A^2+\\beta A)=\\sum h^{(i)}\\otimes e^{(i)}$, which collapse every such trace to $\\lambda\\operatorname{Tr}(A^k)$ plus products of rank-one operators. Under the hypothesis $\\|A_L-A_L^2\\|_1=o(\\mathrm{Var})^\\delta$, the leading terms reduce to $\\lambda\\operatorname{Tr}(A_L)$, so the $k$-th cumulant of the count becomes a difference $V_k-V_{k-1}$ that is negligible for $k\\ge 3$; Lemma 2.1 converts the vanishing cumulants into convergence to the normal law.","core_discovery":"The central discovery is that a structural condition, the finite-rank commutator property (FRCP), is enough to force Gaussian fluctuations in Pfaffian point processes. Theorem 1.2 states that for a family $P_L$ with kernel $K_L(x,y)=ZK_L(x,y)$ and FRCP data satisfying variance growth, boundedness, the trace-class closeness $\\|A_L-A_L^2\\|_1=o(\\mathrm{Var}_{P_L}(\\#X_L))^\\delta$, and negligibility of the finite-rank inner products, the normalized count $\\frac{\\#X_L-\\mathbb{E}_{P_L}[\\#X_L]}{\\sqrt{\\mathrm{Var}_{P_L}(\\#X_L)}}$ converges in distribution to $N(0,1)$. Theorem 1.3 extends the conclusion to scaled step-function statistics in the Pfaffian $\\mathrm{Sine}_4$ and $\\mathrm{Sine}_1$ processes. The authors verify FRCP explicitly for these processes, with rank-two and rank-four commutators, and show that the variance of interval counts is $\\sim \\frac{1}{2\\pi^2}\\log L$ for Sine_4 and $\\sim \\frac{2}{\\pi^2}\\log L$ for Sine_1, so normalization by the standard deviation is meaningful.","pith_inferences":["Beyond the paper's claims, the same estimates should give Gaussian limits for local linear statistics of any finite-rank perturbation of the sine processes, because the FRCP identities and trace-class bounds are stable under such perturbations.","A direct test of the method is the real Ginibre bulk process, whose Pfaffian correlation structure is known but whose FRCP data are not worked out here; computing the commutator ranks would show how widely the condition holds.","The trace-class condition involving $\\|A_L-A_L^2\\|_1$ suggests the result should extend to mesoscopic intervals of length $L^\\alpha$ with $0<\\alpha<1$ and variance of order $\\log L$, though the paper itself states only the full-interval scaling."],"forward_implications":["In the bulk of the orthogonal and symplectic random matrix ensembles, the number of eigenvalues in an interval of length $O(L)$ in microscopic units fluctuates normally after subtracting its mean and dividing by $\\sqrt{\\log L}$.","For any fixed step function $\\phi$ with finitely many intervals, the scaled statistic $S_{\\phi_L}$ in the Pfaffian $\\mathrm{Sine}_4$ and $\\mathrm{Sine}_1$ processes has Gaussian fluctuations.","The finite-rank commutator property gives a checkable sufficient condition: a Pfaffian process whose kernel operators admit finite-rank commutators and whose variance diverges satisfies a central limit theorem whenever the requisite trace-class estimates hold.","The result extends to Pfaffian processes the classical Gaussian fluctuation theory for determinantal point processes, with the same logarithmic variance growth for counting in expanding intervals."],"supporting_citations":[{"why":"supplies the sine-kernel variance asymptotics and the classical Gaussian fluctuation result for determinantal counts, which the variance computations for Sine_4 and Sine_1 rely on.","marker":"[7]"},{"why":"supplies the method and trace-class estimates for particle-count fluctuations in determinantal fields, including the bound $\\|A_L-A_L^2\\|_1=O(\\log L)$ used in the applications.","marker":"[27]"},{"why":"supplies the cumulant-convergence criterion and moment method that the proof of Theorem 1.2 adapts to Pfaffian processes.","marker":"[30]"},{"why":"proves a central limit theorem for Pfaffian point processes with finite-rank kernels, the earlier result that the present finite-rank commutator framework extends.","marker":"[17]"},{"why":"contains the determinantal cumulant formula whose Pfaffian analogue is established in Proposition 2.2.","marker":"[28]"}],"fun_headline_variants":["Gaussian limit proven for Pfaffian point processes","Finite-rank commutators force Gaussian counting statistics","Sine_4 and Sine_1: linear statistics go Gaussian","Pfaffian processes: CLT from a finite-rank condition","Gaussian fluctuations in Pfaffian point processes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that every rank-one correction produced by the finite-rank commutator identities is negligible compared with the variance, uniformly in the fixed order of the cumulant being estimated.","fun_headline_variants_meta":{"raw":{"variants":["Gaussian limit proven for Pfaffian point processes","Finite-rank commutators force Gaussian counting statistics","Sine_4 and Sine_1: linear statistics go Gaussian","Pfaffian processes: CLT from a finite-rank condition","Gaussian fluctuations in Pfaffian point processes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000156,"raw_usage":{"total_tokens":1161,"prompt_tokens":832,"completion_tokens":329,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":448,"completion_tokens_details":{"reasoning_tokens":251}},"tokens_in":448,"tokens_out":329,"duration_ms":3284,"temperature":1.0,"reasoning_tokens":251,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T11:52:14.131678+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the second and fourth cumulants of the Sine_4 count on $(-L,L)$ directly from the cumulant formula of Proposition 2.2 and compare them with the claimed variance $\\frac{1}{2\\pi^2}\\log L+O(1)$; any cumulant that grows like a positive power of $L$ would show the normalization is wrong.","supporting_citations":[{"cited_title":"Costin and J","cited_arxiv_id":null,"evidence_quote":"supplies the sine-kernel variance asymptotics and the classical Gaussian fluctuation result for determinantal counts, which the variance computations for Sine_4 and Sine_1 rely on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"supplies the method and trace-class estimates for particle-count fluctuations in determinantal fields, including the bound $\\|A_L-A_L^2\\|_1=O(\\log L)$ used in the applications."},{"cited_title":"Soshnikov","cited_arxiv_id":null,"evidence_quote":"supplies the cumulant-convergence criterion and moment method that the proof of Theorem 1.2 adapts to Pfaffian processes."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"proves a central limit theorem for Pfaffian point processes with finite-rank kernels, the earlier result that the present finite-rank commutator framework extends."},{"cited_title":"Soshnikov","cited_arxiv_id":null,"evidence_quote":"contains the determinantal cumulant formula whose Pfaffian analogue is established in Proposition 2.2."}],"review_version":1}