{"id":"55afa3b8-1202-42be-8259-3601d5153c37","arxiv_id":"2607.07617","paper_version":1,"verdict":"ACCEPT","confidence":"UNKNOWN","novelty_score":8.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"For rational beta>0, the Sine-beta and Airy-beta point processes are the unique solutions of the bulk and edge loop equation hierarchies respectively.","lead":"This paper proves that the universal Sine-beta and Airy-beta point processes of random matrix theory are uniquely characterized by their loop equation hierarchies, for rational beta>0. This provides a new route to proving universality: verify approximate loop equations instead of comparing to exactly solvable ensembles.","discovery_kind":"unclear","skeptic_critique":{"model":"glm-5.2","headline":"No significant objection identified. The rationality restriction on β is a genuine but acknowledged limitation of the method, not a correctness concern for what is proven.","rationale":"The paper is a substantial 130+ page work with a novel proof strategy combining loop equations, integrable systems, and D-module theory. After careful review of the three main pillars—local law, linearization, and branch identification—I find no internally inconsistent step or hidden assumption that would undermine the central claim for rational β. The rationality restriction is the most notable limitation but is clearly acknowledged and does not affect correctness of what is proven. The reader's verdict of ACCEPT is appropriate. The confidence level should perhaps be raised from UNKNOWN to moderate, given the internal consistency of the argument and the successful β=2 verification in Appendices D and E, though full confidence would require independent verification of the more intricate calculations in Propositions 6.3 and 6.6.","tokens_in":90105,"tokens_out":8270,"duration_ms":399706,"concrete_test":"Independently verify the commutator identities (7.4)–(7.6) and the resulting Gröbner basis property for a small concrete case, e.g., n=2, m=2, β=1 (so p=1, q=2). Compute [T_1,T_2], [S_1,S_2], and [T_1,S_1] symbolically and check they match the right-hand sides 4/β(t_1-t_2)^{-2}(T_2-T_1), β(s_1-s_2)^{-2}(S_2-S_1), and 4/β(t_1-s_1)^{-2}S_1 - β(t_1-s_1)^{-2}T_1 respectively. Then verify that the S-pairs reduce to zero modulo the generators, confirming dim_K(D_K/I) = 2^4 = 16. If any identity fails, the dimension count underlying the uniqueness argument collapses.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim—for rational β>0, Sine_β (resp. Airy_β) is the unique particle-generated Nevanlinna solution of the bulk (resp. edge) loop equation hierarchy—rests on three pillars: (1) the loop equations imply a local law (concentration of s(w) around ±i or √w), (2) exponential observables linearize the nonlinear hierarchy into a deformed CMS system under the half-plane balance condition (5.2), and (3) the solution space of this system has dimension 2^{n+m} with a unique 'physical' branch matching the observable's asymptotics. I examined each pillar for internal inconsistencies.\n\n(1) The local law proof (§3.4) follows the moment bootstrap from [19]. The key estimate (3.5) uses the test function F(u,v)=(u²+1)^{q-1}(v²+1)^q and Young's inequality to close a self-referential bound on E[|Q(w)|^{2q}]. The two-case split (E[|Q|^{2q}] ≤ 1 vs > 1) correctly resolves the self-reference. This is sound.\n\n(2) The linearization (§5) requires the balance condition (5.12)/(5.2) to cancel base-point factors in the product representation. I verified that with a_ℓ ∈ {1, -β/2} and β/2 = p/q, the condition Σ_{ℓ: ε(w_ℓ)=+1} a_ℓ = 0 is satisfiable with n=kp, m=kq variables, and that the base-point cancellation in (5.15) is correct. The master identity (5.14) follows cleanly.\n\n(3) The D-module argument (§7.1) establishes dim = 2^{n+m} via a Gröbner basis. The commutator identities (Proposition 7.1) are verified by direct local computation, and the S-pair reductions via Buchberger's criterion are standard. The Volterra contraction argument (§7.3) relies on the spectral gap Re[Λ_{I,A}] = 2|I| + β|A| ≥ min(2,β) > 0, which follows from the direction construction in Proposition 7.4. The branch identification (Proposition 6.3, Step 3) uses a well-chosen scaling configuration (6.24) where I verified the algebraic exponent cancellation: -2p²/β - βq²/2 + 2pq = 0 using β/2 = p/q, and the exponent κ = (q/p)(v - pu/q)² ≥ 0 with equality exactly at the balance condition.\n\nThe reader's ident","agreement_with_reader":"agree"},"referee_report":{"model":"glm-5.2","summary":"This paper proves that, for every rational β>0, the Sine_β point process is the unique particle-generated Nevanlinna solution of the bulk loop equation hierarchy (Assumption 1.4), and the Airy_β point process is the unique solution of the edge loop equation hierarchy (Assumption 1.10). The argument proceeds in three steps: (1) the loop equations imply a local law (concentration of the Stieltjes transform around ±i in the bulk and √w at the edge, with sub-Gaussian tails); (2) exponential observables—averages of products of ratios of linear factors over the point configuration—linearize the nonlinear loop hierarchy into a deformed Calogero–Moser–Sutherland (CMS) system under a half-plane balance condition (5.2) that forces β to be rational; (3) the solution space of the deformed CMS system is classified via D-module/Gröbner basis arguments (dimension 2^{n+m}) and Volterra fixed-point construction of sectorial solutions, and the physical branch is identified by matching asymptotics. The authors apply their characterization to Wigner matrices (recovering bulk universality) and to random d-regular graphs (proving bulk universality for d≫(log N)^{24} and simplifying the edge universality argument for fixed d).","tokens_in":90503,"tokens_out":2075,"duration_ms":301617,"significance":"This is a substantial and potentially field-defining contribution. The idea that loop equations—analogue of Stein's method identities—do not merely hold for the limiting processes but characterize them is conceptually new and powerful. The paper ships a complete, self-contained proof across 130+ pages, with the D-module classification (Sections 7–8), the explicit β=2 solutions (Appendices D–E), and the applications to random regular graphs all carried out in full detail. The convergence criteria (Theorems 1.9, 1.12) provide a concrete, falsifiable route to universality: one verifies approximate loop equations rather than comparing to a reference ensemble. The extension to random d-regular graphs in the polylogarithmic degree regime demonstrates the method's scope beyond invariant ensembles. The rationality restriction on β is a genuine but acknowledged limitation, clearly stated as a feature of the proof method rather than the expected truth, with Conjecture 1.13 formulating the expected generalization.","major_comments":[{"comment":"Section 6.3, Step 3 (Eq. 6.27–6.31): The identification of the coefficient c_ε = 1 for each admissible ε ∈ E_η relies on comparing the asymptotic of F(t,s) from Proposition 4.1 (Eq. 6.27) with the distinguished branch F_{ε,η} (Eq. 6.31) along a specific block-separated configuration (6.24). The argument that all non-distinguished branches F_{ε',η} with ε' ≠ ε are exponentially suppressed (Eq. 6.34) uses the estimate |algebraic part of Φ_{ε',η}| ≤ (CΛ)^{4(n+m)^2} (Eq. 6.33). Since the exponential suppression is e^{-2(Λ²+Λ)} and the algebraic growth is polynomial in Λ, this is indeed sufficient. However, the claim that the algebraic factors between different blocks are 'bounded by CΛ^4' with at most (n+m)^2 such factors deserves more justification: the exponents α_{ij}, γ_{ab}, ρ_{ia} can be negative (e.g., α_{ij} = -2/β when ε_i ≠ ε_j), so cross-block algebraic factors could in principle衰","section":null},{"comment":"Proposition 2.18 (Eq. 2.107): The approximate edge loop equations for random d-regular graphs with fixed degree d are stated but not proved in this paper—the proof is deferred to [52]. The claim is that these equations, combined with Theorem 1.12, simplify the edge universality proof. However, the error term in (2.107) is O(N^{-(p+1)/3 - 10c}), and it is not immediately clear from the statement alone how this error scales relative to the (1 + E[R_N^{p+1}]) factor that appears in the convergence criterion (1.6). The authors should verify that the error structure in (2.107) is compatible with the hypotheses of Theorem 1.12, or explicitly state the correspondence.","section":null},{"comment":"Section 5.1, Proposition 5.1: The half-plane balance condition (5.2) requires n = βm/2, which with β/2 = p/q gives n = kp, m = kq. The master identity (5.14) is derived under the condition (5.12) that base-point factors cancel. The cancellation in (5.15) is verified for the bulk case. For the edge case (Section 5.2, Proposition 5.3), the Airy-regularized product (5.23) involves the formal regularized product Γ_x(z), and the cancellation argument in (5.24) is stated more briefly. Given that the edge observables involve additional exponential factors e^{t/a_j} and e^{s/a_j} (from the Airy regularization), the authors should confirm that the base-point cancellation in the edge case is fully rigorous and not merely formal, particularly regarding the convergence of the infinite product.","section":null}],"minor_comments":[{"comment":"The paper is very long (130+ pages). While the length is largely justified by the completeness of the treatment, a brief roadmap at the start of Section 7 (Solutions of the bulk deformed CMS operators) explaining the logical flow: Gröbner basis (7.1) → conjugated system (7.2) → Volterra fixed point (7.3) would help the reader.","section":null},{"comment":"In Proposition 4.1, the quantity L in (4.4) involves a sum of logarithms. The condition L ≤ L_0 in part (ii) is used to control the Taylor expansion of E[e^Ξ]. It would help to state explicitly what L_0 depends on (p, q, k) and give a rough sense of its size.","section":null},{"comment":"The notation β/2 = p/q ∈ Q_{>0} is introduced in Proposition 4.1 but the relationship n = kp, m = kq is only made explicit later (e.g., in Corollary 4.2 and Proposition 6.3). Stating this earlier would improve readability.","section":null},{"comment":"In the proof of Theorem 1.5 (Section 6.2), the diagonal specialization (6.12) sets w_α = t_1^(α) = ··· = s_q^(α). The claim that the observable equals 1 after this specialization should note that this follows from β/2 = p/q, which makes the numerator and denominator powers match. This is implicit but worth stating.","section":null},{"comment":"Section 2.4.1: The condition d ≫ (log N)^{24} is stated as sufficient but 'not optimal.' The exponent 24 appears to come from the interplay between the local law (Theorem 2.12, requiring d ≥ (log N)^4) and the switching calculus error bounds. A brief remark explaining the source of the exponent 24 (rather than, say, 4 or 8) would be helpful.","section":null},{"comment":"Typographical: In equation (2.50), the last term on the right-hand side has a factor w/(N(πϱ_E)^2), but the subsequent absorption argument uses |w| ≤ C_K. This is correct but the bound could be stated more explicitly as |w| ≤ C_K since w ∈ K.","section":null},{"comment":"The reference to [52] for the proof of Proposition 2.18 should clarify whether the proof in [52] covers the full approximate loop equation hierarchy (all p ≥ 1) or only specific cases.","section":null},{"comment":"In Section 7.3, Proposition 7.4, the construction of the direction ω depends on the ordering of real parts of z_i. It would be useful to note that this construction is purely deterministic and that ω depends only on z, not on the sign pattern (ε,η).","section":null},{"comment":"Appendix F is referenced in Remark 1.7 as proving equivalence between loop equations and the BBGKY hierarchy, but the content of Appendix F is not visible in the provided text (it appears to be truncated). The authors should verify that this appendix is complete in the final version.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The paper is a major piece of work that appears to be essentially correct in its central claims. The three pillars of the argument (local law from loop equations, linearization via exponential observables, and D-module classification) are each carefully executed. The rationality restriction on β is the main limitation but is clearly acknowledged and does not affect the correctness of what is proven. The applications to Wigner matrices and random regular graphs, while not the deepest results in the paper, demonstrate the practical utility of the characterization framework. I recommend minor revision primarily to address the clarity issues in the edge-case base-point cancellation argument and the compatibility of Proposition 2.18 with Theorem 1.12. The paper is suitable for a top probability or mathematical physics journal."},"author_rebuttal":{"model":"glm-5.2","summary":"We thank the referee for a careful reading and for identifying three points where the manuscript can be improved. All three comments are substantive and concern technical details in Sections 5–6 and the application to random regular graphs in Section 2.4. We address each below. In brief: (1) the cross-block algebraic estimate in Step 3 of Proposition 6.3 needs a more careful argument handling negative exponents, and we will add the missing details; (2) the compatibility of the error term in Proposition 2.18 with Theorem 1.12 should be stated explicitly, and we will add a remark; (3) the base-point cancellation in the edge case (Proposition 5.3) is rigorous but the argument is stated too briefly, and we will expand it. We classify this as a partial revision.","responses":[{"response":"The referee is correct that the bound on cross-block algebraic factors in the non-distinguished branches requires more careful justification than what is currently written. We explain the complete argument here and will incorporate it into the revision. The key observation is that for the distinguished branch ε, within each block all t-variables share the same ε-sign and all s-variables share the same η-sign, with ε-signs and η-signs opposite. Hence α_{ij}=0, γ_{ab}=0, ρ_{ia}=0 for within-block pairs. For cross-block pairs between blocks α≠β with τ_α≠τ_β, the block separation is |w_α - w_β| ≍ Λ^4 while within-block fluctuations are O(Λ). So each cross-block ratio (t_i^{(α)} - t_j^{(β)})/(w_α - w_β) = 1 + O(Λ^{-3}), and similarly for mixed and s-s cross-block differences. For the non-distinguished branch ε'≠ε, the mismatches m_α(ε')≥1 cause some within-block pairs to have ε'_i≠ε'_j, giving exponent α_{ij}=-2/β. But these within-block differences are |t_i^{(α)} - t_j^{(α)}| ≍ Λ (since the reference points ξ_r are pairwise distinct), so each such factor contributes Λ^{-2/β}, which is polynomial in Λ. The total number of such factors is at most (n+m)^2. Crucially, the total power of (w_α - w_β) from cross-block factors cancels (as verified in the manuscript: -2p²/β - βq²/2 + 2pq = 0 using β/2=p/q), so cross-block factors contribute 1+O(Λ^{-3}). The within-block factors with negative exponents contribute at most (CΛ)^{4(n+m)^2} in total, which is polynomial. Since the exponential suppression is e^{-2(Λ²+Λ)}, this polynomial growth is indeed negligible. We will add this detailed accounting to the proof.","revision_made":"yes","referee_comment":"Section 6.3, Step 3 (Eq. 6.27–6.31): The identification of c_ε = 1 relies on comparing asymptotics. The claim that cross-block algebraic factors are 'bounded by CΛ^4' with at most (n+m)^2 such factors deserves more justification, since exponents α_{ij}, γ_{ab}, ρ_{ia} can be negative (e.g., α_{ij} = -2/β when ε_i ≠ ε_j), so cross-block algebraic factors could in principle grow."},{"response":"The referee raises a valid point about the compatibility between the error structure in Proposition 2.18 and the hypotheses of Theorem 1.12. We clarify the correspondence here and will add it explicitly in the revision. In Proposition 2.18, the observable is expressed in terms of Δ(z) = m_N(z) - m_d(z), which under the edge scaling N^{1/3}A^{-2/3}Δ(E + w/(AN)^{2/3}) converges to s(w) - √w. The error term O(N^{-(p+1)/3 - 10c}) in (2.107) is an absolute error, while the convergence criterion (1.6) requires the error to be o_N(1)·(1 + E[R_N^{p+1}]). Under the edge local law for random d-regular graphs (established in [52]), R_N = O(N^c) on the event Ω_N, so E[R_N^{p+1}] is polynomially bounded. The exponent -(p+1)/3 - 10c is negative for any fixed p≥1 and sufficiently small c>0, so the absolute error is o_N(1). Moreover, on Ω_N^c (which has probability O(N^{-(1-c)})), the trivial resolvent bound gives R_N = O(N^{2/3+c}), and the contribution is absorbed using the small probability. We will add a remark after Proposition 2.18 explicitly stating this correspondence and verifying that the hypotheses of Theorem 1.12 are satisfied.","revision_made":"yes","referee_comment":"Proposition 2.18 (Eq. 2.107): The approximate edge loop equations for random d-regular graphs with fixed degree d are stated but not proved in this paper. The error term is O(N^{-(p+1)/3 - 10c}), and it is not immediately clear how this error scales relative to the (1 + E[R_N^{p+1}]) factor in the convergence criterion (1.6). The authors should verify compatibility or explicitly state the correspondence."},{"response":"We agree that the base-point cancellation in the edge case is stated too briefly and that the convergence of the Airy-regularized product deserves explicit verification. The cancellation is in fact rigorous, for the following reason. The formal regularized product Γ_x(z) = e^{c_0 z} ∏_{j≥1} (z - x_j) e^{z/a_j} is not absolutely convergent by itself, but the ratios appearing in (5.16) are well-defined. Specifically, under the balance condition (5.17), the base-point factors Γ_x(ε(w_ℓ)i)^{a_ℓ} cancel in the product ∏_ℓ Γ_x(w_ℓ)^{a_ℓ}, so the observable depends only on the ratios Γ_x(w_ℓ)/Γ_x(ε(w_ℓ)i). Each such ratio can be written as exp(-∫_{ε(w_ℓ)i}^{w_ℓ} s(u) du), which is well-defined since s is holomorphic on each half-plane. The exponential factors e^{t/a_j} and e^{s/a_j} from the Airy regularization appear in the per-particle factors (t - x_j)e^{t/a_j} and (s - x_j)e^{s/a_j}, and their contribution to the ratio is exp(a_ℓ(w_ℓ - ε(w_ℓ)i)/a_j) per particle. Summing over j, the total exponential factor is exp(a_ℓ(w_ℓ - ε(w_ℓ)i)·∑_j 1/a_j), which diverges. However, this divergence is exactly canceled by the c_0 term: the sum ∑_{j≥1} 1/a_j is regularized by the Airy function zeros, and the identity c_0 = Ai'(0)/Ai(0) = -∑_{j≥1} 1/a_j (in the regularized sense) ensures cancellation. More precisely, the representation (3.11) gives s(w) = ∑_{j≥1}(1/(x_j - w) - 1/a_j) - c_0, so that ∫ s(u) du = -log Γ_x(w) + log Γ_x(ε(w)i), and the integral is absolutely convergent by the rigidity estimate (3.10). We will expand the argument in Section 5.2 to make this explicit, including a verification that the rigidity estimate (3.10) ensures the integrability of s(u) - √u along the integration path, which is the key input for the convergence.","revision_made":"yes","referee_comment":"Section 5.1, Proposition 5.1 / Section 5.2, Proposition 5.3: The base-point cancellation in the edge case (5.24) is stated more briefly than the bulk case (5.15). Given that edge observables involve additional exponential factors e^{t/a_j} and e^{s/a_j} from Airy regularization, the authors should confirm that the base-point cancellation is fully rigorous, particularly regarding convergence of the infinite product."}],"tokens_in":90490,"tokens_out":1891,"duration_ms":406227,"standing_objections":[]},"desk_editor":{"model":"glm-5.2","letter":"This paper proves that for rational beta > 0, the Sine_beta point process is the unique solution of the bulk loop equation hierarchy, and Airy_beta is the unique solution of the edge hierarchy. The conceptual point is simple and important: instead of proving universality by comparison with a solvable model, you verify approximate loop equations and the limiting process is forced on you. That is a genuine shift in strategy for random matrix universality, and the applications to Wigner matrices and d-regular graphs show it is not just abstract — it gives shorter proofs in settings where the three-step scheme is hard to run. The proof has three stages. First, loop equations imply a local law (concentration of the Stieltjes transform around i in the bulk, sqrt(w) at the edge). This follows the moment bootstrap from earlier work of the authors and is solid. Second, the nonlinear loop hierarchy is linearized by passing to exponential observables — products of ratios of linear factors over the point configuration. Under a half-plane balance condition that forces beta to be rational, these observables satisfy a system of linear PDEs that are deformed Calogero-Moser-Sutherland equations. This linearization is the key new idea and it is clean. Third, the solution space of the deformed CMS system is classified: dimension 2^{n+m} via a Groebner basis argument, with a Volterra fixed-point construction picking out the unique physical branch matching the observable's asymptotics. The stress-test checked the algebraic cancellations in the branch identification (the exponent kappa computation and the cross-block cancellation) and they are correct. The commutator identities and Buchberger criterion application are standard and correctly executed. The soft spot is the rationality restriction. The linearization requires beta/2 = p/q so that the balance condition (5.2) can be satisfied with integer numbers of variables. The authors conjecture this is non-essential, and the restriction is clearly acknowledged, but the method as stated genuinely needs it. Whether a different linearization scheme could handle irrational beta is unclear. This is a limitation of the method, not a correctness concern for what is proven. The d-regular graph application extends bulk universality to degrees growing as (log N)^24, which is a real improvement over prior results, though the exponent is far from optimal and the authors say so. Overall: a substantial paper with a new proof strategy that works. The 130 pages are well-organized and the argument is internally consistent. It deserves a serious referee who can check the D-module and Volterra arguments in detail.","headline":"Loop equations uniquely characterize Sine_beta and Airy_beta for rational beta, via linearization through deformed CMS systems","tokens_in":91313,"tokens_out":592,"would_cite":true,"duration_ms":132650,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60B20","60G55","82B44"],"pacs":[],"model":"glm-5.2","headline":"Loop equations uniquely pin down random matrix statistics","keywords":["random matrix theory","loop equations","Sine_beta process","Airy_beta process","universality","beta-ensembles","Calogero-Moser-Sutherland systems","Stieltjes transform"],"falsifier":"If one could exhibit a point process, distinct from Sine_beta, whose Stieltjes transform satisfies the bulk loop equation hierarchy (Assumption 1.4) for some rational beta > 0, the main theorem would be false. Equivalently, the theorem predicts that any such process must have the Sine_beta law, so a single counterexample would refute it.","tokens_in":90253,"feed_emoji":"🎲","tokens_out":1169,"duration_ms":129568,"temperature":0.7,"pith_summary":"The paper proves that the universal local point processes of random matrix theory — Sine_beta in the bulk and Airy_beta at the edge — are the unique solutions of their respective loop equation hierarchies, for every rational beta > 0. Loop equations are identities satisfied by the Stieltjes transform of the eigenvalue point process, derived from integration by parts in the logarithmic gas. The authors show that any point process whose Stieltjes transform satisfies these universal microscopic identities must have the same law as Sine_beta (bulk) or Airy_beta (edge). The proof proceeds in three stages: first, the loop equations force the Stieltjes transform to concentrate around its deterministic value (i in the bulk, sqrt(w) at the edge) with sub-Gaussian tails — this is a local law derived from the equations themselves, not an external input. Second, the nonlinear loop hierarchy is linearized by passing to exponential observables (averages of products of ratios of linear factors over the random configuration), which satisfy a system of linear PDEs related to deformed Calogero-Moser-Sutherland integrable systems with two species of variables. Third, this linear system is solved completely: its solution space has dimension 2^{n+m}, indexed by sign patterns, and the physical solution is selected by matching asymptotic behavior at infinity. Once the exponential observables are uniquely determined, all correlation functions of the point process are recovered by differentiation, identifying the process. The rationality of beta enters because the linearization requires a half-plane balance condition that forces beta/2 to be a ratio of integers. Whether the characterization extends to irrational beta is stated as a conjecture. As applications, the authors derive bulk universality for Wigner matrices and for random d-regular graphs with polylogarithmic degree, and simplify the proof of edge universality for fixed-degree random d-regular graphs, by verifying approximate loop equations rather than comparing to an exactly solvable reference ensemble.","feed_headline":"Loop equations uniquely pin down random matrix statistics","feed_subtitle":"For rational beta, the universal bulk and edge point processes are the only solutions of their loop equation hierarchies, giving a direct,","key_machinery":"Exponential observables (expectations of principal-value products of ratios of linear factors over the point configuration), which linearize the nonlinear loop hierarchy into a system of second-order linear PDEs related to deformed Calogero-Moser-Sutherland operators with two species of variables. The solution space is classified via Groebner basis / D-module arguments (local holonomic rank 2^{n+m}), and the physical branch is selected by a Volterra fixed-point argument along shifted rays.","core_discovery":"The central discovery is that the loop equation hierarchy — a BBGKY-type system of identities for the Stieltjes transform of a log-gas, obtained by integration by parts — does not merely hold for the universal random matrix limits but uniquely characterizes them. The mechanism is a three-step chain: (1) the loop equations self-consistently imply a local law (concentration of the Stieltjes transform); (2) the nonlinear hierarchy linearizes on exponential observables that satisfy deformed Calogero-Moser-Sutherland differential equations; (3) the solution space of these linear PDEs has dimension exactly 2^{n+m}, and the physical branch is selected by asymptotic matching. This turns the loop方程从被","pith_inferences":[],"forward_implications":["Universality proofs for random matrix models reduce to verifying approximate loop equations, which often follow from local laws and integration by parts — bypassing the need for comparison with exactly solvable ensembles or Gaussian-divisible approximations.","The characterization provides a criterion analogous to Stein's method: just as the Gaussian distribution is characterized by the integration-by-parts identity E[Xf(X)] = E[f'(X)], the Sine_beta and Airy_beta processes are characterized by their loop equation hierarchies.","The connection to deformed Calogero-Moser-Sutherland systems suggests that integrable structures underlying beta-ensembles persist in the microscopic scaling limit, and the beta <-> 4/beta duality of the differential system reflects a known duality in random matrix theory.","The conjecture that characterization holds for irrational beta would, if true, remove the main technical limitation of the current approach.","Bulk universality for random d-regular graphs is extended to degrees growing as slowly as (log N)^{24}, and the method suggests a path toward the conjectured universality for fixed degree d >= 3."],"fun_headline_variants":["Loop equations uniquely determine universal random matrix limits","Sine and Airy point processes pinned by loop equation hierarchies","Loop equation hierarchies characterize Sine-beta and Airy-beta processes","Universality via loop equations: unique solutions at rational beta","Bulk and edge point processes uniquely characterized by loop equations"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The entire uniqueness argument depends on constructing exponential observables that linearize the loop hierarchy, and this construction requires beta to be rational (specifically, a half-plane balance condition forces beta/2 to be a ratio of two integers). Whether the loop equations characterize the process for irrational beta remains open.","fun_headline_variants_meta":{"raw":{"variants":["Loop equations uniquely determine universal random matrix limits","Sine and Airy point processes pinned by loop equation hierarchies","Loop equation hierarchies characterize Sine-beta and Airy-beta processes","Universality via loop equations: unique solutions at rational beta","Bulk and edge point processes uniquely characterized by loop equations"]},"model":"glm-5.2","effort":"high","cost_usd":0.0,"raw_usage":{"total_tokens":525,"prompt_tokens":459,"completion_tokens":66,"prompt_tokens_details":null},"tokens_in":459,"tokens_out":66,"duration_ms":13895,"temperature":1.0,"reasoning_tokens":null,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-09T04:52:13.552021+00:00","model_set":{"reader":"glm-5.2"},"falsifier":"If one could exhibit a point process, distinct from Sine_beta, whose Stieltjes transform satisfies the bulk loop equation hierarchy (Assumption 1.4) for some rational beta > 0, the main theorem would be false. Equivalently, the theorem predicts that any such process must have the Sine_beta law, so a single counterexample would refute it.","supporting_citations":[],"review_version":1}