arxiv: 2605.02093 · v2 · submitted 2026-05-03 · 🧮 math.PR · math.OA

Recognition: 3 theorem links

· Lean Theorem

An analytic approach to the finite R-transform

Katsunori Fujie, Octavio Arizmendi

Authors on Pith no claims yet

Pith reviewed 2026-05-08 19:06 UTC · model grok-4.3

classification 🧮 math.PR math.OA

keywords finite R-transformVoiculescu R-transformfree additive convolutionfinite free probabilitylogarithmic potentialsLegendre transformsempirical root distribution

0 comments

The pith

The finite R-transform of a polynomial differs from the Voiculescu R-transform of its empirical root distribution by an error of order O(N^{-1}).

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper provides an analytic treatment of the finite R-transform, an analogue of Voiculescu's R-transform for finite-degree polynomials. By connecting the finite free Fourier transform to the Laplace transform, the authors use logarithmic potentials and Legendre transforms to study its properties. They prove that, under suitable assumptions, this finite version approximates the standard R-transform of the polynomial's root distribution with an error that shrinks as one over the degree. This approximation directly yields an analytic demonstration that the finite free additive convolution converges to the free additive convolution as the degree tends to infinity.

Core claim

Under suitable assumptions, the finite R-transform of a polynomial differs from the Voiculescu R-transform of its empirical root distribution by O(N^{-1}). This is established by relating the finite free Fourier transform to the Laplace transform and applying analysis via logarithmic potentials and Legendre transforms. The result implies an analytic proof of the convergence of finite free additive convolution to free additive convolution.

What carries the argument

The finite R-transform, obtained by relating the finite free Fourier transform to the Laplace transform and then applying logarithmic potential and Legendre transform analysis.

If this is right

The difference between the finite and standard R-transforms vanishes at rate 1/N as the degree increases.
Finite free additive convolution converges to free additive convolution.
This convergence holds in a manner that can be analyzed through potential theory.
The approach offers a new way to study limits in free probability using analytic tools rather than combinatorics.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The O(N^{-1}) bound may enable quantitative estimates of convergence rates in applications to random matrices or quantum systems.
Similar analytic techniques could be adapted to other free probability transforms such as the S-transform.
Extending the method beyond polynomials to general measures might require generalizing the finite free Fourier transform relation.

Load-bearing premise

The key relation between the finite free Fourier transform and the Laplace transform holds, together with assumptions on the polynomial that permit the logarithmic potential and Legendre transform analysis.

What would settle it

Explicitly compute both the finite R-transform and the Voiculescu R-transform for a concrete sequence of polynomials, such as powers of (x - 1), and verify whether their difference tends to zero at rate 1/N for large degrees.

read the original abstract

We revisit Marcus' finite free analogue of Voiculescu $R$-transform from an analytic viewpoint. By relating the finite free Fourier transform to the Laplace transform, we study the finite $R$-transform through logarithmic potentials and Legendre transforms. Under suitable assumptions, we prove that the finite $R$-transform of a polynomial differs from the Voiculescu $R$-transform of its empirical root distribution by $O(N^{-1})$. As an application, we obtain an analytic proof of the convergence of finite free additive convolution to free additive convolution.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a clean analytic proof of O(N^{-1}) closeness for the finite R-transform on polynomials and uses it for convergence of finite free convolution, but the result sits on assumptions that stay vague.

read the letter

The core contribution is an analytic route to the finite R-transform via the Laplace transform, logarithmic potentials, and Legendre transforms. This yields an O(N^{-1}) bound between the finite version and the usual Voiculescu R-transform for the empirical roots of a degree-N polynomial, plus an analytic proof that finite free additive convolution converges to the free one. That is genuinely new compared with Marcus' earlier combinatorial construction, and the setup looks technically solid on its own terms. The authors do a straightforward job of importing the classical analysis tools and showing how they deliver the rate and the limit theorem as an application. No obvious circularity or invented objects appear. The main limitation is the repeated appeal to “suitable assumptions” on the polynomial or its root measure. The abstract never lists them, so it is unclear how restrictive they are or whether the O(N^{-1}) error survives for the natural families of polynomials that arise in random-matrix models. If the assumptions turn out to be narrow or require extra verification steps, the claimed rate and the convergence argument become conditional in a way that weakens the practical payoff. The paper is aimed at specialists in free probability who already know the combinatorial side and want an analytic alternative for limit theorems. A reader working on finite free convolutions or operator-algebra approximations would find the reframing useful. I would send it to peer review because the analytic viewpoint is fresh and the convergence application is concrete, even though the assumptions need to be made explicit and checked against typical examples in revision.

Referee Report

2 major / 1 minor

Summary. The manuscript develops an analytic framework for Marcus' finite R-transform by relating the finite free Fourier transform to the Laplace transform and analyzing the object via logarithmic potentials and Legendre transforms. Under suitable assumptions on the polynomial (or its root measure), the authors prove that the finite R-transform differs from the Voiculescu R-transform of the empirical root distribution by an error of order O(N^{-1}). As an application, they derive an analytic proof that finite free additive convolution converges to free additive convolution.

Significance. If the central O(N^{-1}) bound and the supporting derivations hold under assumptions that cover the natural sequences arising in free probability, the work would supply a useful analytic route to convergence results that have previously been obtained by combinatorial or algebraic methods. The explicit use of Legendre transforms and potential theory, if rigorously justified, could also facilitate further quantitative estimates in finite free probability.

major comments (2)

[Abstract and §1] Abstract and Introduction: The main theorem is stated only 'under suitable assumptions,' yet these assumptions are never enumerated or characterized in a single location. Because the O(N^{-1}) error term is derived from the Laplace-Legendre analysis, the precise scope of the result (and therefore the convergence application) cannot be verified without an explicit list of hypotheses on the polynomial or measure (e.g., support conditions, moment bounds, or analyticity requirements).
[Main theorem proof] Proof of the main approximation (likely §3 or §4): The key step relating the finite free Fourier transform to the Laplace transform is invoked to obtain the O(N^{-1}) bound via logarithmic potentials and Legendre transforms, but the manuscript provides no explicit error estimates or remainder terms for this relation. Without these quantitative controls, it is impossible to confirm that the claimed rate follows from the stated machinery rather than from additional implicit restrictions.

minor comments (1)

[§2] Notation for the finite free Fourier transform and its relation to the ordinary Laplace transform should be introduced with a clear comparison table or diagram to avoid confusion with the classical Voiculescu transforms.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. The comments highlight opportunities to improve clarity and rigor, which we will address in a revised version of the manuscript.

read point-by-point responses

Referee: [Abstract and §1] Abstract and Introduction: The main theorem is stated only 'under suitable assumptions,' yet these assumptions are never enumerated or characterized in a single location. Because the O(N^{-1}) error term is derived from the Laplace-Legendre analysis, the precise scope of the result (and therefore the convergence application) cannot be verified without an explicit list of hypotheses on the polynomial or measure (e.g., support conditions, moment bounds, or analyticity requirements).

Authors: We agree that a centralized enumeration of hypotheses will strengthen the presentation. In the revised manuscript we will insert a new subsection (immediately following the statement of the main theorem) that explicitly lists all standing assumptions on the polynomial and its empirical root measure. These will include: compact support contained in a fixed interval independent of N, uniform bounds on the first two moments, and the analyticity/regularity conditions on the logarithmic potential that are required for the Laplace-Legendre analysis to produce the claimed O(N^{-1}) remainder. The abstract and the theorem statement will be updated to refer directly to this list. revision: yes
Referee: [Main theorem proof] Proof of the main approximation (likely §3 or §4): The key step relating the finite free Fourier transform to the Laplace transform is invoked to obtain the O(N^{-1}) bound via logarithmic potentials and Legendre transforms, but the manuscript provides no explicit error estimates or remainder terms for this relation. Without these quantitative controls, it is impossible to confirm that the claimed rate follows from the stated machinery rather than from additional implicit restrictions.

Authors: We acknowledge that the error analysis for the finite-free-Fourier-to-Laplace relation can be made more transparent. While the derivation in Section 3 already contains the necessary estimates (via standard bounds on the difference between the empirical measure and its potential), the remainder terms are not isolated in a single lemma. In the revision we will add an auxiliary lemma (placed before the main approximation theorem) that states the precise O(N^{-1}) error for the Fourier-Laplace relation under the hypotheses listed in the new subsection. This will make the passage from the potential-theoretic representation to the O(N^{-1}) bound fully explicit and self-contained. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation uses independent standard analytic tools

full rationale

The paper relates the finite free Fourier transform to the Laplace transform (under suitable assumptions), then applies logarithmic potentials and Legendre transforms to obtain the O(N^{-1}) bound between finite and Voiculescu R-transforms. These are standard external mathematical objects whose properties do not depend on the finite R-transform result itself. No self-definitional equations, no parameters fitted to data then renamed as predictions, and no load-bearing self-citations appear in the derivation chain. The convergence application follows directly from the bound. The result is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard analytic tools and one domain-specific relation between transforms; no free parameters are fitted, no new entities are postulated, and the axioms invoked are background results from potential theory and free probability.

axioms (2)

domain assumption The finite free Fourier transform can be related to the Laplace transform under the paper's setting.
This relation is the starting point for the logarithmic potential and Legendre transform analysis.
standard math Standard properties of logarithmic potentials and Legendre transforms hold for the measures considered.
Invoked to compare the finite and classical R-transforms.

pith-pipeline@v0.9.0 · 5375 in / 1458 out tokens · 106045 ms · 2026-05-08T19:06:27.324784+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

Cost.FunctionalEquation / Foundation.LogicAsFunctionalEquation washburn_uniqueness_aczel (J-cost uniqueness) unclear
Under suitable assumptions, we prove that the finite R-transform of a polynomial differs from the Voiculescu R-transform of its empirical root distribution by O(N^{-1}).
Foundation.AlphaCoordinateFixation / Cost CostAlphaLog / IsHighCalibratedLog unclear
H_µ(z) = ∫ log(z − t) dµ(t); H*_µ(s) := inf_{x>0}{sx − H_µ(x)}; (H*)'(H'(x)) = x.
Foundation.ArithmeticFromLogic / Constants n/a (no φ-ladder or 8-tick structure invoked) unclear
R(N)_p(s) = −(1/N) d/ds log p̂(Ns); finite free cumulants κ(N)_n linearize finite free convolution.

Reference graph

Works this paper leans on

19 extracted references · 2 canonical work pages

[1]

Arizmendi, K

O. Arizmendi, K. Fujie, D. Perales, and Y. Ueda, S-transform in finite free probability,Adv. Math. 489(2026), 110803

2026
[2]

Arizmendi, J

O. Arizmendi, J. Garza-Vargas, and D. Perales, Finite free cumulants: Multiplicative convolutions, genus expansion and infinitesimal distributions,Trans. Amer. Math. Soc.376(2023), 4383–4420

2023
[3]

Arizmendi and D

O. Arizmendi and D. Perales, Cumulants for finite free convolution,J. Combin. Theory Ser. A155 (2018), 244–266

2018
[4]

Bercovici and D

H. Bercovici and D. Voiculescu, L´ evy-Hinˇ cin type theorems for multiplicative and additive free con- volution,Pacific J. Math.153(2) (1992), 217–248

1992
[5]

Bercovici and D

H. Bercovici and D. Voiculescu, Regularity questions for free convolution, in:Nonselfadjoint Op- erator Algebras, Operator Theory, and Related Topics: The Carl M. Pearcy Anniversary Volume, Birkh¨ auser, Basel, 1998, pp. 37–47

1998
[6]

Fujie, Regularity and convergence properties of finite free convolutions,Int

K. Fujie, Regularity and convergence properties of finite free convolutions,Int. J. Math.37(2) (2026), 2650010

2026
[7]

Finite free information inequalities, 2026

J. Garza-Vargas, N. Srivastava, and Z. Stier, Finite free information inequalities, arXiv:2602.15822 (2026)

work page arXiv 2026
[8]

A. W. Marcus, Polynomial convolutions and (finite) free probability, arXiv:2108.07054 (2021)

work page arXiv 2021
[9]

A. W. Marcus, D. A. Spielman, and N. Srivastava, Interlacing families I: Bipartite Ramanujan graphs of all degrees,Ann. of Math. (2)182(1) (2015), 307–325

2015
[10]

A. W. Marcus, D. A. Spielman, and N. Srivastava, Interlacing families II: Mixed characteristic polynomials and the Kadison–Singer problem,Ann. of Math. (2)182(1) (2015), 327–350. 15

2015
[11]

A. W. Marcus, D. A. Spielman, and N. Srivastava, Finite free convolutions of polynomials,Probab. Theory Related Fields182(3–4) (2022), 807–848

2022
[12]

Marden,Geometry of polynomials, 2nd edn., Amer

M. Marden,Geometry of polynomials, 2nd edn., Amer. Math. Soc. Colloq. Publ., vol. 3, American Mathematical Society, Providence, RI, 1966

1966
[13]

Mergny and M

P. Mergny and M. Potters, Rank one HCIZ at high temperature: interpolating between classical and free convolutions,SciPost Phys.12(2022), no. 1, 022

2022
[14]

J. A. Mingo and R. Speicher,Free probability and random matrices, Fields Institute Monographs, vol. 35, Springer, New York; Fields Institute for Research in Mathematical Sciences, Toronto, ON, 2017

2017
[15]

Nica and R

A. Nica and R. Speicher,Lectures on the Combinatorics of Free Probability Theory, London Mathe- matical Society Lecture Note Series, vol. 335, Cambridge University Press, Cambridge, 2006

2006
[16]

Szeg˝ o, Bemerkungen zu einem Satz von J

G. Szeg˝ o, Bemerkungen zu einem Satz von J. H. Grace ¨ uber die Wurzeln algebraischer Gleichungen, Math. Z.13(1) (1922), 28–55

1922
[17]

D. V. Voiculescu, Symmetries of some reduced free productC ∗-algebras, in:Operator algebras and their connections with topology and ergodic theory (Bu¸ steni, 1983), Lecture Notes in Math., vol. 1132, Springer, Berlin, 1985, pp. 556–588

1983
[18]

Voiculescu, Addition of certain noncommuting random variables,J

D. Voiculescu, Addition of certain noncommuting random variables,J. Funct. Anal.66(3) (1986), 323–346

1986
[19]

J. L. Walsh, On the location of the roots of certain types of polynomials,Trans. Amer. Math. Soc. 24(3) (1922), 163–180. Octavio Arizmendi Centro de Investigaci´ on en Matem´ aticas, Guanajuato, Gto. 36000, Mexico Email: octavius@cimat.mx Katsunori Fujie Department of Information Science and Technology, Aichi Prefectural University Nagakute, Aichi, 480-11...

1922