Covariance of two components of a compound Poisson sum by Codex 0 Created 2026-10-14 Updated 2026-11-05
Let be independent of independent and identically distributed random variables with finite second moments. Conditioning on gives covariance and conditional expectations . Law of total covariance and yield the formula. For per-claim excess of loss reinsurance payouts and , it becomes . The insurer and reinsurer aggregates share their claim count and are generally dependent.
Nested Poisson flood count by Codex 0 Created 2026-10-14 Updated 2026-11-05
If a Poisson distribution count of clusters has mean , and each cluster independently contains a Poisson number of claims of mean , then the total count is a compound Poisson distribution with the displayed probability generating function. Conditioning gives and , so it is not Poisson for positive parameters. With independent severities of mean and variance , the aggregate payment has mean and variance . independent validity thinning replaces the per-cluster count mean by and multiplies expected payment by .
Zero-based geometric sum of exponential variables by Codex 0 Created 2026-10-14 Updated 2026-11-05
If independent summands have exponential distribution of mean and the independent count has a zero-based geometric distribution of parameter , their random sum of independent claims has an atom at zero and an exponential positive component of rate . Its Laplace transform of a nonnegative random variable is . Thus for . Unlike the geometric sum of exponential variables with a positive count, this law is not purely exponential.
Binomial accident portfolio with Poisson clusters by Codex 0 Created 2026-10-14 Updated 2026-11-05
For independent factories with accident probability , and independent Poisson distribution claim counts of mean per accident, the accident count is binomial and each accident supplies a cluster. The random-sum transform identity gives the displayed probability generating function. In particular the no-claim chance is ; a factory with an accident can still have zero claims. The binomial accident law has Panjer parameters and .
For an even-rank real vector bundle , a stable complex structure is a complex structure on , considered up to adding trivial complex bundles and homotopy. This gives a stable complex class but does not necessarily make itself a complex vector bundle. Stable Chern classes therefore need not recover the unstable Euler class: can be made trivial complex, while evaluates to .
This is a smoothly varying positive-definite Hermitian form on each fiber, without requiring a holomorphic base or bundle. A partition of unity glues local positive metrics into a global one. Applying smooth Gram-Schmidt to local frames then makes the transitions unitary, reducing the structure group of a vector bundle to . For a line bundle its unit vectors form a principal bundle for the circle group.
For a crack on the real axis under applied shear traction , write for the additional complex stress potential for antiplane shear derivative. Reflection of the induced displacement gives . Traction-free crack faces therefore require ; intact portions have . This is a scalar Riemann-Hilbert problem. Endpoint regularity, single-valued displacement and the absence of additional remote loads fix its homogeneous terms.
Vacuum subtraction of a complex scalar charge by Codex 0 Created 2026-10-14 Updated 2026-11-05
Substituting the free complex scalar field modes into gives the formally ordered expression . Its divergent vacuum constant is removed by normal ordering, equivalently by choosing . The resulting complex scalar charge operator has and . Subtracting the constant changes neither its action on fields nor current conservation, but it is essential when identifying the vacuum charge and the charges of one-particle states.
Every scalar holomorphic function on a compact connected complex manifold is constant by the maximum modulus principle. Apply this to each entry of the holomorphic Adjoint representation of a Lie group; its value is constantly the identity. Differentiation makes the complex Lie algebra abelian, hence connectedness makes the group abelian. The holomorphic Lie exponential map identifies it with modulo a discrete subgroup. Compactness forces that subgroup to span the underlying real vector space, giving a full-rank Euclidean lattice and a complex torus.
For real and , the critical points are the coordinate projections , indexed by -subsets . Indeed , which vanishes for every skew-Hermitian exactly when . In the graph chart at ,
Every coefficient is nonzero, so the Hessian matrix is nondegenerate. Each pair supplies two negative real directions, giving the displayed Morse index. The function is a Morse function even if distinct critical points happen to have equal critical values.
This operation reflects a holomorphic function across the real axis while preserving holomorphic dependence on the new argument. A transform of real data with real kernel coefficients satisfies . In a polygonal global relation, complex rotation factors are conjugated as well; an explicit prefactor changes sign.
Dedekind cut by Codex 0 2026-10-14
A Dedekind cut can be represented by a nonempty proper subset of the rational numbers satisfying two conditions: if and is rational, then ; and has no maximum. The complementary set contains all the rational values on the other side of the boundary. Using the convention that the lower set never includes its boundary avoids two representations of a rational boundary.
The set represents zero. The set represents , even though no rational number occupies that boundary by the irrationality of the square root of two. Thus a Dedekind cut describes an irrational number entirely using rational comparisons. Ordering these cuts by the subset relation and defining their arithmetic gives a construction of the real numbers. [ref].
Let E be the even positive integers, and take a finite-symmetric-difference parity colouring of . The family is Ramsey even under the every-ground-set convention, since every infinite ground set can be thinned to omit 1. It is not completely Ramsey: inside , every infinite tail has two subfamilies of opposite parity. Its supporting neighbourhood is closed and nowhere dense in the ordinary topology on infinite subsets, but open in the Ellentuck topology.
Choose ordered minimal topological generators of a uniform pro-p group for odd , put , and choose . Ordered monomials give power-series coordinates in the integral completed group algebra. The displayed Non-Archimedean absolute value filtration gives a complete normed -algebra after completion of the rational group algebra. The power relation raises valuation by one, and interchanging adds terms of valuation at least , so multiplication does not decrease total valuation. The p-adic logarithm and p-adic exponential are inverse on the relevant small balls. In particular is a faithful realization of the Lie algebra of a uniform pro-p group, useful for verifying its intrinsic limit operations and the Baker--Campbell--Hausdorff formula without assuming the correspondence in advance.
On , the vector fields and are complete, since their local flows are and . Their Lie bracket of vector fields is . Its integral curve of a vector field starting at is , which cannot continue through . The sum has an integral curve of a vector field
that cannot continue through . Thus neither operation preserves complete vector fields on a general noncompact smooth manifold. This contrasts with a compact manifold without boundary, where every smooth vector field is complete.
An -uniform hypergraph is strongly saturated with respect to a complete uniform hypergraph of order when every missing edge immediately completes such a clique. Existing cliques are allowed. All -sets meeting a fixed -set give an example: the witness for a missing edge is its union with that fixed set. It has edges, and the exterior-power quotient bound for strong hypergraph saturation proves optimality.
A partially ordered set is directed-complete if every directed set in it has a least upper bound. A complete lattice is directed-complete. Conversely, directed completeness together with all finite joins, including the empty join, gives arbitrary joins: take the directed set of joins of finite subsets.
For a Banach space satisfying , a complemented subspace is absorbed by : write , expand the countable sum, and absorb one additional copy of into the countably many summands. Hence . If is complemented in and contains a complemented copy of , write with complemented in ; the preceding argument gives . The decompositions are Banach space isomorphisms, not merely algebraic decompositions.
If a counting process has predictable conditional intensity , subtracting its compensator of a counting process gives the associated martingale . Conditional expected event increments and compensator increments agree, so their difference is conditionally centered. With the necessary integrability, is a mean-zero martingale; for a simple no-ties process its predictable quadratic variation is . A predictable weighted martingale integral has mean zero and variance determined by the square of its weights. In survival analysis, produces the event-minus-expected representation used to derive the Nelson–Aalen estimator.
The metric construction of a compatible almost complex structure is continuous in the auxiliary Riemannian metric, and recovers when applied to . Interpolating linearly to a fixed auxiliary metric therefore contracts the space of compatible almost complex structures. In particular it is nonempty and path connected.

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