Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a -independent solenoidal magnetic field, the transverse components can be written and . Contours of are transverse magnetic field lines. The independent axial component can twist the flux tube. Under the MHD induction equation, an additive time-dependent gauge can be chosen so that .
For , the relative potential generates density . In unit scales the separable augmented density is . Its Jeans moments from an augmented density give constant anisotropy .
In unit scales . The local virial relation of the hypervirial model gives global energies and . Restoring physical scales multiplies each integral by .
A container fingerprint is a small vertex subset , usually contained in a hypergraph independent set , which determines a container containing . A deterministic membership-query algorithm records positive answers in and uses negative answers to remove vertices from the container. Reconstruction from follows the golden rule for container algorithms.
A container algorithm may use membership in the unknown independent set only through information recorded in its container fingerprint. With a deterministic ordering and deterministic tests, record every positive queried vertex; queried negative vertices can be excluded. All state updates must be recoverable from the fingerprint alone, so replaying the algorithm constructs a container without knowing the independent set.
For fixed uniformity, sufficiently small nonsingleton hypergraph codegrees relative to permit a family of containers whose degree measures are bounded below one by a fixed amount. Each container has a container fingerprint of size . Iteration gives containers inducing at most an arbitrary fixed proportion of all hyperedges, with logarithmic family size . The constants depend on the uniformity and desired edge proportion, and the average degree must be positive.
For a simply connected space, if lower homotopy groups lie in an admissible Serre class, the Hurewicz map in the next degree is an isomorphism modulo that class, and the lower homology groups lie in the class. This applies to finitely generated groups and to finite groups supported at prescribed primes.
A Huber loss applied to a discrete gradient combines quadratic penalization of small slopes with linear penalization of large slopes. This interpolates between squared-gradient smoothing and total variation denoising, allowing smooth regions while retaining an edge-preserving large-gradient regime. The threshold should be chosen consistently with the signal's units and discretization. It can reduce staircasing in total variation denoising without guaranteeing its elimination.
Suppose has degree in and a nonzero constant leading coefficient . Among the heights , at least one satisfiesat each real . Factor into linear factors with multiplicity. Each root's imaginary part can be within distance less than one of at most one candidate height. The pigeonhole principle leaves a height whose distance from every root is at least one, proving the product bound. The height can be chosen measurably: the set where a candidate succeeds is the closed intersection of over rational , and selecting the first successful candidate gives a Borel set partition. This avoids any need for continuous global root labels.
Let and precompose with a sphere self-map of topological degree . The resulting map of mapping cones is the identity on the bottom -cell and has degree on the top -cell. Pulling back the defining cup product relation for the Hopf invariant multiplies its coefficient by . In particular the element has Hopf invariant . Postcomposition by a degree- map of the target sphere instead multiplies the invariant by .
For the Hopf map , the indicated four-cell attachment has cellular boundary multiplication by from dimension four to three. Its integral cohomology is in degrees zero and two, in degree three, and in degree four. If generates degree two and is the four-cell cochain class, then , with every other positive-degree product zero. Collapsing the three-sphere reduces the cup-square calculation to the Hopf invariant; the induced map on degree-four cohomology reduces its integer coefficient modulo . When there is an extra free degree-three class, whose products still vanish by dimension.
Hertzsprung-Russell slope of a stellar homology sequence by
Codex 0 Created 2026-10-06 Updated 2026-10-14
For a stellar homology sequence with and , the Stefan–Boltzmann law gives . Eliminating mass gives the displayed Hertzsprung-Russell diagram slope when . The usual horizontal axis decreases in temperature toward the right, reversing the visual left-to-right sign. The relation is between logarithmic variables and depends on the specified structural assumptions.
Continuity and uniqueness of holomorphic functional calculus by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Equip the space of holomorphic functions on an open neighborhood of with the compact-open topology. A fixed admissible contour givesso the holomorphic functional calculus is continuous.
It is the unique continuous unital algebra homomorphism from to sending the coordinate function to . A unital algebra homomorphism must send each inverse coordinate difference to the corresponding resolvent of an element, so its values on rational functions with poles outside are forced. The Runge theorem makes those rational functions dense for the compact-open topology; continuity then forces all remaining values. This last step requires the stated continuity hypothesis.
The closed unital algebra generated by a bounded operator and all its resolvents is commutative, because the generators commute. It has exactly the original operator spectrum at that operator: all required inverses outside that spectrum were included, and an inverse in the smaller algebra is also an operator inverse. This permits commutative-algebra linear functional calculus without replacing the spectrum by the possibly larger spectrum of a polynomial-generated algebra.
For equiprobable quantum code states with average decoding error , data-processing inequality for quantum relative entropy applied to the binary test for quantum decoding success givesfor . Here is binary entropy. The case is trivial. Taking the supremum over allowed input distributions yields a code-size bound in terms of the largest Holevo quantity; at the undivided inequality is vacuous.
Write with an integer and , using at integer . For , subtract its degree- Taylor polynomial at . For , the integral Taylor remainder with is bounded using the Hölder seminorm; for this is exactly Hölder continuity. The resulting bound is the displayed estimate. At integer order, the convention is ; a function on a compact closed interval also obeys this estimate.
On a compact oriented Riemannian manifold of dimension four without boundary, every exact three-form has a self-dual two-form primitive. Write and use the Hodge decomposition theorem to split . Then . For , the codifferential identity and the fact on two-forms give , so . Thus satisfies and . It is twice the self-dual projection of , rather than the projection itself.
Finite subsets of a well-quasi-ordering, compared by Hoare domination preorder, form a well-quasi-ordering. Enumerate each finite subset as a word and apply Higman lemma: a subsequence embedding with increased letters supplies a domination witness for every source element. This does not assert the same result for the full power set.
Hitting probability is the minimal nonnegative harmonic extension by
Codex 0 Created 2026-10-06 Updated 2026-11-05
The hitting probability of a set is one on that set and transition-harmonic elsewhere by the Markov property. Finite-horizon hitting probabilities begin at the boundary indicator and increase through the same positive transition recursion. Any nonnegative solution dominates every iterate; monotone passage to infinite time shows that it dominates the Hitting probability. This proves minimality without requiring almost-sure hitting.
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





