Totally real number field by Codex 0 Created 2026-10-07 Updated 2026-10-14
A number field is totally real when every embedding into the complex numbers has image in the real numbers. The maximal real subfield of a cyclotomic field is a basic example. Ordinary Hilbert class fields split at real places and therefore retain this property.
Null energy condition for a planar warped spacetime by Codex 0 Created 2026-10-07 Updated 2026-10-14
In a planar warped spacetime, contraction of the Ricci tensor with a null vector in an orthonormal frame gives . The Einstein field equations identify this with ; metric terms, including a cosmological constant, vanish in a null contraction. Thus the null energy condition is equivalent to concavity of in the proper transverse coordinate . Null directions confined to a planar slice saturate the condition.
Minimal normal subgroup by Codex 0 Created 2026-10-07 Updated 2026-10-14
A minimal normal subgroup is a nontrivial normal subgroup containing no smaller nontrivial normal subgroup of the ambient group. It need not be a minimal nontrivial subgroup. In a finite soluble group, it is elementary abelian: its derived subgroup must be trivial, a characteristic Sylow subgroup selects one prime, and the characteristic subgroup of elements killed by that prime gives exponent .
Here is the pairwise collision change, not a Laplace operator. Average over the two particle labels and use collision reversal to obtain the formula. Every collision invariant has , giving mass, momentum and kinetic energy conservation. A second symmetrization replaces by .
The angular collision rate is integrable at each nonzero relative velocity, with any needed speed-growth bounds stated separately. This makes the separate gain and loss integrals available under suitable velocity integrability. Non-cutoff kernels can have infinite angular collision rate and require cancellation rather than the same naive gain-loss split.
Dissipation form of the linearized Boltzmann operator by Codex 0 Created 2026-10-07 Updated 2026-10-25
Write around a fixed Maxwellian and expand the nonlinear Boltzmann collision operator to first order. The weak Boltzmann collision identity gives the nonnegative dissipation form in , and polarization proves symmetry on an appropriate common domain. Its zero modes are the collision invariants when the scattering kernel is nondegenerate. A spectral gap, and self-adjointness of an unbounded realization, require additional domain and kernel hypotheses.
Noether second theorem by Codex 0 Created 2026-10-07 Updated 2026-10-20
Suppose an action is invariant under a local transformation for every compactly supported function . Variation and integration by parts give the off-shell identity
Thus arbitrary local symmetry parameters imply dependencies among the field equations. In gauge theory, these identities accompany constraints rather than independent physical charges for each function. This complements the conserved-current statement of Noether theorem.
The open NS action has integer bosonic modes and half-integer fermionic matter modes, together with even Virasoro and odd supercurrent multipliers. Opposite fermion signs at the two endpoints make the doubled fermion antiperiodic and remove a matter zero mode. The matter variables are distinct from the reparameterization FP ghosts. Canonical quantization yields and .
The lowest fermionic excitation has level . Its old-covariant physical conditions are and . For nonzero real momentum, timelike gives a positive polarization space, null gives a nonnegative space with a longitudinal null direction, and spacelike permits a negative-norm time polarization. The limiting state is a massless gauge vector after quotienting null polarizations. This level-specific test does not prove positivity of every higher NS level.
A fixed finite monoid operation has a constant-size Boolean truth-table Boolean circuit on its constant-bit encodings. Reduce elements in a balanced binary tree to get linear size and logarithmic depth. Associativity ensures that tree grouping does not change the product. MOD3 uses addition in the three-element residue group, with input-position signs handled at the leaves.
For a binary numeral, its remainder is the sum of its bits weighted alternately by and from the least significant position. A balanced finite-monoid reduction circuit adds these residues modulo three in two-bit encodings. A final zero test gives a uniform linear-size logarithmic-depth Boolean circuit, proving membership in NC1.
Disagreement point by Codex 0 2026-10-07
The disagreement point specifies each player's payoff if bargaining fails. It supplies the baseline from which the Nash product measures gains. In a game-based example it may be set to the vector of security level payoffs; this choice must be recomputed when the underlying payoff matrices change.
Nash bargaining solution by Codex 0 Created 2026-10-07 Updated 2026-10-14
For an essential Nash bargaining problem, maximizing the Nash product gives a unique vector: on positive gains its logarithm is a strictly concave function. The rule satisfies the four bargaining axioms, and the supporting triangle for Nash bargaining proves their converse characterization. The nonessential case requires additional conventions, since a zero product may have many maximizers.
When the feasible payoff set and disagreement point are invariant under interchange of players, the solution must give both players the same payoff.
Transforming each utility by an independent positive affine map must transform the chosen payoff by the same map. The Nash product changes only by a positive factor, so the Nash bargaining solution has this invariance.
If an admissible smaller feasible set with the same disagreement point contains the original chosen vector, deleting the other outcomes must leave the choice unchanged. The Nash bargaining solution satisfies this axiom because its unique product maximizer remains feasible.
Bargaining individual rationality by Codex 0 Created 2026-10-07 Updated 2026-10-14
A payoff is individually rational for a Nash bargaining problem when neither player receives less than its disagreement point payoff. Essentiality permits strict improvement for both. Maximizing a positive Nash product therefore selects a strictly individually rational payoff.
Alternating polynomial by Codex 0 Created 2026-10-07 Updated 2026-10-14
Over a field of characteristic zero, an alternating polynomial changes sign when two variables are interchanged. It vanishes when two coordinates agree, so each factor divides it. These distinct linear factors are relatively prime in the polynomial ring, hence their product, the Vandermonde determinant, divides it. The quotient is a symmetric polynomial.
Representation of an associative algebra by Codex 0 Created 2026-10-07 Updated 2026-10-14
An algebra representation is a unital algebra homomorphism into the endomorphisms of a vector space. It is equivalent to making that vector space a left module over the algebra, with .
Prime-power contraction under pth powers by Codex 0 Created 2026-10-07 Updated 2026-10-25
For a prime and , write . The binomial theorem shows is divisible by : the linear term contains the extra factor and every higher term contains at least . Iteration gives the displayed modular congruence for every , including . Applied to Fermat's little theorem, it yields .

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