Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The stabilizer of a line in is , giving the homogeneous space . Its classifying-space Serre fibration has rationally acyclic fiber for odd , so its cohomological Serre spectral sequence has only its degree-zero row and gives the displayed restriction isomorphism. The factor is itself rationally acyclic. For even , the fiber has a top rational class, with determinant-sign monodromy, so the one-row argument fails. The top universal Pontryagin class is nonzero on but vanishes on restriction to , witnessing genuine failure of stabilization.
A classification tree partitions predictor space recursively and attaches a class probability vector to each terminal region. For a categorical response, a fitted leaf commonly uses its observed class proportions and predicts their largest entry. Binary numerical splits compare one coordinate with a threshold. Growing a tree greedily by reducing classification-tree deviance gives an interpretable rule but does not globally optimize the tree. Cost-complexity tree pruning and cross-validation control complexity and assess prediction error.
The misclassification rate is the expected zero-one loss of a classification in statistical learning rule. Its empirical version is the fraction of incorrectly labeled observations. Evaluation on the fitting sample gives a training error; evaluation on an independent test set estimates prediction error. For a majority-class leaf of a classification tree, the training error count is , unlike classification-tree deviance, which also uses the fitted class probabilities.
Let be a domain satisfying both Ore conditions, with quotient division ring . A matrix over is regular exactly when it is invertible over : a kernel vector of a singular matrix can have its denominators cleared to give a nonzero annihilator over . An upper triangular matrix is regular exactly when all diagonal entries are nonzero. Each finite list of entries of a matrix over has a common left denominator . Thus it is a fraction with denominator , proving the displayed classical localizations. The triangular localization retains its strictly upper triangular nilpotent ideal; it is not a semisimple matrix ring.
An adapted process is of class DL when, for every finite , the family is uniformly integrable. A local martingale is a true Martingale exactly when it has this property. This is a local-in-time condition, not Uniform integrability over the whole half-line.
// Target: probability-and-statistics.bigb
A one-period quadratic hedge minimizes over deterministic holdings, where is the riskless gross return, , and the covariance matrix is invertible. For a square-integrable claim, the unique solution is and . Centering separates the squared bias from the quadratic error. Completing the square gives the excess error as after the bias is minimized. Unlike claim replication, the residual need not vanish.
Closed-streamline threshold for a circular topographic anticyclone by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For the circular topographic anticyclone in a positive uniform current , the opposing disturbance speed is at most . Below the displayed threshold remains positive everywhere, so no streamline can close. Above it an interior stagnation point at is a center, while the exterior point is a saddle. At equality the two meet at the rim. This is the onset criterion; once closed contours form, the potential vorticity of trapped fluid is not determined solely by its present upstream conditions.
Every supporting centre of an arc between fixed endpoints lies on their perpendicular bisector. Multiplicity at least therefore makes that line contain at least of the original points. For each such line containing points, its centres each support at most circles; on one circle at most two consecutive-point arcs have that symmetry axis. The rich line bound summed over dyadic occupancies gives the displayed bound.
Put and , where . The circle component of is . Since , its integral equals three copies of up to a boundary term. The coefficient therefore becomes after circle integration. Boundary terms and global potential patching must be retained when the spacetime has boundary or nontrivial flux topology.
Fix a holomorphic function on a neighbourhood of a closed disk, with . On an interval of positive radii whose circles contain no zeros of a function, differentiating Jensen's formula with respect to givesEach interior zero of a function contributes slope one for each unit of its multiplicity of a zero. Between consecutive zero moduli, is an affine function; passing the modulus of a zero of multiplicity of a zero increases the adjacent slopes by . The finite sum defines a continuous convex function of whose values agree with the circle log-mean of a holomorphic function at every boundary-zero-free radius. This describes the adjacent line segments without asserting a boundary-singularity extension of the integral.
For a polynomial with , no polynomial root at zero, and different from every , Jensen's formula gives the displayed expression. The polynomial roots are repeated according to their multiplicity of a zero: an exterior root contributes , whereas an interior root contributes .
For an explicit example, take the polynomialIts two simple zeros are and . The circle log-mean of a holomorphic function is thereforeAt the open disc contains no zeros of a function, at it contains only, and at it contains both. These three circles avoid the polynomial roots; the radii and are excluded from the displayed version.
The zeros of inside three concentric disks
. The three boundary circles enclose respectively zero, one and two simple zeros. Each zero contributes to Jensen's formula only after the radius exceeds its complex modulus. Details.The corresponding values of the circle log-mean of a holomorphic function and the circle geometric mean of a holomorphic function areFor example, at the contribution of the sole interior zero of a function is ; adding it to gives . The second polynomial root still affects , but contributes no additional interior-zero term at this radius.
The continuous angular geometric mean of the positive boundary complex modulus isHere the empty product is one. This differs from the angular arithmetic mean . In general by the concavity of the logarithm; equality requires constant boundary complex modulus. For a holomorphic function with no zeros of a function in the closed disk, Jensen's formula gives , even when the boundary complex modulus varies with angle. Thus replacing the mean of a logarithm by the logarithm of an arithmetic mean loses the exact zero identity.
For every finite simple graph, Vizing's theorem givesHere is the maximum degree of a graph, taken as zero when there are no vertices. A bipartite graph has the stronger equality . The six-job complete bipartite graph above attains this lower bound, while the triangle in a graph attains the extra-colour alternative. The simple-graph restriction in the upper bound matters.[ref]
The bipartite graph equality still holds for finite loopless multigraphs, with parallel edges counted separately in each vertex degree. For instance, parallel jobs between two resources need exactly slots: every pair conflicts, and . For a general finite loopless multigraph, however, the simple graph upper bound can fail. Put two parallel edges on each side of a triangle in a graph. All six edges pairwise share a vertex, so each needs its own colour; every vertex has degree of a vertex four. Consequently . A multiplicity-aware bound is , where is the largest number of parallel edges between a pair of vertices. The doubled triangle in a graph has and attains that bound. These statements exclude self-loops; the two-distinct-resource scheduling model excludes them too.[ref]
Line graphs and edge coloring. Line graphs and edge coloring, slide 2: bipartite multigraph equality, multiplicity bound and fat triangle
For historical orientation, Graph Theory by Reinhard Diestel (Colouring preview, §5.3, p. 132) dates the bipartite equality to 1916 and Vizing's theorem to 1964. These are textbook attributions; the original papers have not been inspected here. The results state existence of optimal or nearly optimal proper edge colourings, rather than saying that arbitrary greedy choices will find them. The list-chromatic index asks the further question of success for every sufficiently large family of allowed-colour lists.
A rational map is smooth as a map between compact round spheres, including at its poles in reciprocal coordinates. Its spherical differential norm therefore has a finite supremum . Integrating along a shortest spherical geodesic gives . Since , we obtain . In finite coordinates the differential norm is , extending continuously to the whole sphere. This uniform bound is useful for passing equicontinuity through compositions.
Use the unnormalized Choi matrix , which has trace for a channel. A positive such matrix has a spectral decomposition with vectors . In paired bases define the Kraus operator by , so . Partial contraction with a conjugate index vector gives , hence . Rank-one projectors span the operator space, proving the Kraus representation on all inputs. Trace preservation is equivalent to . This construction needs at most nonzero Kraus operators.
Let , and . The canonical anticommutation relations imply and . The Leibniz rule for the commutator, together with and , gives the displayed transformations. These are equal-time operator relations; common nonzero quark masses remove conservation of the charges without changing their canonical action on the fields.
A nonzero vacuum value of the scalar quark density breaks the massless nonsinglet chiral symmetry to its diagonal vector subgroup. Indeed, the nonsinglet axial charge algebra of quark densities gives , whereas invariance of the vacuum under every conserved axial charge would make these expectations vanish. The three broken generators produce three massless Goldstone bosons in the exact chiral limit. Small equal quark masses explicitly break that symmetry and turn the pions into pseudo-Goldstone bosons, with squared masses linear in the quark mass at leading order.
Uniqueness of the two-derivative two-flavour chiral action by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For with , the chiral group acts transitively. A derivative-free invariant is therefore constant. At , its diagonal stabilizer acts on tangent vectors by the irreducible three-dimensional rotation representation; the only invariant symmetric metric is a multiple of . Transporting this metric gives the displayed unique Lorentz-invariant two-derivative action up to normalization and total derivatives. Equivalently, is traceless, eliminating a separate double-trace invariant. Writing and using gives canonically normalized pion kinetic terms.
For condensate normalization , replacing the condensate matrix by maps the real quark mass matrix to . Since , expansion gives a constant minus . Comparison with gives the displayed common leading mass. Strong isospin-breaking mass splitting enters beyond this leading action; electromagnetic effects are also excluded.
The relation uses for the tautological line on the projectivization of . It follows from the rank of the complementary bundle and Whitney multiplication. The alternating signs are ring subtraction; they do not assert that the First Chern class of a dual line is the additive negative in complex cobordism, where duality uses the formal-group inverse.
// Target: geometry-and-topology.bigb
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







