Draft:R-Transform
| Review waiting, please be patient.
This may take 6 weeks or more, since drafts are reviewed in no specific order. There are 1,054 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
| Submission declined on 13 November 2025 by Aesurias (talk). This draft's references do not show that the subject qualifies for a Wikipedia article. In summary, the draft needs multiple published sources that are:
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
This draft has been resubmitted and is currently awaiting re-review. |
In free probability, the R-transform is an analytical tool used to characterize and study the distributions of non-commutative random variables. It serves as the free analogue of the cumulant generating function from classical probability, playing a role analogous to the logarithm of the Fourier transform. Its usefulness lies in simplifying the computation of the free additive convolution of two distributions due to its nice additivity property: for freely independent random variables and , the R-transform satisfies .
Definition
[edit]Let be a non-commutative probability space, i.e. a unital algebra over equipped with a unital linear functional . For we define a's R-transform as a formal power series:
where represent 's free cumulants. indeed characterizes 's (non-commutative) distribution: 's distribution is given (by definition) by its moments , or, equivalently, its (formal) moment series . By the moment-cumulant formula[1], 's moments uniquely determine 's free cumulants and vice versa, meaning 's distribution can be given by the collection , or, equivalently, a formal series such as .
Analyticity
[edit]Under certain conditions, the R-transform can be shown to be analytic on a domain. The following discussion will be limited to the case of an element in a *-probability space , i.e. a non-commutative probability space such that is a *-algebra and is positive ( ), where has the additional constraints of being self-adjoint with exponentially bounded moments: . One can show that for such there is a uniquely determined compactly supported probability measure on with moments :
meaning 's distribution can be given by the measure , an analytic object. In particular, has compact support, meaning its Cauchy transform (or minus the Stieltjes transform) can be expressed as a convergent power series in a neighborhood of infinity:[2]
where is 's moment series, which, by this equation, is seen to be analytic in a neighborhood of 0. Using the moment-cumulant formula.[1], one can show where is 's cumulant series. By these series relations we obtain , meaning satisfies and thus also (at least formally). Writing links the (formally defined) R-transform to the analytic . One can indeed show, using Rouché's theorem, that has an analytic series expansion in a neighborhood of [2]
Application to Free Convolution
[edit]For a compactly supported measure , we can take the polynomial algebra , and define an involution , as well as a unital linear functional:
for every polynomial . is clearly positive, thus, is a self-adjoint element of a -probability space with exponentially bounded moments. Thus, for every compactly supported probability measure on there is a self-adjoint element in a -probability space, such that the measure satisfying (1) and (2) at the beginning of the section coincides with . It is noteworthy that, as a result, one can go from self-adjoint elements to compactly supported probability measures and vice versa. In particular, for two such measures , we can find a -probability space with free self-adjoint elements corresponding to , respectively (for instance, one can use the method above to obtain -probability spaces and self-adjoints within them corresponding to , then one may simply take to be the unital algebra free product of these spaces). Using freeness, it is easy to show that 's moments are exponentially bounded, meaning there exists a unique corresponding compactly supported probability measure , the measure obtained by the free convolution of . Note that this measure does not depend on the choice of .
For free elements , we have that their mixed cumulants vanish[2], yielding the most useful property of the R-transform:
since 's coefficients are just . Using this property and the connection to the Cauchy transform, the following recipe for is obtained:
- Calculate the Cauchy transforms
- Solve for (using )
- Solve for (using )
- Additivity of cumulants yields
- Reverse the process to obtain
- Apply the Stieltjes inversion formula
Whereby in the last bullet point, note that a probability measure on satisfies the assumptions to guarantee the Stieltjes inversion:
General Case
[edit]This discussion can be extended to a more general setting (for instance, with a corresponding measure of unbounded support; see, for instance[3]).
Example
[edit]Using the recipe from the section above, may be calculated for for [4]. First, the Cauchy transform can be evaluated as . Using the second step, one obtains . Subtracting yields where one notes allows for the rejection of the negative square root solution . Multiply by two to obtain , add to obtain , and use to conclude . Apply the Stieltjes Inversion Formula to see that is a "semicircular distribution" (actually the standard semicircular distribution, characterized by having variance 1) with density:
In particular, from the example above, one observes that the free convolution of two discrete distributions yields a continuous one. If one "translates" this statement into the classical setting—there exist independent discrete random variables (finite range), whose sum yields a continuous random variable distributed according to the standard Gaussian (uncountable range)—one soon sees the infeasibility in the classical case (note that the semicircular distribution is in many ways the "free analog" of the classical Gaussian distribution). This can be viewed as an instance of the stark difference between commutative and non-commutative probability settings.
References
[edit]- ^ a b Speicher, Roland (2019). "Lecture Notes on "Free Probability Theory"". arXiv:1908.08125 [math.PR].
- ^ a b c Mingo, James A.; Speicher, Roland (2017). Free Probability and Random Matrices. Fields Institute Monographs. Vol. 35. New York: Springer. doi:10.1007/978-1-4939-6942-5. ISBN 978-1-4939-6941-8.
- ^ Voiculescu, Dan; Bercovici, Hari (1993). "Free Convolution of Measures with Unbounded Support". Indiana University Mathematics Journal. 42 (3): 733–773. doi:10.1512/iumj.1993.42.42033. JSTOR 24897118.
- ^ Zeitouni, Ofer; Anderson, Greg W.; Guionnet, Alice. An Introduction to Random Matrices (PDF).
- Voiculescu, Dan V.; Dykema, Kenneth J.; Nica, Alexandru (1992). Free Random Variables. American Mathematical Society. ISBN 978-0-8218-1140-5.


- Promotional tone, editorializing and other words to watch
- Vague, generic, and speculative statements extrapolated from similar subjects
- Essay-like writing
- Hallucinations (plausible-sounding, but false information) and non-existent references
- Close paraphrasing
Please address these issues. The best way is usually to read reliable sources and summarize them, instead of using a large language model. See our help page on large language models.