{"id":"399fea57-5f65-40d7-b4db-3e9745be273b","arxiv_id":"2505.05984","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A new moment-based proof shows the distribution of free positive multiplicative Brownian motion equals the exponential of a free additive convolution of a semicircle and a uniform law, yielding new Stirling and hypergeometric formulas.","lead":"This paper gives a new proof of a known formula that expresses the free positive multiplicative Brownian motion's distribution as the exponential image of a free additive convolution of a semicircle and a uniform distribution. The new proof computes explicit moment formulas and yields new hypergeometric integral formulas for that distribution.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"The reader correctly identifies Lemma 2.3 as the weakest point of the proof: Theorem 1.2 is derived from it by induction, and the lemma itself is proved by a long Egorychev contour computation that is not machine-checked. In good faith, I checked the structure of that computation. The algebra of the induction is internally consistent: applying Lemma 2.3 with m=k and ℓ=n−k yields exactly the factor 2(n−k)/(1+k) needed to cancel to n!/(k!(1+k)!)·s(1+k,n+1−k). The lemma's proof, despite two display-level transcription issues, is mathematically coherent: the true beta integral with shifted exponents gives the inverse binomial coefficient used, and the 'vanishing' of the j≥2 terms is justified by the log^j cancellation at x=y, not by the misprinted auxiliary integral. Direct small-case evaluation of Lemma 2.3 (ℓ=3,m=4) matches the 2ℓ form and rules out the 2^ℓ misreading, which would otherwise break the induction for n−k≥3. The external agreement with Biane's known moments provides independent corroboration that the moment formula is correct. Since no load-bearing error or unjustified assumption was found, the reader's ACCEPT verdict should stand unchanged; confidence may remain moderate because the Egorychev computation is not formalized, but that is a verification gap, not a correctness objection.","tokens_in":10667,"tokens_out":40838,"duration_ms":346322,"concrete_test":"Evaluate both sides of Lemma 2.3 exactly with rational arithmetic for all 1≤ℓ,m≤12, and independently recompute the coefficients c(n,k) generated by the induction in Theorem 1.2 for n≤12, comparing against the closed form n!/(k!(1+k)!)·s(1+k,n+1−k); any mismatch would invalidate the proof, while full agreement would confirm the delicate combinatorial step.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on Lemma 2.3, a delicate double-sum identity for Stirling numbers, and the printed proof contains two small display-level inaccuracies: the beta-integral identity is stated with exponents n,k instead of n-1,k-1, and the contour equality for j≥2 is written with an auxiliary integral that is not zero, although the preceding integral is zero because log^j((1+x)/(1+y)) cancels the pole at x=y. Neither inaccuracy enters the subsequent algebra. The intended identity is 2ℓ·s(1+m,1+ℓ), not 2^ℓ·s(1+m,1+ℓ); this is confirmed by direct evaluation (e.g. ℓ=3,m=4 gives -60 on both sides) and by the induction step in Theorem 1.2, where the factor 2(n−k) cancels exactly. The remaining contour and series interchanges are standard Egorychev maneuvers, and the resulting moment formula is externally consistent with Biane's moments (1.3). I therefore find no load-bearing gap in the central claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper gives a new, moment-based proof of the exponential representation ν_t = exp(µ_{sc,2√t} ⊞ Unif[-t/2,t/2]) for the free positive multiplicative Brownian motion. The main technical result is Theorem 1.2, a closed formula for the moments m_n(t) of µ_{sc,2√t} ⊞ Unif[-t,0] in terms of signed Stirling numbers of the first kind. The proof combines a free stochastic calculus recursion for the moments (Lemma 2.2) with a new combinatorial identity for Stirling numbers (Lemma 2.3) proved by Egorychev's contour method. From the moment formula the author derives the generating function of e^{αx} as Kummer's 1F1, which is compared with Biane's known Laguerre formula for the moments of ν_t; this yields Theorem 1.1 and the fractional-moment extension in Corollary 1.3.","tokens_in":975,"tokens_out":1213,"duration_ms":148908,"significance":"The result is significant because it supplies a self-contained proof of Theorem 1.1 that avoids the random-matrix eigenvalue argument of the original proof and reduces the statement to an explicit, checkable moment identity. The moment formula in Theorem 1.2 is of independent interest for the free additive convolution of a semicircle with a uniform law, and Corollary 1.3 generalizes Biane's Laguerre moment formula to all complex orders. The proof is detailed and honest about its technical core: Lemma 2.3 is proved in full via Egorychev's method, and the final moment generating function is externally consistent with the known formula (1.3). The contour and series interchanges in the proof of Lemma 2.3 are standard Egorychev maneuvers and appear justified on the chosen contours. I find no load-bearing gap in the central claim.","major_comments":[],"minor_comments":[{"comment":"The prefactor in (2.2) should be made unambiguous: the proof and the induction in Theorem 1.2 use the factor 2ℓ (two times ℓ), not 2^ℓ; as typeset, '2ls' invites the false reading 2^ℓ, which would make the identity incorrect.","section":"Lemma 2.3"},{"comment":"The beta-integral identity displayed before (2.3) is misstated for the exponents n,k in N0: the integral ∫_0^1 t^n(1-t)^k dt is not 1/(n+k-1) times the inverse binomial coefficient (n+k choose n). The later application uses exponents n+k-1 and l+m-1-n-k, for which the evaluation 1/(l+m-1) times the inverse binomial coefficient (l+m-2 choose n+k-1) is correct; the auxiliary identity should be corrected or removed.","section":"Proof of Lemma 2.3"},{"comment":"In the argument showing that the contour integrals for j≥2 vanish, the displayed equality involving (x+y)^(j-2) and x^(-j) appears to assert a false auxiliary integral; the preceding integral is nevertheless zero because log^j((1+x)/(1+y)) cancels the pole at x=y. Please correct the display or supply the intended substitution.","section":"Proof of Lemma 2.3"},{"comment":"The symbol ℓ is typeset as 'l' in many displays, making it hard to distinguish from the digit 1 and from the index l; using a distinct symbol would improve readability.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Martin Auer's paper re-proves a theorem he already proved with Voit ([1])—Theorem 1.1, the exponential-image representation of free positive multiplicative Brownian motion—but it earns its keep with two concrete new formulas. Theorem 1.2 gives a closed Stirling-number expression for moments of μ_sc,2√t ⊞ Unif[-t,0], and Corollary 1.3 turns that into a Kummer hypergeometric integral formula for fractional moments of ν_t, generalizing Biane's Laguerre expression. These are exactly the kind of formulas you want when these measures show up in computation.\n\nThe proof is essentially self-contained and honest. Lemma 2.2 imports a standard free-stochastic-calculus result; the main free work is Lemma 2.3, a double-sum Stirling identity, proved via Egorychev contours. The final moment formula matches Biane's independent moment formula (1.3), which is a solid external check. I do not see a circularity problem: the self-citation is to the original theorem, and the new derivation does not rely on it.\n\nSoft spots, in proportion: the printed proof contains a handful of display-level inaccuracies. The beta-integral identity in Lemma 2.3's proof uses exponents n,k rather than n-1,k-1; the contour equality for j≥2 is written with a contribution that actually vanishes differently than the text claims; and the factor in (2.2) should be 2ℓ, not 2^ℓ. These are typos, not gaps—the intended identity evaluates correctly (e.g., ℓ=3,m=4 matches) and the induction in Theorem 1.2 uses the factor exactly as 2ℓ. A referee should ask for corrections before publication. The only other thing I would note is scope: this is not a breakthrough theorem; it is a careful, useful computation.\n\nThis is for free probabilists, random matrix people who need explicit moments of semicircle-uniform free convolutions, and combinatorics buffs who like Egorychev-style derivations. A serious referee should engage with it; I would send it out.","headline":"Careful re-proof of a known theorem plus two genuinely new moment formulas; the delicate combinatorial identity holds up despite minor display typos.","tokens_in":11400,"tokens_out":2718,"would_cite":true,"duration_ms":25587,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["46L54","60B20","60E10","05A19","33C15"],"pacs":[],"model":"deepseek-v4-flash","headline":"A new moment formula proves the free Brownian exponential law","keywords":["free multiplicative Brownian motion","free additive convolution","semicircle distribution","uniform distribution","moments","Stirling numbers of the first kind","Egorychev method","fractional moments"],"falsifier":"Evaluate both sides of Lemma 2.3 for small values such as $l=2$, $m=4$ with tabulated Stirling numbers; any mismatch refutes the identity and therefore Theorem 1.2. A weaker check is to plug the Theorem 1.2 formula into Biane's moment identity (1.3) for $n=3,4,5$ and several $t$; if the two sides disagree, the claimed proof of Theorem 1.1 fails.","tokens_in":10484,"feed_emoji":"🧮","tokens_out":5883,"duration_ms":58283,"temperature":0.7,"pith_summary":"This paper proves a closed-form formula for the moments of the free additive convolution of a semicircle and a uniform distribution: for $\\mu_{\\mathrm{sc},2\\sqrt{t}} \\boxplus \\mathrm{Unif}[-t,0]$, the $n$-th moment is $m_n(t) = n! \\sum_{j=\\lceil n/2\\rceil}^{n} \\frac{t^j}{j!(1+j)!} s(1+j,n+1-j)$, where $s$ are the signed Stirling numbers of the first kind. From this formula the author gives a new proof of the known representation of the free positive multiplicative Brownian motion $\\nu_t$ as the exponential image of a free additive convolution, and he derives a new fractional-moment formula for $\\nu_t$. The proof works by establishing a time-inhomogeneous differential recursion for the moments and a separate combinatorial identity, proved by contour integration, that closes the recursion. A sympathetic reader should read this as a proof-by-moments of the exponential image theorem, not a numerical or heuristic confirmation.","feed_headline":"New moment formula proves the free Brownian exponential law","feed_subtitle":"Closed-form moments of a semicircle–uniform convolution identify the law of free positive multiplicative Brownian motion.","key_machinery":"The argument is carried by two lemmas. Lemma 2.2 records that $m_n(t)$ satisfies the recursion $m_n'(t) = n\\bigl(t^{-1}m_n(t) - \\tfrac12\\sum_{j=0}^{n-2} m_j(t)m_{n-2-j}(t)\\bigr)$, obtained from the free Itô formula for a semicircular Brownian motion plus a freely independent uniform element; this turns the moment sequence into a recursively determined polynomial with known leading coefficient. Lemma 2.3 is the load-bearing combinatorial identity: for all $l,m\\in\\mathbb{N}$, $2^l s(1+m,1+l)$ equals a double sum over $n,k$ of products of Stirling numbers and binomial coefficients, one of them inverted. The identity is proved by Egorychev's method, a technique that evaluates combinatorial sums by writing coefficients as contour integrals, and evaluated with Kummer's confluent hypergeometric function; it supplies exactly the coefficient comparison that closes the induction proving Theorem 1.2.","core_discovery":"The paper's central claim is Theorem 1.2: for every integer $n \\ge 0$ and $t > 0$, the $n$-th moment of $\\mu_{\\mathrm{sc},2\\sqrt{t}} \\boxplus \\mathrm{Unif}[-t,0]$ equals $n! \\sum_{j=\\lceil n/2\\rceil}^{n} \\frac{t^j}{j!(1+j)!} s(1+j,n+1-j)$. The author then shows that this moment formula is exactly what is needed to identify $\\exp(\\mu_{\\mathrm{sc},2\\sqrt{t}} \\boxplus \\mathrm{Unif}[-t/2,t/2])$ with the law $\\nu_t$ of the free positive multiplicative Brownian motion: comparing the exponential generating function of these moments with Biane's known moments of $\\nu_t$ forces equality of compactly supported measures, and the same calculation yields the fractional moment identity $\\int_{(0,\\infty)} x^\\alpha\\,d\\nu_t = e^{\\alpha t/2} {}_1F_1(1-\\alpha;2;-\\alpha t)$ for $\\alpha \\in \\mathbb{C}\\setminus\\{0\\}$.","pith_inferences":["The coefficient identity in Lemma 2.3 looks like one member of a family: replacing the inverted binomial coefficient by another kernel in Egorychev's method could yield closed-form moments for free additive convolutions of other distributions, such as two semicircles or Marchenko–Pastur with uniform.","The fractional moment formula analytically continues in $\\alpha$; one could test whether the Mellin transform $\\alpha \\mapsto e^{\\alpha t/2}{}_1F_1(1-\\alpha;2;-\\alpha t)$ satisfies the free multiplicative semigroup property $\\nu_s \\boxtimes \\nu_t = \\nu_{s+t}$ directly, without passing through the integer moments.","The differential recursion in Lemma 2.2 is a closed recursion for the full polynomial $m_n(t)$, so it might give a direct route to the support or density of the convolution that bypasses the combinatorial identity altogether."],"forward_implications":["Theorem 1.1 follows: $\\nu_t = \\exp(\\mu_{\\mathrm{sc},2\\sqrt{t}} \\boxplus \\mathrm{Unif}[-t/2,t/2])$ for all $t>0$, so the free positive multiplicative Brownian motion is recovered from a free additive convolution followed by the exponential map.","Corollary 1.3 gives the fractional moments $\\int_{(0,\\infty)} x^\\alpha\\,d\\nu_t = e^{\\alpha t/2} {}_1F_1(1-\\alpha;2;-\\alpha t)$, generalizing the earlier integer-moment formulas involving Laguerre polynomials.","Remark 2.1 extends the moment formula to arbitrary $\\mu_{\\mathrm{sc},a} \\boxplus \\mathrm{Unif}[b,c]$ by scaling and a shift by a Dirac mass.","Because compactly supported measures are determined by their moments, the new calculation gives a self-contained, moment-based proof of the exponential image representation, conditional only on the combinatorial identity.","The same two-lemma structure may serve as a template for moment computations of other free additive convolutions with a semicircular component."],"supporting_citations":[{"why":"Auer and Voit 2025 supplies the theorem being reproved: the exponential image representation of $\\nu_t$.","marker":"[1]"},{"why":"Biane 1997 supplies the known Laguerre moments (1.3) of $\\nu_t$ used to identify the measures in the proof of Theorem 1.1.","marker":"[2]"},{"why":"Egorychev 1984 is the source of the contour-integral method for combinatorial sums used to prove Lemma 2.3.","marker":"[5]"},{"why":"Kemp 2016 establishes the large-$N$ limit of Brownian motion on $\\mathrm{GL}(N,\\mathbb{C})$, connecting the matrix process to the free multiplicative Brownian motion.","marker":"[8]"},{"why":"Nikitopoulos 2022 provides the free Itô formula used to derive the moment recursion in Lemma 2.2.","marker":"[10]"},{"why":"Riedel and Mahmoud 2023 is the modern exposition of the Egorychev coefficient-extraction technique applied in the proof of Lemma 2.3.","marker":"[11]"}],"fun_headline_variants":["Semicircle–uniform moments prove free Brownian law","Closed-form moments solve free multiplicative Brownian","Explicit moments identify free positive Brownian law","New moment formula for free positive Brownian motion","Moment proof unveils free multiplicative Brownian law"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is Lemma 2.3: the double-sum identity with Stirling numbers and an inverted binomial coefficient is correct, and every interchange of an infinite sum with a contour integral in its proof is valid.","fun_headline_variants_meta":{"raw":{"variants":["Semicircle–uniform moments prove free Brownian law","Closed-form moments solve free multiplicative Brownian","Explicit moments identify free positive Brownian law","New moment formula for free positive Brownian motion","Moment proof unveils free multiplicative Brownian law"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001105,"raw_usage":{"total_tokens":4651,"prompt_tokens":1032,"completion_tokens":3619,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":648,"completion_tokens_details":{"reasoning_tokens":3546}},"tokens_in":648,"tokens_out":3619,"duration_ms":25240,"temperature":1.0,"reasoning_tokens":3546,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T22:51:47.500748+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate both sides of Lemma 2.3 for small values such as $l=2$, $m=4$ with tabulated Stirling numbers; any mismatch refutes the identity and therefore Theorem 1.2. A weaker check is to plug the Theorem 1.2 formula into Biane's moment identity (1.3) for $n=3,4,5$ and several $t$; if the two sides disagree, the claimed proof of Theorem 1.1 fails.","supporting_citations":[{"cited_title":"An explicit formula for free multiplicative Brownian motions via spherical functions","cited_arxiv_id":null,"evidence_quote":"Auer and Voit 2025 supplies the theorem being reproved: the exponential image representation of $\\nu_t$."},{"cited_title":"Free Brownian motion, free stochastic calculus, and random matrices","cited_arxiv_id":null,"evidence_quote":"Biane 1997 supplies the known Laguerre moments (1.3) of $\\nu_t$ used to identify the measures in the proof of Theorem 1.1."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Egorychev 1984 is the source of the contour-integral method for combinatorial sums used to prove Lemma 2.3."},{"cited_title":"The large- N limits of Brownian motions on GLN","cited_arxiv_id":null,"evidence_quote":"Kemp 2016 establishes the large-$N$ limit of Brownian motion on $\\mathrm{GL}(N,\\mathbb{C})$, connecting the matrix process to the free multiplicative Brownian motion."},{"cited_title":"Itˆ o’s formula for noncommutative C 2 functions of free Itˆ o processes","cited_arxiv_id":null,"evidence_quote":"Nikitopoulos 2022 provides the free Itô formula used to derive the moment recursion in Lemma 2.2."},{"cited_title":"Egorychev Method: A Hidden Treasure","cited_arxiv_id":null,"evidence_quote":"Riedel and Mahmoud 2023 is the modern exposition of the Egorychev coefficient-extraction technique applied in the proof of Lemma 2.3."}],"review_version":1}