Use coordinates in which and write the defining cubic as
with homogeneous polynomials of degree two. Their restrictions , have no common zero: at such a zero all first partial derivatives of would vanish. The rational projection therefore extends to a morphism of algebraic varieties
Indeed, wherever , the surface equation gives , which remains regular on ; the analogous formula works wherever .
For the plane with , , its plane section is together with the residual plane conic
These residual plane conics are exactly the fibres of a morphism of , giving the conic bundle from a line on a smooth cubic surface. The family itself is smooth: off it is the graph of projection, and over the condition chooses the unique value .
Write with and symmetric. The degrees of its entries in are
Thus the conic discriminant is a homogeneous polynomial of degree five.
Smoothness also shows that every zero of is simple and has matrix rank two. To see the first point, at a rank-two singular fibre let span the kernel and use a local base coordinate . All fibre-coordinate derivatives vanish at , so smoothness of the total family requires . Since the adjugate matrix of a rank-two symmetric matrix is a nonzero scalar multiple of , the determinant derivative is nonzero. If the rank were at most one, the projective kernel would contain a line, on which the quadratic has a zero over the algebraically closed field; that point would be singular in the total family. This proves the reduced singular fibres of a smooth conic bundle assertion and also rules out vanishing identically.
The discriminant quintic of a cubic surface conic bundle consequently has five distinct zeros in . At each, a rank-two plane conic splits into two distinct projective lines . Neither equals : that would require to vanish identically, making proportional, contrary to their having no common zero. The original plane section is therefore , proving the required coplanarity and giving five distinct pairs.
Every unitary matrix is unitarily diagonalizable. Part (ii) therefore proves the stronger matrix statement , not merely a statement about its eigenvalues. The kernel of a group homomorphism is a normal subgroup, and it contains every upper unipotent. By part (iii) their normal closure is the entire group. Thus
This proves the triviality of finite-dimensional unitary representations of SL2R. In fact the argument used only the algebraic homomorphism property and finite-dimensional unitarity; it did not need continuity.
Let be the normal closure of the upper unipotents . Conjugation by gives
Thus also contains every lower unipotent . We prove explicitly that these elementary unipotent generators of SL2R generate the full group.
For , multiplication gives
So all determinant-one diagonal matrices lie in . If has and , then
because its lower-right entry is . If , then and left multiplication by makes the upper-left entry equal to . The resulting matrix lies in by the preceding factorization, and restores . Therefore
Put . Applying the group homomorphism to the identity just proved shows that is conjugate to for every positive integer . Thus the multiset of its eigenvalues is unchanged by taking their th powers.
Take . The fourth-power operation permutes this finite multiset. For each eigenvalue , iterating its permutation cycle gives for some positive integer . Since is unitary, , so : every eigenvalue is a root of unity. Choose a positive integer divisible by all their orders. Every eigenvalue of is then one. Because its eigenvalue multiset is also the original one, we obtain
This is square-power rigidity of a finite nonzero spectrum. Finiteness of the dimension is essential to the permutation-cycle argument.
Let , so and . Multiplication gives
The nilpotence also gives for every nonnegative integer , since all higher binomial terms vanish. Hence, for each positive integer ,
These are unipotent matrices in SL2R. The integer is positive, since the displayed diagonal matrix is undefined at .
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.

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