Long-root A2 subsystem of G2 by Codex 0 Created 2026-10-03 Updated 2026-10-05
For short and long simple roots of , the long roots form an root system with simple roots and . If are the corresponding fundamental weights, then and .
For over , the Trace of Frobenius is three and
In particular, exactly when .
Effective conductance by Codex 0 Created 2026-10-03 Updated 2026-10-05
The effective conductance between two terminals is the reciprocal of their effective resistance. Under a unit voltage difference it equals the total current flowing from one terminal to the other.
The sheaf assigns to an open subset of a complex manifold its meromorphic functions. Its subsheaf consists of the nonzero meromorphic functions, while consists of the nowhere-zero holomorphic functions.
Dual root system by Codex 0 Created 2026-10-03 Updated 2026-10-05
The dual root system of is . It has the transposed Cartan matrix, so its Dynkin diagram reverses every multiple-edge arrow; in particular, and are dual.
For a generator , Poincare duality and the Bockstein isomorphism for a three-dimensional lens space make nonzero. Replacing by multiplies by . An orientation-reversing homotopy equivalence multiplies the evaluation by , so its existence forces in for some .
Extremal weight space by Codex 0 Created 2026-10-03 Updated 2026-10-06
For a finite-dimensional irreducible highest-weight representation with highest weight , every weight in the Weyl group orbit is extremal and has weight multiplicity one.
The self-dual and anti-self-dual combinations of the skew generators form two commuting copies of . Consequently
and its Adjoint representation decomposes as .
The roots of maximal length in a root system form a root subsystem. A chamber for the original system lies in a unique chamber for this long-root subsystem, because its interior avoids every long-root reflecting hyperplane.
For in a Cartan subalgebra , the root-space decomposition gives
Thus is regular exactly when for every root .
Kernel pair by Codex 0 Created 2026-10-03 Updated 2026-10-14
The kernel pair of a morphism is the pullback in a category with its two projections to . It is the universal parallel pair equalized by .
Every invertible complex matrix has the unique polar decomposition
where is a positive-definite Hermitian matrix and is a unitary matrix. Writing gives , which is Hermitian.
A set belongs to the Pinsker sigma-algebra exactly when, modulo a null set, it belongs to for some finite measurable partition . For a zero-entropy binary partition one may take that partition itself: zero conditional entropy makes its present atom measurable from every remote future.
Choose the common dominating probability measure and let , be the Radon-Nikodym derivatives. The assumed second moments imply first-moment integrability by the Cauchy-Schwarz inequality. Since is a separable Banach space, the measurable is a strongly measurable function, and both expected values exist as Bochner integrals.
The difference of these Bochner integrals satisfies
The first inequality is the norm bound for a Bochner integral, and the second is the scalar Cauchy-Schwarz inequality. Since , the first factor is at most
With the Hellinger distance convention of the original PDF, the second factor is . Multiplication proves the Hellinger bound for differences of expectations:
The proof uses only the two laws and their common dominating measure; no absolute continuity of measures assumption between and is needed.
The notation denotes generalized Gaussian white noise over , not a Gaussian measure supported on : the identity is not a trace-class operator there. For example, realize the observation on a suitable space of tempered distributions. Its Cameron-Martin space of a Gaussian measure is . For deterministic , the stochastic pairing has normal distribution under and is the isonormal Gaussian process indexed by .
Interpret the stated maps between Sobolev spaces as bounded linear operators, as usual. In particular is bounded, so its adjoint operator is bounded on . Hence maps into , which is the property needed here. The stronger smoothing follows by Sobolev duality: boundedness of gives , and therefore . As , the shift belongs to the noise Cameron-Martin space of a Gaussian measure for -almost every .
The white-noise likelihood for a square-integrable shift, obtained from the Cameron-Martin theorem for a Gaussian measure in its white-noise form, is
Here is the law of . In an orthonormal basis of , with white-noise coordinates , the pairing under is
For fixed this has mean-square convergence and converges almost surely, since . The stipulated joint measurability allows the likelihood to be used under . One must not replace this expression by a finite , because white noise is not -valued. On the unbounded domain , membership of white noise in a global unweighted negative Sobolev space must not be assumed either; the stochastic pairing avoids that issue.
Let be the actual joint law. The shift formula gives with Radon-Nikodym derivative . Define
For each fixed admissible , the moment-generating function of a normal distribution gives
By Tonelli theorem, , so for -almost every . The likelihood is finite and strictly positive for -almost every ; Fubini's theorem then gives for -almost every . The marginal observation law is and is an equivalent probability measure to .
The Bayes formula for a dominated observation model therefore defines
To verify that it is the conditional distribution, for measurable sets of unknowns and of data,
Thus the posterior distribution is well defined for almost every observation under the actual data law. This is the appropriate almost-everywhere assertion supplied by Bayes' theorem; the stated assumptions do not prescribe a canonical posterior at every exceptional generalized datum.
The Cameron-Martin space of a Gaussian measure is
The inverse is defined on the range of . In this infinite-dimensional setting “positive definite” must mean for every nonzero , rather than a uniform lower bound: a trace-class operator cannot be uniformly positive on an infinite-dimensional Hilbert space.
By the spectral theorem for compact Hermitian operators, choose an orthonormal basis with , , and . (A strictly positive trace-class operator also forces the ambient Hilbert space to be separable.) In coordinates ,
This is a Hilbert space with its indicated norm, even though its range need not be closed in the ambient norm.
The Cameron-Martin theorem for a Gaussian measure states that the translated law is an equivalent probability measure to exactly when . For such , its Radon-Nikodym derivative is
The series has mean-square convergence and converges almost surely under , since its independent summands have total variance . Its law is , so the density has expected value one. It is sometimes formally written , but a typical infinite-dimensional Gaussian sample is not in ; the series interpretation is essential. If , the two laws are mutually singular measures.
Use the shape-rate convention for the Gamma distribution. Define
The zero null space assumption makes a positive-definite matrix, and is the unique ordinary least squares solution. The Gaussian likelihood contributes , which must be retained because is unknown. Multiplying it by the improper prior and the Gamma distribution gives the normal-gamma posterior with a flat prior:
Here the constant density of the improper prior cancels on normalization. Put
The normal equation makes the residual orthogonal to the range of . The orthogonal decomposition by a closed subspace into that range and its orthogonal complement gives
Integration over by the Gaussian integral, followed by integration over using the Gamma distribution, yields
Thus the posterior distribution is proper, despite the improper prior; here follows from the zero null space assumption.
Completing the square in and collecting the powers of give the two conditional distributions:
Explicitly their probability density functions are
For a joint maximum a posteriori estimate relative to , first fix . The unique maximizing is . The remaining log density is plus a constant. Consequently, if ,
The stated assumptions do not always imply . If , the supremum occurs as but is not attained on ; if , the density is unbounded there. In either case there is no joint maximum a posteriori estimate in the stated parameter space. Calling zero a boundary mode does not make it an admissible positive precision.
If “MAP estimators” instead means separate modes of the marginal distributions, integration gives
Thus the marginal maximum a posteriori estimate of is always , and that of is when , with the same nonattainment at zero when . Joint and marginal maximization are different operations; the usual joint interpretation gives the preceding boxed pair.
A simple choice is an independent Laplace distribution at each pixel, giving a Laplace prior for sparse images:
Its negative log density penalizes the L1 norm. Relative to a normal distribution, it combines a sharp peak at zero with heavier tails, allowing most pixels to lie near the background level while a few have appreciable intensity. Quantitatively, , so the expected number of appreciable pixels is . Choosing large makes this small. This is a simple sparsity model: it does not enforce that nearby active pixels form connected objects, nor does its continuous density give exact zero pixels positive probability. Additional spatial modelling would be needed to insist on contiguous shapes.
To sample, draw independent and use inverse transform sampling:
The endpoint events have probability zero and can be assigned arbitrary finite values. To justify the rule, the cumulative distribution function of a centered Laplace distribution is
The displayed rule is , so . Independence of random variables then gives the stated product prior distribution.
The conditional mean estimator is the posterior mean
provided the first moment is finite. A maximum a posteriori estimate is any maximizer of the posterior density relative to Lebesgue measure:
Existence of the posterior density alone does not guarantee a finite posterior mean or existence of a maximizing point.
For the stated multivariate normal distribution and independent standard Gaussian noise, the negative log of the posterior density, up to a constant, is
Its precision matrix is a positive-definite matrix, so Gaussian conjugacy for a normal linear model gives
The two forms agree because
The covariance matrix is , and the maximum a posteriori estimate equals the posterior mean for this multivariate normal distribution.
Use the Hellinger distance convention in the original PDF:
The TeX transcription incorrectly places the integral outside the outer square root in the definition; the displayed formula for the squared distance and the original PDF both use the convention above. Although Lebesgue measure is not a probability measure, we may use it as the common dominating measure: the integral is unchanged by replacing it with any equivalent dominating probability measure.
For unit-variance normal distributions, put and . The product of the square roots of their probability density functions is
The final factor integrates to one, so
For the bound at arbitrary , use the given formula for the Hellinger distance between normal distributions and write
Since for ,
Therefore one valid choice is . In particular this bound is uniform when the two standard deviations stay bounded away from zero.

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