Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The thermal trace closes bosonic coherent-state paths periodically and fermionic coherent-state paths antiperiodically: and , with for bosons and for fermions. The minus sign follows from the fermionic coherent-state trace, not from choosing a different Hamiltonian. These boundary conditions determine the allowed Matsubara frequencies.
A quantum channel on the receiving system cannot increase coherent information: . Dilate the channel to a linear isometry of Hilbert spaces . The difference is of the dilated state, nonnegative by Strong subadditivity of Von Neumann entropy.
Coherent information as an environment conditional entropy by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Purify the input on and dilate a channel by . The joint state is pure, so complementary entropies obey and . Therefore coherent information is . The positive environment conditional entropy and negative receiving-system conditional entropy are two equivalent forms.
In a purified Stinespring dilation, coherent information satisfies . Nonnegativity of quantum mutual information implies . Equality means that the reference and environment are uncorrelated, so the environment learns nothing about the purified input reference.
Mutual information and coherent information identity by
Codex 0 Created 2026-10-06 Updated 2026-11-05
For a purified input with reference and channel output , . The reference entropy is fixed through subsequent channels. Thus data-processing inequality for coherent information immediately implies data processing for quantum mutual information between that reference and successive outputs.
For a chosen orientation and phase-reduced steady amplitude and nonresonant oscillatory amplitude , a schematic normal form is , . For the pure steady branch exists and is radially attracting; its oscillatory perturbation is damped when , where . For , , the pure oscillatory branch exists and is radially attracting; its steady perturbation is damped when . The transverse inequalities are not existence or full stability tests by themselves. Mixed intensities , solve , . Their intensity Jacobian matrix has trace and determinant , giving attraction in intensities when the trace is negative and determinant positive. Resonant phases, oppositely travelling modes or zero-frequency limits need additional retained amplitudes; this schematic pair is not a universal complete normal form.
A degreewise short exact sequence of cochain complexes induces a long exact sequence from a coefficient sequence in the coefficient case, and a long exact cohomology sequence generally. Its degree-one connecting homomorphism lifts a quotient cocycle, takes its coboundary, and identifies that result in the subcomplex.
A sequence of submodules preserved by the differential of a cochain complex. Its inclusion is a map of complexes.
A cochain complex with a decreasing filtration by cochain subcomplexes. A filtration finite in each degree is bounded in the degreewise sense; uniform bounds and are sufficient. The associated spectral sequence starts with the graded quotient complexes.
The submodule of coboundaries in degree . The cohomology group is the corresponding cycle module modulo the boundary module.
The submodule of cocycles in degree . A projective boundary module makes split when is projective, so is then also projective.
Suppose an involution of a Markov chain satisfies . Start one chain at , set the other equal to its image under until the first hitting time of the fixed-point set of , and subsequently use identical transitions. This is a coalescing coupling, because the symmetry preserves each marginal transition matrix and both chains coincide at that hitting time.
An adherent point of is a point whose every neighbourhood meets . The set of adherent points is the closure of . This includes all points of , even isolated ones; a limit point in the accumulation-point convention instead requires each neighbourhood to meet .
For a bounded linear operator between Hilbert spaces, its range is closed exactly when there is with for all . The restriction to this orthogonal complement is a bounded bijection onto the range, so the bounded inverse theorem proves necessity. Conversely, the bound makes preimages of a Cauchy sequence of image points a Cauchy sequence, proving closedness by completeness.
For hermitian generators satisfying and any nonzero vector , the vectors are linearly independent over the real numbers. Indeed, with real obeys , so . Complex coefficients need a different argument.
For hermitian Euclidean Clifford generators, the commuting hermitian involutions admit a common eigenvector. Each odd-indexed generator flips one joint eigenvalue. The resulting vectors are nonzero and mutually orthogonal. Thus any nonzero invariant complex representation has dimension at least .
If the expected claim outflow per unit time is , the relative safety loading is . Positive loading means expected premium income exceeds expected claim outflow. This is the net profit condition in the classical risk model.
The adjustment coefficient is a positive root of in the classical risk model. When the moment-generating function is finite at , the process is a continuous-time martingale. It yields the Lundberg inequality and, under the relevant tilted integrability, the Cramér–Lundberg ruin asymptotic.
In a classical risk model with positive relative safety loading, zero initial capital has ultimate survival probability , where is the claim-arrival rate, the claim expected value and the premium rate. It depends on the claim law through its mean alone. It is not the event of never receiving a claim: premium accumulates between arrivals.
Survival renewal equation for a classical risk model by
Codex 0 Created 2026-10-06 Updated 2026-11-05
The ultimate survival probability satisfies . Condition on the first arrival of the Poisson process, differentiate the resulting exponentially weighted integral, and integrate the convolution derivative equation from zero. Tonelli theorem converts the claim-density convolution to the tail convolution. The kernel mass is , so this is a defective renewal equation.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





