The class of finite groups is not first-order axiomatizable. If axiomatized it, add constants and all inequalities . Every finite fragment has a sufficiently large finite cyclic group as a model. The compactness theorem would then give an infinite group satisfying , contradicting the definition of the class. This is the group instance of the fact that finite structures are not first-order axiomatizable.
Measure the second register of . If the result is , injectivity within one period collapses the first register to the periodic coset state
Apply and measure the first register. By the stated transform identity, the outcome is
for a uniformly random .
Reduce the rational number
to lowest terms and call its denominator . The exact period recovery from a Fourier sample gives
Thus exactly when is coprime to .
The success can be certified with two classical function evaluations. Compute and . Since and , periodicity and injectivity within a period imply
Report only when this equality holds; otherwise report failure. The success probability is
using the standard lower bound for the Euler totient function. This is heralded exact quantum period finding when the period divides the register size.
Since , the scaling in part (b) gives
Substitute this into . After collecting powers,
where
This is the polytropic mass-radius relation.
An polytrope models a white dwarf whose electrons are an ultrarelativistic degenerate gas. For , the radius exponent vanishes and the mass is independent of both and . This fixed limiting value is the Chandrasekhar mass: increasing the central density can no longer support a larger mass, so a cold nonrotating white dwarf above the limit cannot remain in hydrostatic equilibrium.
Using the enclosed mass integral, , and the Lane-Emden equation,
Substituting the value of from part (b) gives the Lane-Emden mass formula
With the polytropic equation of state and substitutions
we have
The pressure-support equation therefore becomes
Choose
Changing from to then yields the Lane-Emden equation
These are the Lane-Emden variables for a stellar polytrope.
At the centre, spherical symmetry and regularity require a finite central density and
At the stellar surface , the pressure vanishes:
For a stellar polytrope these become the dimensionless conditions , , and the surface is the first zero ; specifying fixes the overall scale.
Comparison with the multivariate normal density shows that is its precision matrix. Since the mean is zero,
Multiplying on the right by gives . Taking the transpose and using the symmetry of and gives . Hence the stationary covariance obeys the Continuous Lyapunov equation
The same equation follows directly by setting the time derivative of the second-moment equation from part (c) to zero.
For
with symmetric ,
Substitution into the current from part (d) yields
It vanishes for all exactly when
Thus the stated multivariate normal distribution is a stationary solution whenever the zero-current assumption makes symmetric positive definite. This is the Stationary Gaussian density for a linear Fokker-Planck equation.
With and constant , the Fokker-Planck probability current becomes
In the stationary state we impose the stronger zero-current condition , corresponding to detailed balance.
Assume again that all boundary terms vanish. Multiplying the Fokker-Planck equation by and integrating by parts gives
The diffusion term vanishes after the second integration by parts.
Similarly, and
Because is symmetric,
These are the First two moments of a multivariate Fokker-Planck equation.
Integrating the continuity equation over state space and applying the divergence theorem gives
Assume the probability density function and its derivatives decay sufficiently rapidly at infinity, or impose a zero-flux boundary condition. The boundary integral then vanishes, so is constant. Since it is initially one, the distribution remains normalized for all time.
Define the Multivariate Fokker-Planck probability current by
Then
so the Fokker-Planck equation is exactly the continuity equation .
The pumping lemma for regular languages states that for every regular language there is an integer such that every with can be written
with
To prove it, let a deterministic finite automaton with states recognize . During the reading of the first symbols of an accepted word , the automaton visits states, including the initial state. By the pigeonhole principle, two of them agree, say with . Let be the first symbols, the next symbols, and the remaining suffix. Reading is a nonempty closed path from to itself. Traversing this path any number of times and then reading therefore reaches the same accept state. This proves all three assertions.

There are unlisted articles, also show them or only show them.