At nucleosynthesis temperatures, particles are nonrelativistic. Their equilibrium abundance is negligible because of Boltzmann suppression, so they do not behave as an extra relativistic species contributing its full degree count to . A stable thermal weakly interacting massive particle generally freezes out much earlier; a surviving relic population with the usual dark-matter abundance remains negligible compared with radiation during nucleosynthesis. In that standard relic scenario the helium abundance is essentially unchanged.
The mass and weak coupling alone do not specify the relic density. If an unusually abundant stable population contributes appreciably to the expansion density, it raises at fixed radiation temperature and increases helium by the same freeze-out and survival mechanism as part (g). Decays or energetic annihilation products would require their own specified history. Thus a universal numerical change cannot be inferred from the mass alone.
The helium yield is primarily neutron-limited, so small changes in cosmological baryon density have only a weak effect compared with their effect on residual deuterium. Increasing the baryon-to-photon ratio makes deuterium destruction less effective relative to its formation and releases the deuterium bottleneck at a slightly higher temperature. Nuclear reactions also proceed faster. Fewer neutrons decay before capture, so a small increase in baryon density slightly increases helium-4; a decrease slightly lowers it.
The equilibrium neutron-to-proton ratio is . Increasing the neutron-proton mass difference suppresses neutron abundance at the same freeze-out temperature. Therefore less helium-4 forms, with other inputs held fixed. Any associated shortening of neutron lifetime further reduces survival, rather than reversing this direct effect.
A thermally populated extra light neutrino species is relativistic during nucleosynthesis; its mass is negligible at MeV temperatures. One neutrino-antineutrino species adds to . Thus the expansion rate increases by and the freeze-out temperature by . Earlier freeze-out leaves more neutrons, while faster cooling leaves less time for decay. The helium-4 abundance increases. This assumes the new species was populated at the standard neutrino temperature; an unpopulated species would not contribute this extra density.
At fixed expansion and conversion rates, a smaller neutron half-life reduces and hence . Fewer neutrons survive, so less helium-4 forms. If the reduced lifetime arises from a stronger weak coupling, its accompanying faster neutron-proton conversion also delays freeze-out and reinforces this decrease.
Reducing the gravitational constant decreases at fixed temperature. The helium sensitivity to the expansion rate has two effects: weak interconversion persists to a lower freeze-out temperature, leaving fewer neutrons, and the universe takes longer to reach the deuterium-burning temperature, allowing more free-neutron decay after freeze-out. Both lower the helium-4 abundance. In particular and .
The Hubble parameter is , and
For this is positive at every , so expansion is exponential and inflationary throughout. For , acceleration begins only after
The interval is decelerating, while is the transition. Thus the model admits inflation, but not arbitrarily near its specified time origin when ; choosing parameters can place the transition early. Equivalently becomes smaller than one at the same time.
For , and . Consequently inflation occurs exactly when . The case is coasting, and is decelerating. The Hubble slow-roll parameter is , giving the same acceleration criterion .
A physical positive scale factor here requires . In that domain but . There is no inflationary expansion. The range has a negative printed scale factor and cannot supply a positive expanding branch of this model.
We first establish the purification-overlap formula for quantum fidelity, rather than assume the desired monotonicity. Write a canonical purification of a density operator as
Tracing the second factor gives . The Schmidt decomposition shows that any other purification on a sufficiently large fixed ancillary space differs by a unitary on that space: its orthonormal ancillary vectors can be mapped to those of the canonical purification and the map extended to a unitary operator. Zero eigenvalues are handled by padding the ancillary basis.
The overlap of two canonical purifications, with a relative ancillary unitary , is , with zero padding when the ancillary dimension is larger. The unitary variational formula for the trace norm is
Indeed if is a singular value decomposition, the trace is with unitary. Its modulus is at most because , and attains that bound. Thus the maximal absolute overlap of purifications equals ; this also proves the needed form of Uhlmann's theorem.
Choose purifications and attaining . Regard the very same vectors as purifications of with ancillary system . Their overlap is among those maximized in the marginal purification formula, so
This proves the monotonicity of quantum fidelity under partial trace.
For positive operators, the unique positive square root of an operator respects tensor products: . To verify this, diagonalize ; the product eigenvectors have eigenvalues , whose square roots are . Hence the operator inside the outer square root in the fidelity factors as
Taking its positive square root and using gives .
Use the unsquared quantum fidelity convention in the question. For any matrix , its trace norm is : the two positive matrices have the same nonzero eigenvalues, namely the squared singular values. This follows directly from the singular value decomposition.
Set . Then and . Their positive square roots therefore have the same trace, proving
The argument also covers singular density operators, since zero singular values contribute zero.
For a patient still in hospital, sum over the unobserved eventual outcome. Its likelihood contribution is the mixture survival function
The probability of eventual death among those still hospitalized is generally different from , because the two conditional time distributions can have different tails.
A recorded discharge observes and . Its likelihood contribution is
The mixing probability distinguishes the joint outcome-and-time density from the conditional recovery-time density.
Let and . A recorded death observes both and , so its likelihood contribution, omitting factors from the independent observation mechanism, is
Its integration over gives the eventual death probability .
Suppose has a local maximum at . If , the nonnegativity of the modulus forces throughout a neighbourhood, and the identity theorem for holomorphic functions makes it zero on that connected component.
If , take . Then , and continuity gives a disk around on which . This lies within the given half-plane for a branch of the holomorphic logarithm. On define
Composition preserves holomorphy, and the real logarithm is strictly increasing, so has a local maximum at . Part (i) forces to be constant on the disk. Exponentiating gives , hence is constant there and, by the identity theorem for holomorphic functions, on the whole connected component. Therefore
This proves the maximum modulus principle by the requested logarithm argument. Multiplication by is what puts the image in the supplied logarithm branch; no global logarithm of is assumed.
Let , and suppose has a local maximum at . Choose such that the closed disk lies in and throughout it. Start planar Brownian motion at , and for let be its first exit from .
By part (a) and Itô formula, is a local martingale; boundedness of on the compact disk makes it a true bounded martingale. The exit time is finite almost surely. One direct check applies the same formula to , giving . Thus .
The optional stopping theorem, first at and then by bounded convergence, gives
The exit point is uniformly distributed on the circle: rotational invariance of planar Brownian motion about its starting point makes its exit law rotation invariant, and normalized arc length is the unique rotation-invariant probability measure on a circle. Since every boundary value is at most , equality of the mean forces every boundary value to equal ; continuity rules out a strict deficit at any boundary point. This holds for every , so is constant on the entire disk.
The Cauchy-Riemann equations then give both partial derivatives of equal to zero there. Thus is constant on that disk. The identity theorem for holomorphic functions propagates this constant to the connected component of in . Applying the same Brownian argument to proves the assertion for the imaginary part as well:
If is connected, this is constancy on all of . For a disconnected open set the printed global wording needs this qualification: a function taking different constants on two disjoint disks is holomorphic and has local maxima on each disk while not being globally constant.
Fix times , and set
These are iid bounded centred random vectors, and
Their covariance matrix is
We prove the required central limit theorem calculation explicitly. For , the scalar is bounded, has mean zero and second moment . The Taylor expansion of the exponential, with its uniformly bounded cubic remainder, gives
Independence implies that the characteristic function of the sum vector is the th power of this expression, so it tends to . This is the characteristic function of a centred multivariate normal distribution with covariance . The Lévy continuity theorem states that convergence of characteristic functions to a characteristic function continuous at zero gives convergence in distribution; apply it here.
By part (ii), the corresponding Brownian bridge vector has exactly this covariance and mean. Therefore
Repeated times or the endpoint times may make singular; the characteristic-function argument still applies. This proves every finite-dimensional distribution convergence requested, the uniform case of the Finite-dimensional Brownian bridge limit of an empirical distribution process.
Let be standard Brownian motion with its continuous version, and define
Every finite vector is a linear transform of a Gaussian Brownian vector, so is a centred Gaussian process. Using ,
For , this is , the prescribed Brownian bridge covariance kernel. Its paths are continuous on the probability-one event of Brownian continuity, because is continuous on every sample. The construction also gives . Thus it realizes a Brownian bridge with almost surely continuous paths, and part (i) identifies its process law.
A real Gaussian process is a family of random variables such that every finite vector has a multivariate normal distribution, allowing degenerate distributions. Equivalently every finite real linear combination is a Gaussian random variable. Its mean and covariance kernel are and .
For any finite set of indices, these functions give the whole mean vector and covariance matrix. The characteristic function of the vector is
The standard uniqueness theorem for characteristic functions therefore determines every finite-dimensional distribution, including the singular cases. Cylinder events form a generating class for the product sigma-algebra on and are closed under finite intersections, so agreement on all cylinder events gives agreement of the process laws by the uniqueness theorem for probability measures. Thus the mean and covariance determine the law on this coordinate sigma-algebra even when is uncountable. This statement does not claim uniqueness on an arbitrary finer sigma-algebra of path properties.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact