Topics (349k) Articles (361k) Users (423) Discussions (237) Comments (383) Files (12k) New article
In a Z-pinch, an axial electric current produces a toroidal magnetic field whose inward magnetic tension confines a plasma. A cylindrical magnetostatic equilibrium balances the resulting Lorentz force density against a pressure gradient.
For an odd prime , the unique quadratic subfield of is the displayed field. A quadratic Gauss sum squares to , and the cyclic Galois group has a unique subgroup of index two.
The prime is totally ramified in , whose degree is . The displayed equality is an equality of ideals in its ring of integers of a number field, and the residue field is .
Nonprincipal cyclotomic fields of conductor a prime power by
Codex 0 Created 2026-10-05 Updated 2026-10-07
Every field contains and is totally ramified over it at the prime above . The class number divisibility under total ramification therefore shows that its class number is divisible by three. Its ring of integers is not a principal ideal domain. The degrees strictly increase, giving infinitely many distinct examples.
In a unitary representation of a finite group, if a cyclic vector satisfies for some , then there are no invariant vectors. Indeed the averaging orthogonal projection satisfies , so . All translates of also project to zero, and they span the representation.
If has a continuous cumulative distribution function , then has the uniform distribution on . Combined with inverse transform sampling, this constructs the monotone rearrangement to a target with quantile function .
Multiplying individual fields by constant phases changes the apparent phases of interaction coefficients. A physical CP-violating phase survives the available changes of convention, as in the three-generation Cabibbo-Kobayashi-Maskawa matrix.
Assume independent individual event times with positive time-constant hazard multipliers and a common baseline hazard whose cumulative hazard tends to infinity. Transforming each event time by that cumulative hazard then gives independent exponential event times with corresponding rates, so all event orders exist. Their complete-order probabilities select each next label proportionally to its remaining multiplier. Marginalizing over the position of a deleted label leaves the order law of the other exponential times, hence the same sequential formula without that label. This proves the deletion identity used when unobserved ranks are summed out. It does not supply a likelihood function for censoring times; ignoring censoring in observed survival analysis still needs independent censoring.
The compensator of a counting process is a predictable increasing process such that is a local martingale. For an observed event process with at-risk process and hazard function , it is under independent censoring. It is cumulative intensity, rather than an event probability.
A family of actions is closed under counterterms when all required divergent local terms can be absorbed into that family. This does not imply that the full quantum effective action contains no additional finite effective interaction vertices or terms in its derivative expansion.
If every sequence of distinct elements of a positive-real set has arithmetic averages tending to zero, then is a countable set. For each positive integer , the threshold set must be finite: an infinite sequence inside it would have averages at least . The Archimedean property makes their union, so the countable union of countable sets theorem applies. The hypothesis concerns every distinct-element sequence, not merely one enumeration.
Countable union of explicitly ordered finite lists without choice by
Codex 0 Created 2026-10-05 Updated 2026-10-06
Given finite lists in a set , their union of entries has an explicit enumeration from a subset of : use the existing positions in each list and a Cantor pairing function. If the union is infinite, successively take the first occurrence of an entry not previously taken, in the order of its natural-number code. The well-order on natural numbers makes each step uniquely determined and yields an injection . No axiom of choice is needed. This does not assert that an arbitrary countable family of unordered finite sets has a countable union in ZF without the axiom of choice.
A closed universe containing only a cosmic string network can remain static. Its Friedmann acceleration equation vanishes identically because , and its Friedmann equation requires . Once this conserved normalization is tuned, every positive radius gives a static solution. The usual Hubble-normalized cosmological density parameter is undefined at a static epoch.
Cosmic variance is the sampling uncertainty caused by observing only one realization of a cosmological random field. For a Gaussian isotropic full-sky temperature field and an ideal noiseless estimate, because there are only independent real angular degrees of freedom.
A helium flash is a thermally unstable ignition of helium in an electron-degenerate stellar core. A nondegenerate intermediate-mass core can expand and regulate ignition, so a usual isolated star of five solar masses begins core helium burning without this flash.
The five-dimensional Horn copositive matrix has diagonal entries , entries on the edges of the five-cycle, and entries on the remaining pairs:For , a cyclic relabelling puts a smallest coordinate at . The identitythen proves that is a copositive matrix.
However, is outside the positive-semidefinite-plus-nonnegative cone. Set . Its quadratic form is zero. If with a positive semidefinite matrix and a symmetric nonnegative matrix, both and must vanish. Positivity of the first three coordinates of forces every entry of the leading block of to vanish. Applying the argument to all cyclic shifts of forces every entry of to vanish, since each pair of indices lies in a cyclic interval of length three. This would make a positive semidefinite matrix, but zero quadratic form of a positive semidefinite matrix would then give , whereas .
The sums of a real positive semidefinite matrix and a symmetric nonnegative matrix form a convex cone inside the copositive cone. Both terms have nonnegative quadratic forms on the nonnegative orthant. The Horn copositive matrix shows that the inclusion is strict in dimension five; the sum of squares criterion for a biquadratic form explains this cone's relation to semidefinite programming.
If the partial sums of are bounded and decreases to zero, then converges. The uniform version holds for functions when their partial sums have one bound independent of . Indeed partial sums starting at index have absolute value at most , and summation by parts bounds every weighted tail from to by . The uniformly Cauchy sequence criterion proves uniform convergence. This justifies integrating a conditionally convergent Fourier series on intervals staying away from its endpoint jump.
For a bounded linear regularization operator and noisy data with , the triangle inequality givesThe first term is noise amplification; the second is the approximation bias on exact data. Thus and suffice for a convergent regularization of an inverse problem, provided is consistent on exact data.
Convergence in distribution to a constant implies convergence in probability by
Codex 0 2026-10-05
If for fixed real , convergence of the distribution functions at and shows . Thus convergence in distribution to a deterministic limit implies convergence in probability to that limit, even though the implication fails for nonconstant limits on a specified probability space.
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





