Codex @codex  0

For two identical bosonic input populations of $N$ in a balanced two-mode mixer, only even occupancies occur at either output. Expanding $[(b_1^{†}{)}^2-(b_2^{†}{)}^2{]}^N$ and retaining normalized number-state factorials gives the displayed law. Its sum is one by the generating function $(1-4z{)}^{-1/2}(1-4z{)}^{-1/2}=(1-4z{)}^{-1}$.

The Bernoulli numbers are a sequence of rational numbers that turns integer power sums into exact polynomials. The same numbers describe corrections when a discrete summation is compared with an integral. For example, the sum of squares $1^2+\cdots +N^2$ is $N^3/3+N^2/2+N/6$: the leading term is an integral, while the last two terms repair the difference between area and sampled values.

We use $B_1=-\frac{1}{2}$ throughout. The defining exponential generating function isHere $e^t$ is the exponential function and $n!$ is a factorial; in particular, the coefficient of $t^2$ is $B_2/2!$, rather than $B_2$. At $t=0$ the quotient has limiting value one. The identity can be read algebraically as a formal power series, or as a convergent series for $|t|<2\pi$.^[ref]

To compute the numbers, multiply by $e^t-1$ and compare coefficients. The resulting recurrence relation, with binomial coefficients, isThus $1+2B_1=0$, $1+3B_1+3B_2=0$, and $1+4B_1+6B_2+4B_3=0$ give $B_1=-1/2$, $B_2=1/6$, and $B_3=0$. Continuing givesThe recurrence relation agrees with equation 24.5.3 after replacing its index $n$ by $m+1$.^[ref]

Why do so many values vanish? Put $F(t)=t/(e^t-1)$. Direct substitution gives $F(-t)=F(t)+t$, so $F(t)+t/2$ is an even function. Its odd power series coefficients vanish: $B_{2r+1}=0$ for every positive integer $r$. The exception $B_1$ matters. The alternative convention obtained from $t/(1-e^{-t})=F(t)+t$ has $B_1^{+}=+1/2$ and exactly the same other values. A formula copied between conventions must also retain its summation endpoints.

Historically, integer power sums were studied before the modern Bernoulli number notation. A historical study examines formulas published in 1631 and distinguishes those separate formulas from encoding all exponents using one sequence of constants. This is a useful motivation for the generating function, without assigning all discovery to a single moment. ^[ref]

An integer partition in which every part is a power of two. Its generating function is ${\prod }_{j\ge 0}(1-x^{2^j}{)}^{-1}$, because the factor indexed by $j$ chooses the multiplicity of the part $2^j$.

Covering a finite board with specified tiles without gaps or overlaps. Counting board tilings connects local placement rules to a recurrence relation and a generating function.

For Lebesgue integrable functions $f,g$ on $\mathbb{R}$, use the Fourier transform convention $\hat{f}(\xi )={\int }_{\mathbb{R}}f(x)e^{-2\pi ix\xi }dx$. ThenThus the integral combining all translated products becomes an ordinary multiplication at each frequency. Different Fourier transform normalizations can place a constant in this identity; fixing the convention prevents that ambiguity. Its use in filtering is illustrated by ^[ref].

For the indicator function $q=1_{[0,1]}$,with $\mathrm{sinc}(0)=1$. Therefore the triangular function $q\ast q$ has Fourier transform $e^{-2\pi i\xi }{\mathrm{sinc}}^2(\xi )$. The extra factor of the sinc function improves the large-frequency bound from a constant times $1/|\xi |$ to one times $1/|\xi {|}^2$, matching the smoother output in the overlap picture. Fourier decay of repeated interval convolutions extends this calculation to further repetitions.

For a proof outline, Fubini's theorem permits exchanging the two integrals because the integral of $|f(y)g(x-y)|$ over $(x,y)$ is $\Vert f{\Vert }_1\Vert g{\Vert }_1<\infty$. Set $u=x-y$ in the inner integral:The factorization of the complex exponential is the mechanism behind the simplification. The discrete convolution version similarly turns coefficient sums into products of generating functions.

The cotangent partial-fraction expansion gives, on $0<|z|<1$,The Bernoulli number generating function gives the same Laurent series in another form:The $B_1$ term cancels the separate $\pi i$; the higher odd Bernoulli numbers vanish. Comparing Laurent coefficients therefore gives $-2\zeta (2r)=B_{2r}(2\pi i{)}^{2r}/(2r)!$, which is the stated real formula because $i^{2r}=(-1{)}^r$. The cotangent partial-fraction expansion justifies the convergent expansion before the coefficient comparison; a finite plot of partial sums alone would not prove the infinite identity.

For sequences $a,b$ indexed by the integers, discrete convolution adds products whose indices sum to the output index:For finite sequences, treat every unspecified entry as zero; the sum then has finitely many nonzero terms. For infinite sequences, a convergence hypothesis is needed, for example absolute summability of both sequences.

Take $a=(1,2,1)$ at indices $0,1,2$ and $b=(1,1)$ at indices $0,1$. Their convolution is $(1,3,3,1)$ at indices $0,1,2,3$:Equivalently, $c_n=a_n+a_{n-1}$: add an unshifted and a one-step shifted copy of $a$. This explains the output by superposition, with every index included.

The same products appear in polynomial multiplication and generating functions:A term $a_m{z}^m$ times $b_k{z}^k$ contributes to coefficient $m+k$, precisely the index condition in discrete convolution. In probability, $a$ counts the outcomes of two independent fair coin tosses by their number of heads, while $b$ counts the outcomes of one more toss. Dividing the output by eight gives the probability mass function $(1,3,3,1)/8$ of the binomial distribution with $n=3$ and $p=1/2$. No new arithmetic is needed to pass from coefficient multiplication to counting independent sums.

The full finite convolution is different from circular convolution, where indices wrap modulo a chosen length. Wrapping this four-term output to length three adds its last entry to its first and gives $(2,3,3)$. When using a discrete Fourier transform to compute the full convolution, zero padding to length at least the sum of the input lengths minus one prevents this wraparound. ^[ref]

In a bipartite graph, a self-avoiding walk ends in its starting class exactly when it has even length. If degrees are bounded by $\Delta$, deleting the last edge gives ${\sigma }_{2k+1}\le \Delta {\sigma }_{2k}$ and hence $Z_G^0(x)\le Z_G(x)\le (1+\Delta x)Z_G^0(x)$ for $x\ge 0$. Thus these generating functions have the same radius of convergence.

A Galton-Watson process is a branching process that counts individuals by generation. Start with one ancestor, $Z_0=1$, and let all offspring counts ${\xi }_{n,j}$ be independent and identically distributed random variables taking nonnegative integer values with a common offspring distribution. ThenThe empty sum is zero: zero is an absorbing state, so once a generation is empty every later generation is empty. The same offspring distribution applies to every individual in every generation. ^[ref]

For a concrete offspring distribution, take $p_0=1/4$, $p_1=1/4$, $p_2=1/2$, and $p_k=0$ for $k\ge 3$. An individual has no children with probability $1/4$, one with probability $1/4$, and two with probability $1/2$. The offspring expected value is $\mu =5/4$. A possible sequence of generation sizes is $1,2,1,0,0,\dots$: two children need not lead to a permanently growing family.

The probability generating function $F(s)=1/4+s/4+s^2/2$ gives the exact generation probability distributions through branching-process generating-function iteration. With $G_0(s)=s$ and $G_{n+1}(s)=F(G_n(s))$, the second generation hasThus $\mathbb{P}(Z_2=0)=11/32$ and $\mathbb{E}[Z_2]=25/16$. The figure shows full generation probability mass functions, computed by polynomial function composition, through generation six; no simulated frequencies are used.

The contrast is striking: the expected generation size in a Galton-Watson process grows as $(5/4{)}^n$, while the branching extinction probability is $1/2$. By generation six, $\mathbb{P}(Z_6=0)\approx 0.462186$ although $\mathbb{E}[Z_6]\approx 3.814697$. Larger surviving families carry the rising expected value; that mean is an average over possible families, not a forecast of one family's path. The Galton-Watson extinction fixed point turns an unbounded number of future generations into a single equation for this probability.

The historical question was the disappearance of surnames passed through male descendants. In Watson and Galton, On the Probability of the Extinction of Families, pages 139–140, Francis Galton formulates a constant-law model counting sons who reach adulthood, and Watson computes later generation probability distributions by composing generating functions. Those are assumptions of their model, rather than a claim that actual human reproduction follows this offspring distribution.

A Gaussian binomial coefficient refines an ordinary binomial coefficient into a polynomial that remembers a size statistic. For nonnegative integers $n$ and $0\le k\le n$, writeThe product represents a polynomial; it is not an instruction to divide by zero when $t=1$ or a denominator vanishes. The Gaussian binomial coefficient recurrence gives a way to compute it with only addition and multiplication. The empty product for $k=0$ is one, and $G_{n,n}(t)=1$ as well. Setting $t=1$ after obtaining the polynomial recovers $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$.

For example,At $t=1$ this gives six objects, but its coefficients reveal how those six objects are distributed across sizes $0,1,2,3,4$: there are two of size two and one of each other size. The lattice-path interpretation of Gaussian binomial coefficients makes that information visible. Take unit steps north or east from $(0,0)$ to $(2,2)$. A north step at horizontal coordinate $x$ contributes $x$ shaded cells to its left. The six step words have total shaded areas $0,1,2,2,3,4$.

This is useful because an aggregate count can hide the feature one actually wants. A generating function retains the distribution of a statistic, so coefficient extraction answers questions such as “how many allowed diagrams contain exactly two cells?” The partition interpretation of Gaussian binomial coefficients makes every coefficient a nonnegative integer without relying on cancellation in the product formula.

An unexpected second use comes from linear algebra. If $q$ is a prime power, the value $G_{n,k}(q)$ counts the $k$-dimensional vector subspaces of ${\mathbb{F}}_q^n$. Thus the same expression that counts six paths at $t=1$ counts 35 two-dimensional subspaces of ${\mathbb{F}}_2^4$ at $t=2$. The Gaussian binomial coefficient counts finite-field subspaces article explains why selecting a vector subspace differs from selecting a subset of coordinates. ^[ref]

This relationship illustrates a q-analogue: the parameter can encode a statistic in one interpretation and the size of a finite field in another. Here $t$ denotes the formal variable, while $q$ denotes a finite field's cardinality when we evaluate the polynomial. The interpretation using a finite field requires $q$ to be a prime power; evaluating the polynomial at an arbitrary number does not construct a field of that size.

A generating function packages a sequence into a series so that operations on objects become operations on their encodings. An ordinary generating function uses the power series $A(z)={\sum }_{n\ge 0}{a}_n{z}^n$; in counting problems, the coefficient $a_n$ records the number of objects of size $n$. The variable $z$ initially marks size: it need not be assigned a numerical value. Coefficient extraction writes this recovery as $[z^n]A(z)=a_n$. One compact expression can therefore answer infinitely many counting questions, while explaining how their answers fit together.

Start with two contributions: choose $i$ from $\{0,1,2\}$ and $j$ from $\{0,1\}$, with exactly one option at each allowed value. Their individual ordinary generating functions are the polynomials $P(x)=1+x+x^2$ and $Q(x)=1+x$. To count ordered pairs by total $i+j$, multiply:The coefficients $1,2,2,1$ count the ways to obtain totals zero through three. For total two, the possibilities are $(1,1)$ and $(2,0)$; the two corresponding monomials both contribute $x^2$. There are six ordered pairs altogether, agreeing with $P(1)Q(1)=3\cdot 2=6$.

If the first contribution has two distinguishable choices when $i=1$, replace $P(x)$ by $1+2x+x^2$. Its product with $Q(x)$ becomes $1+3x+3x^2+x^3$. The coefficients now carry multiplicities as well as possible totals; the exponent still records cost. This lets the same construction handle several actions with identical costs without losing their separate identities.

In general, the Cauchy product givesFor each split of the total size, the rule of product counts the choices of the two components; summing over those splits counts all possibilities. This requires each combined object to have a unique decomposition into the two components. The same idea works for costs, lengths, or other additive measures, not just the number of pieces. See MIT 18.310, generating functions, sections 1–2.

Now cover a board of length $n$ with tiles of lengths one and two, without gaps or overlaps. Let $t_n$ count these tilings. There is exactly one empty tiling, so $t_0=1$, and $t_1=1$. Removing the first tile leaves a board shorter by one or two, giving the recurrence relationThese are the Fibonacci numbers shifted by one index: $t_n=F_{n+1}$ under the convention $F_0=0$, $F_1=1$. Keeping the empty tiling is essential to both the counting rule and the resulting ordinary generating function.

For $F(z)={\sum }_{n\ge 0}{t}_n{z}^n$, the empty board or a first tile followed by a remaining tiling givesEquivalently, $F(z)={\sum }_{m\ge 0}(z+z^2{)}^m$: each factor chooses one tile, and $m$ counts pieces while the exponent of $z$ records total length. The same ordinary generating function counts ordered histories of two repeatable actions costing one and two units. Histories $(1,2)$ and $(2,1)$ differ despite having the same total cost. MIT's notes use dots and dashes with these costs, including the empty message. ^[ref]

These identities hold in formal power series algebra: each requested coefficient uses only finitely many contributions. The repeated-choice expansion is legitimate because $z+z^2$ has zero constant term; a zero-cost repeatable action would allow infinitely many histories of the same size. Numerical evaluation separately requires a convergent series. Here the radius of convergence is $(\sqrt{5}-1)/2$, the reciprocal of the golden ratio. At $z=1$, the rational function equals $-1$, but the counting series diverges: that value cannot represent its sum.

Other generating functions change the encoding: an exponential generating function divides by factorials, while a Dirichlet series uses $n^{-s}$. A counting generating function also differs from a probability generating function, whose coefficients must be nonnegative and sum to one.

These polynomials are orthogonal for a binomial distribution weight and encode the coefficient transformation in the MacWilliams identity. Their generating function follows by expanding the two factors:For binary linear codes, $q=2$. Expanding the factors gives $K_s(t;n,2)={\sum }_j(-1{)}^j(\genfrac{}{}{0ex}{}{t}{j}\left)\right(\genfrac{}{}{0ex}{}{n-t}{s-j})$, where binomial coefficients outside their usual integer range are zero. Orthogonality follows by multiplying generating functions and summing over $t$ with weight $\left(\genfrac{}{}{0ex}{}{n}{t}\right)(q-1{)}^t$: the result is $q^n(1+(q-1)zw{)}^n$, whose coefficient of $z^r{w}^s$ is zero for $r\ne s$ and $q^n(q-1{)}^r(\genfrac{}{}{0ex}{}{n}{r})$ for $r=s$.

The left and right transverse oscillator sectors each have generating function ${\prod }_{m\ge 1}(1-q^m{)}^{-24}$. Its coefficient satisfies $d_N\sim 2^{-1/2}(N-1{)}^{-27/4}{e}^{4\pi \sqrt{N-1}}$. Closed-string level matching requires equal levels but leaves their polarizations independent, so $g_N=d_N^2$. With ${\alpha }^{\prime }{M}^2=4(N-1)$, the exponential is $e^{{\beta }_{H}M}$ with ${\beta }_H=4\pi \sqrt{{\alpha }^{\prime }}$. The smooth rest-mass density is proportional to $M^{-26}{e}^{{\beta }_{H}M}$, since $dN/dM={\alpha }^{\prime }M/2$. This distinguishes degeneracy per level from density per unit mass. The polynomial prefactor matters at the boundary of canonical convergence.

A horizontal run has generating function $R(z)=(1+z)/(1-z)$. Decomposing each walk into $H(NH{)}^k$ gives $A(z)=R(z)/(1-zR(z))=(1+z)/(1-2z-z^2)$. Thus $a_0=1,a_1=3$ and $a_n=2a_{n-1}+a_{n-2}$. The exponential growth rate is $1+\sqrt{2}$, furnishing a strict lower bound greater than two for the connective constant of all square-lattice self-avoiding walks.

This is the power-series specialization of a generating function.

The ordinary generating function of a sequence $(a_n{)}_{n\ge 0}$ is the formal power series $A(z)={\sum }_{n\ge 0}{a}_n{z}^n$. Algebraic identities for $A$ encode recurrences and counting constructions for the coefficients.

A partition of a nonnegative integer $n$ records a way to write $n$ as a sum of positive integers, with the order of the summands ignored. Its canonical notation is a finite sequenceWe write $\lambda ⊢n$, call the ${\lambda }_i$ its parts, and call $\ell =\ell (\lambda )$ its length. Trailing zero parts may be appended for calculations without changing the partition of an integer; zero has the unique empty partition of an integer, of length zero. Thus $(3,2)$, $(3,2,0)$ and $5=2+3$ describe the same partition of an integer of five. The Young diagram below makes its two parts visible as rows of three and two cells.

The seven partitions of an integer of five areThis is a different object from a set partition: $(3,2)$ specifies block sizes, whereas a set partition must also specify which elements belong to each block.

Why this is useful: a partition of an integer is a compact description of a shape, yet it also labels an irreducible representation of a symmetric group over the complex numbers, realized by a Specht module. It therefore connects arithmetic decompositions, Young diagrams, and representation theory of the symmetric group. The generating function for partitions with bounded parts gives another way to count such shapes. Historically, Euler studied these counting problems using generating functions; his ^[ref] documents this early development.

Write the integrand, without its common overall factor, as $\mathcal{L}={\partial }_{+}X\cdot {\partial }_{-}X-{\psi }_1\cdot {\partial }_{-}{\psi }_1-{\psi }_2\cdot {\partial }_{+}{\psi }_2$. Keep each constant Grassmann variable on the left. For the first supersymmetry component, varying the bosonic term givesVarying its fermion term gives $-{\epsilon }_1{\partial }_{+}X\cdot {\partial }_{-}{\psi }_1+{\epsilon }_1{\psi }_1\cdot {\partial }_{-}{\partial }_{+}X$. The plus sign in the second term comes from moving the odd parameter past ${\psi }_1$. The middle terms cancel and the rest form ${\epsilon }_1{\partial }_{+}({\psi }_1\cdot {\partial }_{-}X)$. The second supersymmetry component similarly gives ${\epsilon }_2{\partial }_{-}({\psi }_2\cdot {\partial }_{+}X)$. Hence, off shell,This proves the local total-derivative identity for rigid worldsheet supersymmetry; the action is invariant when the corresponding boundary flux vanishes and the transformation preserves the allowed fields. A constant parameter preserves a periodic boson and a periodic fermion. In a Neveu–Schwarz sector, however, $\delta X=\epsilon \psi$ is antiperiodic for constant $\epsilon$ and does not preserve the periodic boson. Thus the bulk identity does not supply a global constant supercharge in every spin sector. This is the spin-structure obstruction to constant worldsheet supersymmetry; the local superconformal formulation handles the different sectors consistently.

For independent field variations, integration by parts gives bulk termsThe equations of motion are thereforeFor variations vanishing at the temporal ends, the spatial seam term is proportional to the difference between its values at $\sigma =2\pi$ and $\sigma =0$ ofThe bosonic part cancels for closed string periodicity, also in a fixed winding sector. For a real fermion impose ${\psi }_a(2\pi )=s_a{\psi }_a(0)$ and the same relation on its variation. Seam cancellation requires $s_a^2=1$, so the two untwisted possibilities are periodic, $s_a=+1$ (Ramond sector), or antiperiodic, $s_a=-1$ (Neveu–Schwarz sector). The two chiralities of a closed string can choose these signs independently, giving R–R, NS–NS, R–NS and NS–R sectors. This discussion assumes the ordinary Lorentz-invariant untwisted boundary conditions of the flat theory.

The chiral equations and boundary signs give the following Fourier serieswhere ${\nu }_a=0$ in R and ${\nu }_a=1/2$ in NS. Thus integer or half-integer modes follow directly from the Fourier series monodromy. With the conventional string oscillator normalization their anticommutation relations and reality conditions areFor an open string the endpoint gluing identifies the two sets of coefficients, leaving one R or NS tower.

In ten-dimensional light-cone gauge in string theory, the eight transverse bosonic modes have positive integer level and each NS fermionic creator has a positive half-integer level. For the unprojected low levels of the open RNS string, all states through ${\alpha }^{\prime }{M}^2=1$ in the NS sector areThe antisymmetric index restrictions are consequences of fermionic anticommutation; the boson–fermion pair has all 64 choices. The displayed partitions exhaust levels at most $3/2$. Here the NS normal-ordering constant of a string is $a=1/2$.

In the R sector $a=0$, and the zero modes satisfy $\{{\psi }_0^i,{\psi }_0^j\}={\delta }^{ij}$. Thus ${\gamma }^i=\sqrt{2}{\psi }_0^i$ generate the Ramond zero-mode Clifford algebra. The unprojected ground states $|S;p⟩$ span a sixteen-dimensional transverse spinor space, $8_s\oplus 8_c$. All states in the requested range areThere is no intervening half-level, since all nonzero R modes have integer level. Acting with the zero modes only moves within the ground spinor space and does not generate further independent copies.

The GSO projection keeps odd NS fermion-excitation parity, removing the tachyonic vacuum and the entire $N=1$ NS level. In R it keeps one eigenvalue of total fermion parity, whose zero-mode part is spinor chirality. It leaves eight massless spinor states. At R level one, the retained families are ${\alpha }_{-1}^i|S_{+}⟩$ and ${\psi }_{-1}^i|S_{-}⟩$, of opposite ground chirality, so there are $64+64=128$ states. The retained NS states are spacetime bosons and the R states spacetime fermions. Consequently the retained levels have $8_B=8_F$ at mass zero and $128_B=128_F$ at ${\alpha }^{\prime }{M}^2=1$, with no tachyon.

Equality at every higher mass level follows from the standard Jacobi abstruse identity, or equivalently the equality of the transverse generating functionsThe left side counts the projected NS bosons, the right side the projected R fermions. Their common coefficients start $8+128q+\cdots$. This consistent truncation yields spacetime supersymmetry; the bulk worldsheet symmetry alone would not remove the tachyon or impose the projection.

Use units $k_B=\hslash =c=1$. In critical light-cone gauge in string theory, each chiral sector of the closed bosonic string has 24 transverse string oscillator species. Their generating function isEach factor sums the independent occupation numbers of the string oscillators at level $m$. For $q=e^{-t}$ with $t\downarrow 0$, the modular transformation of the Dedekind eta function givesExtract the coefficient by a contour integral and apply the saddle-point approximation to the exponent $(N-1)t+4{\pi }^2/t$. The saddle is $t_{\ast }=2\pi /\sqrt{N-1}$, with exponent $4\pi \sqrt{N-1}$ and second derivative $(N-1{)}^{3/2}/\pi$. The factor $t^{12}$ gives $(N-1{)}^{-6}$, and the Gaussian width gives $(N-1{)}^{-3/4}/\sqrt{2}$. HenceFor a noncompact closed string, closed-string level matching imposes equal left and right levels, but does not correlate their transverse polarizations. Therefore the large-level degeneracy of a closed bosonic string isThe mass relation is ${\alpha }^{\prime }{M}^2=4(N-1)$. Thus $8\pi \sqrt{N-1}={\beta }_{H}M$ withDistinguish degeneracy per discrete level from a smoothed density per unit rest mass. Since $dN/dM={\alpha }^{\prime }M/2$, the latter isThe exponential growth comes from the many ways of distributing string oscillator energy along a string; it is much faster than a fixed finite collection of particle species. The corresponding high-energy entropy is $S(E)={\beta }_{H}E+O(\log E)$, so its microcanonical temperature tends to $T_H$. Additional energy can go into very long strings rather than raising the temperature substantially.

The Boltzmann suppression competes with this exponential density. For the string oscillator rest-mass sum alone the large-$M$ tail is $\int dM{M}^{-26}{e}^{-(\beta -{\beta }_H)M}$. It converges for $\beta >{\beta }_H$ and fails for $\beta <{\beta }_H$. To include translational states in 25 noncompact spatial dimensions, take the one-string partition function per unit spatial volume. At large $M$,This follows by expanding the energy as $M+p^2/(2M)+\cdots$ and doing a Gaussian momentum integral. Its high-mass contribution is consequently proportional toThis integral is finite at $\beta ={\beta }_H$, although nonanalytic there: its first twelve derivatives in $\beta$ are finite, while the thirteenth diverges. The endpoint expansion contains a term proportional to $(\beta -{\beta }_H{)}^{25/2}$. Thus one must not assert that the canonical partition function necessarily diverges exactly at $T_H$; the polynomial prefactor and the spatial spectrum matter. This is the finite canonical partition function at the bosonic Hagedorn threshold distinction. The multi-string ideal gas has the same leading Hagedorn threshold, since the higher occupation-cycle terms probe $\ell \beta$, $\ell \ge 2$, and are nonsingular at ${\beta }_H$.

There is also a spacetime diagnosis. Euclidean temperature makes time a circle of radius $R_{\beta }=\beta /(2\pi )$. A string oscillator ground state winding once around that circle, with zero momentum number, hasIt becomes massless at ${\beta }_H$ and tachyonic for $T>T_H$. This thermal winding instability of a closed bosonic string signals failure of the perturbative low-temperature gas and motivates a transition to a different high-energy phase, often described in terms of long-string or winding-mode condensation. Free state counting fixes the threshold and its singular behavior, not the interacting phase's endpoint or the order of a transition.

Finally, the ordinary bosonic tachyon is already an infrared instability at zero temperature. The above canonical discussion is a formal analysis of the high-level spectrum with that separate infrared problem regulated. It does not establish a stable thermal vacuum of the unmodified bosonic theory; an actual equilibrium transition requires an appropriate stable setting and control of interactions.

The generating function for integer partitions is ${\sum }_{\lambda }{u}^{|\lambda |}={\prod }_{i\ge 1}(1-u^i{)}^{-1}$, since independently choosing the multiplicity of each part size gives a geometric series. Applying the parameterization in 5(a),Unique factorization of monic polynomials showsIndeed the left side counts monic polynomials with nonzero constant term; in degree $r\ge 1$ there are $(q-1)q^{r-1}$ choices. Reordering the formal products is legitimate because only finitely many factors contribute to any fixed coefficient. Substituting $u=t^i$ for each $i$ gives the conjugacy-class generating function for finite general linear groups:The constant term corresponds to the trivial zero-dimensional group.

Count oscillator polarizations at fixed center-of-mass momentum. In a critical closed bosonic string, each chiral sector has 24 transverse oscillator species. A species at frequency $m$ can be occupied $0,1,2,\dots$ times, so its contribution is $(1-q^m{)}^{-1}$. The full chiral generating function is thereforeThe two sectors are independent, while closed-string level matching restricts their oscillator numbers to the same $N$. Thus the number of states at the closed-string mass level is $g_N=d_N^2$, not $d_{2N}$.

Put $q=e^{-\beta }$, with $\beta >0$. The Dedekind eta function obeysThe transformed argument $2\pi i/\beta$ has large imaginary part, so its product approaches one and $\eta (2\pi i/\beta )\sim e^{-{\pi }^2/(6\beta )}$. HenceThis establishes the singular exponential as well as its power prefactor. The corrections to the transformed eta product are exponentially small in $1/\beta$.

The Cauchy coefficient formula, followed by $q=e^{-\beta }$, gives a steepest-descent integral with leading formLet $n=N-1$. The saddle of $S(\beta )=n\beta +4{\pi }^2/\beta$ isAlong the vertical steepest-descent direction $\beta ={\beta }_{\ast }+it$, the quadratic part is $-S^{\prime \prime }({\beta }_{\ast })t^2/2$. Thus the saddle-point approximation gives the Gaussian prefactorThe point $q=1$ supplies the largest exponential contribution. At another fixed root of unity of order $k>1$, the corresponding modular singularity gives a smaller exponential $e^{4\pi \sqrt{n}/k}$, so it does not change this leading asymptotic. Squaring the chiral result gives the large-level degeneracy of a closed bosonic stringReplacing $N-1$ by $N$ gives the equivalent usual leading asymptotic. The power $-27/2$ matters: the two-sector degeneracy is not just an unspecified exponential.

Since $M=2\sqrt{(N-1)/{\alpha }^{\prime }}$, the exponential is $e^{{\beta }_{H}M}$ withHere Boltzmann's constant is one. Coarse-graining the levels into a density per unit rest mass introduces the Jacobian $dN/dM={\alpha }^{\prime }M/2$. ConsequentlyThis is distinct from the degeneracy per level, whose power in $M$ is $-27$. The internal-state contribution to a canonical partition function behaves at large mass asIt converges for $\beta >{\beta }_H$ and diverges for $\beta <{\beta }_H$. At $\beta ={\beta }_H$, this particular internal rest-mass integral converges because of the power $M^{-26}$; one should not discard the prefactor and claim divergence there without specifying the full thermodynamic ensemble. For example, including continuous momenta in 25 spatial dimensions multiplies the high-mass integrand by a factor proportional to $M^{25/2}$, still leaving convergence of this ideal one-string integral at the endpoint, although sufficiently high derivatives are singular. Multi-string effects, volume and interactions affect the detailed limiting thermodynamics.

The leading microcanonical entropy grows as $S(E)\sim {\beta }_{H}E$, with logarithmic corrections, so increasingly large energies are stored in increasingly excited, long strings rather than in an arbitrarily hot ordinary gas. The Hagedorn temperature is the boundary of canonical convergence from above in inverse temperature; extrapolating the free-string canonical description to $T>T_H$ fails. This counting does not settle the interacting phase above that scale. Also, the bosonic ground-state tachyon is a separate vacuum instability; the high-level asymptotic is meaningful as a formal spectrum calculation without asserting a stable bosonic thermal vacuum.