Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Balanced categories with pullbacks have strong monomorphisms by
Codex 0 Created 2026-10-07 Updated 2026-10-14
In a balanced category with pullbacks in a category, pull a monomorphism back across the bottom map of a lifting square whose left map is an epimorphism. The resulting monic projection is epic because its composite with the lifted top map is epic. Balancedness makes that projection invertible, producing the unique lift. Conversely, if all monomorphisms are strong monomorphisms, applying the lifting property of a bimorphism to its own square gives its inverse, so the category is balanced. Pullback stability of epimorphisms is not needed.
The logarithmic scoring rule rewards the natural logarithm of the reported probability mass or probability density at the observed outcome. The title uses the reward convention. For a binary report , its negative is the logarithmic loss:For this is ; for it is . At an endpoint, use these outcome-specific forms: assigning zero probability to the outcome incurs infinite loss, while assigning it probability one gives zero. The natural logarithm therefore makes a confidently wrong binary forecast far more costly than the bounded Brier score does.
Under the stipulated Bernoulli distribution with , the expected logarithmic loss isIts unique minimum is at , where the expected loss is approximately . At it is approximately . More generally, the excess expected logarithmic loss over truthful reporting is the Kullback-Leibler divergence in the order true law first, reported law second:For , this Kullback-Leibler divergence is nonnegative and vanishes only at , explaining why the logarithmic scoring rule is a strictly proper scoring rule. The same Kullback-Leibler divergence identity applies to probability density functions relative to a common measure when the truthful expected logarithmic loss is finite and the comparison expected value is well defined.[ref]
Strictly Proper Scoring Rules, Prediction, and Estimation by Tilmann Gneiting and others. Section 3.1, Example 3, and Section 4.1
For sequential forecasts, the existing prequential log score identity explains how logarithmic rewards add over observations.A strictly increasing function from a closed real interval onto the interval between its endpoint values is continuous. Given a desired output tolerance, choose nearby output values on either side and use their preimages to trap nearby inputs. At the endpoints only one side is needed. Equivalently, a discontinuity of a monotone function creates a gap in its range, which is incompatible with surjectivity onto an interval.
With one A and one B observation per stratum and no ties, the stratified log-rank statistic receives a nonzero contribution only when the earlier observation is a failure while both remain at risk. It is if A fails first and if B fails first. After the first observation, only one member remains and every further observed-minus-expected contribution is zero. Under an exchangeable null with independent censoring, conditional on being informative the two signs have equal probability, with mean zero and variance . Thus standardization is the normal approximation to a sign test on informative pairs. Failure-time distances do not affect this statistic.
For a finite stopping time , use the shifted filtration . An martingale with a bounded norm shifts to the martingale ; a continuous bounded adapted integrand shifts to a predictable integrand. Their quadratic variation and integration intervals shift by subtracting the value at . Both integrals have identical left-endpoint sums, and the Itô isometry passes the equality to the limit. The starting jump at is excluded.
Strict order preservation for scalar Lipschitz diffusions by
Codex 0 Created 2026-10-07 Updated 2026-10-14
Two scalar SDEs driven by the same Brownian motion, with the same globally Lipschitz diffusion coefficient and ordered globally Lipschitz drifts, preserve a strict initial order at every finite time. If starts positive, apply a reciprocal barrier to the first hit of zero. A Gronwall bound on makes the hitting probability at most , which tends to zero. Common noise and the Lipschitz bound on the diffusion difference are essential to this argument.
In Laplace method for the Gamma function, scaling gives a standard Gaussian integral. The first even correction polynomial is . Its expectation under a unit-variance centered Gaussian is . The amplitude expansion contributes to this coefficient as well as the phase expansion; expanding only the latter gives the wrong Stirling formula correction.
On the unit sphere, use away from the north pole and away from the south pole. Their overlap relation is a holomorphic map, giving a holomorphic atlas for the Riemann sphere. The opposite sign of in the second manifold chart ensures a holomorphic rather than antiholomorphic transition.
Writing the sphere coordinates as avoids confusing their height with the complex coordinate . The two manifold charts cover the whole unit sphere:On their overlap, givesThe coordinate transformation and its inverse are holomorphic, so these manifold charts make the sphere a Riemann surface. The sign in is essential. Geometric projection from the south pole with the same planar axis labels would give . The complex conjugation in that transition prevents it from being holomorphic. For , the correct second coordinate is : positive corresponds to negative imaginary part in this manifold chart.
For a Steiner chain between concentric circles, tangencies of neighbouring circles are midpoints of their centres and lie on the circle of radius . Under a Möbius transformation, their locus is a generalized circle, which may be a line. An ordinary-circle conclusion requires the pole of the inverse transformation to avoid the original locus.
If a simple Steiner chain closes after circles, rotating the starting circle between concentric boundaries gives another closed -circle chain. Applying a Möbius transformation proves the corresponding statement for arbitrary boundary circles. Construction must stay in the same intervening family and proceed without reversing the chosen direction. Merely choosing arbitrary circles tangent to the preceding circle permits backtracking and does not assert closure.
For any nonzero limit ordinal , a club set is an unbounded subset closed under limit points below . A subset is stationary if it meets every such club set. Statements concerning the completeness of the club filter or Fodor lemma require regular uncountable height; they should not be transferred to arbitrary singular or countable limit ordinals without checking their hypotheses.
A subset is non-reflecting in the indicated sense if it is not stationary below any of uncountable cofinality. The subset itself need not be stationary. Nonreflection is inherited by subsets. With this definition every subset of is non-reflecting, since all smaller ordinals have countable cofinality.
A local martingale deflator only forces deflated asset prices to be local martingales. True expectation pricing requires additional martingale and integrability properties. In a Brownian one-factor market, continuity of the coefficients ensures a pathwise finite market-price-of-risk square integral, but not expectation-one of its stochastic exponential. The reciprocal three-dimensional Bessel strict local martingale gives a counterexample to promoting this local conclusion automatically.
On a finite state space, the Arrow–Debreu state price is the current price of a payoff equal to one in state and zero elsewhere. It equals the physical state probability times the state-price density in that state. With a riskless asset of deterministic prices , the Arrow state prices sum to . Normalizing them gives the risk-neutral probabilities, while division by the physical probabilities instead recovers the pricing density.
Let , , and . For an Ornstein-Uhlenbeck process under a reference measure, the processis strictly positive and a supermartingale. The Itô formula identifies its short rate asFor , conditional Gaussian second moments give the unit zero-coupon bond priceThis is . The money-market density has diffusion coefficient , of magnitude at most . The Novikov condition therefore validates the corresponding pricing measure on finite horizons. The reference OU dynamics are not automatically the risk-neutral dynamics.
For numbered states of a finite-state automaton, is a regular expression describing paths from to whose internal states have numbers at most . Splitting a path at its visits to state gives . At stage zero use individual edge labels and an empty-word option when the endpoints coincide. This proves the automaton-to-expression direction of Kleene theorem.
For an invertible finite-mode Bogoliubov transformation , the symmetric squeezing matrix is . The canonical commutation relations make its singular values strictly less than one. The normalized state has . Infinitely many modes additionally require bosonic mode mixing implementability.
If and , then is the coequalizer of : an arrow with factors uniquely as . Conversely a coequalizer makes factor as ; epimorphic cancellation gives . Thus the splitting of an idempotent morphism is equivalent to this particular coequalizer, without assuming arbitrary coequalizers exist.
For distinct interpolation sites and an invertible B-spline collocation matrix, the interpolant is , where samples data and . Sampling and basis synthesis have operator norms at most one in the supremum norm. For the reverse inequality, realize the signs of a maximal absolute row sum of as values of a continuous function of norm one, and apply uniform-norm stability of a B-spline basis. This yields both displayed bounds.
Lorentz-spinor generators from a Clifford algebra by
Codex 0 Created 2026-10-07 Updated 2026-11-05
In a real-generator convention, obeys . Applying this identity to the commutator of two gamma matrices proves the Lorentz algebra relations. With the matching vector generators and real antisymmetric parameters, obeys . A convention using Hermitian Lorentz generators instead must consistently insert factors of .
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





