The Newton integral and the Stirling formula
Pith reviewed 2026-05-25 02:13 UTC · model grok-4.3
The pith
The Newton integral, defined as the difference of any primitive at the endpoints, suffices to derive the Stirling asymptotic formula for n!.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The Newton integral, defined as the difference of values of any primitive at the endpoints of the integration interval, is the logically simplest integral sufficient for deducing the Stirling asymptotic formula for n!. The author reviews in its framework in detail two derivations of the Stirling formula. The first approximates log(1)+log(2)+...+log(n) with an integral and the second uses the classical gamma function and a Fubini-type result. Two more integral representations of n! are mentioned.
What carries the argument
The Newton integral, defined as the difference of values of any primitive at the endpoints of the integration interval.
If this is right
- The sum of logarithms from 1 to n can be compared to an integral using solely the Newton definition.
- The gamma-function derivation of Stirling's formula, including the Fubini interchange, proceeds inside the same minimal framework.
- The Stirling asymptotic formula for n! follows directly from these two derivations.
- Two additional integral representations of n! are available that fit the Newton-integral setting.
Where Pith is reading between the lines
- The result indicates that the logical dependence of Stirling's formula on integration theory may be weaker than usually assumed.
- Similar minimal integral tools might suffice for other asymptotic formulas that currently invoke Riemann or Lebesgue integrals.
- The approach could be tested on related results such as the asymptotic expansion of the gamma function at positive integers.
Load-bearing premise
That both the sum-to-integral comparison and the gamma-function Fubini argument can be carried out completely inside the Newton-integral framework without extra analytic tools.
What would settle it
A concrete step in either reviewed derivation that cannot be justified using only the endpoint-difference definition of the integral and instead requires a property such as continuity of the integrand or dominated convergence that lies outside the Newton definition.
read the original abstract
We present details of logically simplest integral sufficient for deducing the Stirling asymptotic formula for n!. It is the Newton integral, defined as the difference of values of any primitive at the endpoints of the integration interval. We review in its framework in detail two derivations of the Stirling formula. The first approximates log(1)+log(2)+...+log(n) with an integral and the second uses the classical gamma function and a Fubini-type result. We mention two more integral representations of n!.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims that the Newton integral—defined strictly as the difference F(b)−F(a) for any primitive F—is the logically simplest integral sufficient to deduce the Stirling asymptotic formula for n!. It reviews two derivations in detail within this framework: one approximating ∑log k by an integral, and the second using the gamma-function integral representation of n! together with a Fubini-type interchange. Two further integral representations of n! are mentioned.
Significance. If the derivations can be executed using only the stated endpoint-difference definition, the paper would usefully isolate the minimal analytic content needed for Stirling’s formula and serve a pedagogical or foundational purpose. The explicit review of both derivations is a strength, but the overall significance is tempered by the expository character and the need to verify that no auxiliary convergence or interchange results are tacitly imported.
major comments (1)
- [Gamma function derivation] Gamma-function derivation (second reviewed proof): the Fubini-type interchange applied to the iterated integral representation of n! is invoked without explicit justification from the Newton-integral definition alone. The bare statement F(b)−F(a) does not entail the legitimacy of changing the order of integration; standard justifications (monotone convergence, uniform convergence, or Fubini for positive integrands) lie outside the given definition. This step is load-bearing for the central claim that both derivations remain strictly inside the Newton-integral framework.
minor comments (1)
- The abstract states that two additional integral representations of n! are mentioned; the manuscript should indicate whether these representations are also shown to be derivable from the Newton integral or are merely listed for context.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for isolating the key technical point concerning the gamma-function derivation. We address this comment directly below.
read point-by-point responses
-
Referee: Gamma-function derivation (second reviewed proof): the Fubini-type interchange applied to the iterated integral representation of n! is invoked without explicit justification from the Newton-integral definition alone. The bare statement F(b)−F(a) does not entail the legitimacy of changing the order of integration; standard justifications (monotone convergence, uniform convergence, or Fubini for positive integrands) lie outside the given definition. This step is load-bearing for the central claim that both derivations remain strictly inside the Newton-integral framework.
Authors: We agree that the endpoint-difference definition alone does not automatically authorize reordering of integrals. The manuscript already describes the step as employing 'a Fubini-type result,' thereby signaling that an additional principle is used. In revision we will supply an explicit, self-contained verification for the concrete iterated-integral representation appearing in the gamma-function argument. Because the relevant integrands are positive and continuous, the two iterated integrals can each be evaluated by finding explicit antiderivatives and applying the Newton definition at the endpoints; direct comparison of the resulting closed-form expressions then confirms equality without appeal to general convergence theorems. This keeps the argument elementary while making the additional step fully transparent. We will also adjust the surrounding prose to state precisely which minimal extra principle is required, thereby sharpening rather than weakening the paper's claim about the Newton integral as the principal analytic tool. revision: yes
Circularity Check
No circularity: expository review of standard derivations inside the stated Newton-integral definition.
full rationale
The paper defines the Newton integral explicitly as F(b)−F(a) for any primitive F and then reviews two known derivations of Stirling's formula (sum-to-integral comparison and gamma-function representation) inside that framework. No equations are fitted to data and then re-labeled as predictions; no self-citation chain is invoked to justify a uniqueness theorem or an ansatz; the Fubini-type step is presented as part of the reviewed argument rather than smuggled in by prior self-work. The central claim is therefore an assertion of sufficiency of a minimal definition, not a reduction of the target result to its own inputs by construction. The derivation chain remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Every continuous function on an interval possesses a primitive (antiderivative).
- domain assumption Fubini-type interchange is valid for the gamma-function representation.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
The Newton integral of f over (a,b) is the real number (N)∫_b^a f := F(b−)−F(a+) where F is on (a,b) primitive to f
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We review in its framework in detail two derivations of the Stirling formula. The first approximates ∑ log i with an integral and the second uses the classical gamma function and a Fubini-type result.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
N. G. de Bruijn, Asymptotic Methods in Analysis , North-Holland, Amsterdam, 1958
work page 1958
-
[2]
P. S. Bullen, Non-absolute integrals: a survey, Real Anal. Exchange 5 (1980), 195–259
work page 1980
-
[3]
P. S. Bullen, Nonabsolute integration in the twentieth c entury, American Math- ematical Society Special Session on Nonabsolute Integrati on, Toronto, 23–24 September, 2000 , 27 pages. http://www.emis.de/proceedings/Toronto2000/
work page 2000
-
[4]
A. J. Coleman, A simple proof of Stirling’s formula, The American Mathematical Monthly 58 (1951), 334–336
work page 1951
-
[5]
B. Conrad, Impossibility theorems for elementary integ ration, http://math.stanford.edu/~conrad/papers/elemint.pdf (downloaded in June 2019)
work page 2019
-
[6]
P. Diaconis and D. Freedman, An elementary proof of Stirl ing’s formula, The American Mathematical Monthly 93 (1986), 123–125
work page 1986
-
[7]
R. Dougherty and A. S. Kechris, The complexity of antidiff erentiation, Adv. in Mathem. 88 (1991), 145–169
work page 1991
-
[8]
G. P. Egorychev, Integral Representation and the Computation of Combinator ial Sums, AMS, Providence, RI, 1984
work page 1984
-
[9]
P. Flajolet and R. Sedgewick, Analytic Combinatorics , Cambridge University Press, Cambridge, 2009
work page 2009
-
[10]
Freiling, How to compute antiderivatives, Bull
Ch. Freiling, How to compute antiderivatives, Bull. Symb. Logic 1 (1995), 279– 316
work page 1995
-
[11]
Impens, Stirling’s series made easy, The American Mathematical Monthly 110 (2003), 730–735
C. Impens, Stirling’s series made easy, The American Mathematical Monthly 110 (2003), 730–735
work page 2003
-
[12]
G. J. O. Jameson, A simple proof of Stirling’s formula fo r the gamma function, Mathem. Gazette 99 (2015), 68–74
work page 2015
-
[13]
Jost, Postmodern Analysis, Springer, Berlin, 2005
J. Jost, Postmodern Analysis, Springer, Berlin, 2005
work page 2005
-
[14]
Complex derivatives are continuous - three self-contained proofs. Part 1
M. Klazar, Complex derivatives are continuous — three s elf-contained proofs. Part 1, arXiv:1707.07017v1, 2017, 22 pages. 23
work page internal anchor Pith review Pith/arXiv arXiv 2017
-
[15]
Lebesgue, Remarques sur la d´ efinition de l’int´ egra le, Bull
H. Lebesgue, Remarques sur la d´ efinition de l’int´ egra le, Bull. Sci. Math. 29 (1905), 272–275
work page 1905
-
[16]
Lou, A short proof of Stirling’s formula, arXiv:1312 .5019v1, 2013, 7 pages
H. Lou, A short proof of Stirling’s formula, arXiv:1312 .5019v1, 2013, 7 pages
work page 2013
-
[17]
B. D. McKay, The asymptotic numbers of regular tourname nts, eulerian digraphs and eulerian oriented graphs, Combinatorica 10 (1990), 367–377
work page 1990
-
[18]
F. A. Medvedev, Scenes from the History of Real Functions , Birkh¨ auser, Basel, 1991
work page 1991
-
[19]
R. Michel, The ( n+1)th proof of Stirling’s formula, The American Mathematical Monthly 115 (2008), 844–845
work page 2008
-
[20]
H. L. Montgomery and R. C. Vaughan, Multiplicative Number Theory. I. Classi- cal Theory, Cambridge University Press, Cambridge, 2007
work page 2007
-
[21]
M. R. Murty and K. Sampath, A very simple proof of Stirlin g’s formula, The Mathematics Student 84 (2015), 129–133
work page 2015
-
[22]
S. Niizeki and M. Araki, Simple and clear proofs of Stirl ing’s formula, Interna- tional Journal of Mathematical Education in Science and Tec hnology 41 (2010), 555–558
work page 2010
-
[23]
J. M. Patin, A very short proof of Stirling’s formula, The American Mathematical Monthly 96 (1989), 41–42
work page 1989
-
[24]
R. Pemantle and M. C. Wilson, Analytic Combinatorics in Several Variables , Cambridge University Press, Cambridge, 2013
work page 2013
-
[25]
I. Pinelis, An alternative to the Euler–Maclaurin summ ation formula: approxi- mating sums by integrals only, Numer. Mathem. 140 (2018), 755–790
work page 2018
-
[26]
F. Qi and B.-N. Guo, Integral representations of the Cat alan numbers and their applications, Mathematics 5 (3) (2017), 31 pages
work page 2017
-
[27]
M. R. Riedel, Egorychev method and the evaluation of bin omial coefficient sums, 2019, http://pnp.mathematik.uni-stuttgart.de/ iadm/Riedel/papers/egorychev.pdf (retrieved in April 2019)
work page 2019
-
[28]
Tao, 254A, Notes 0a: Stirling’s formula, 2010, https://terrytao
T. Tao, 254A, Notes 0a: Stirling’s formula, 2010, https://terrytao. wordpress.com/tag/stirlings-formula/ (retrieved in March 2019)
work page 2010
-
[29]
G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory , AMS, Providence, RI, 2015 (3rd extended edition)
work page 2015
-
[30]
B. S. Thomson, Theory of the Integral , 2013, http://classicalrealanalysis.info/com/Theory-of-the-Integral.php (re- trieved in April 2019)
work page 2013
-
[31]
B. S. Thomson, The Calculus Integral , 2010, http://classicalrealanalysis.info/com/ documents/T-C alculusIntegral-AllChapters-Portrait.pdf (retrieved in April 2019)
work page 2010
-
[32]
E. C. Titchmarsh, The Theory of the Riemann Zeta-function , Oxford University Press, Oxford, 1986 (2nd edition, revised by D. R. Heath-Bro wn)
work page 1986
-
[33]
V. S. Varadarajan, Euler Through Time: A New Look at Old Themes , AMS, Providence, RI, 2006
work page 2006
-
[34]
Vesel´ y, Z´ aklady matematick´ e anal´ yzy
J. Vesel´ y, Z´ aklady matematick´ e anal´ yzy. Druh´ y d ´ ıl, MATFYZPRESS, Praha, 2009 (in Czech). 24
work page 2009
-
[35]
J. Vesel´ y, Komplexn ´ ı anal´ yza pro uˇ citele, Univerzita Karlova v Praze – Nakla- datelstv ´ ı Karolinum, Praha, 2000 (in Czech)
work page 2000
-
[36]
Walker, Examples and Theorems in Analysis , Springer, Berlin, 2004
P. Walker, Examples and Theorems in Analysis , Springer, Berlin, 2004
work page 2004
-
[37]
Formalizing 100 Theorems, http://www.cs.ru.nl/~freek/100/ (retrieved in June 2019). Martin Klazar Department of Applied Mathematics Charles University, Faculty of Mathematics and Physics Malostransk´ e n´ amˇ est´ ı 25 11800 Praha Czechia klazar@kam.mff.cuni.cz 25
work page 2019
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.