Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Two hyperbolic lines are ultraparallel when they are disjoint and have no common ideal endpoint. They possess a unique common perpendicular, which realizes the distance between them.
The Hubble constant is the present value of the Hubble parameter. The word "constant" fixes the epoch; it does not mean stays unchanged throughout cosmic time. It sets the present instantaneous proportionality in Hubble's law and the approximate nearby observed redshift-distance relation.
For illustration, stipulate ; this is an example input, not a claim about a measured consensus value. A million parsecs is , givingHere a year means days of , and denotes a billion such years. The parsec conversion follows [ref]
https://arxiv.org/pdf/1510.06262. IAU 2015 Resolution B2, note 4
. This Hubble time is a present expansion timescale; the age of an FLRW universe also depends on the earlier evolution of the scale factor and need not equal .Every open subset is the directed union of finite unions of closed rational cubes contained in . Every compact subset of lies in one such finite polyhedron, whose homology is finitely generated. The homology of a directed union therefore expresses each as a direct limit over a countable family of countable groups, so it is countable.
The zeroth homology group is the free abelian group on the path components of . In particular, if has finitely many path components, then
On a compact oriented Riemannian manifold without boundary, the codifferential is the adjoint operator of the exterior derivative. ConsequentlyEvery eigenvalue of the Hodge Laplacian is therefore nonnegative.
For an associative -algebra and an -bimodule , Hochschild cohomology is the cohomology of the Hochschild cochain complex, whose degree- term is . Its differential measures compatibility with multiplication and the two module actions.
One has and . Thus degree zero detects central elements, and degree one detects derivations modulo the inner derivations. Degree two classifies suitable square-zero extensions and describes first-order deformations of multiplication, making this a useful invariant of algebra structure.
For a unital associative -algebra and an -bimodule , Hochschild homology is the homology of the complex . Its boundary multiplies neighboring algebra entries, with the first and last terms using the two actions on .
In degree zero, . In particular, is the vector-space quotient by commutators. If is commutative, this degree-zero quotient is simply . Higher groups retain information lost by that quotient and connect algebraic multiplication to differential forms in smooth commutative settings.
Hilbert class field of Q of square root minus six by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The ideal class group of has order two, andThis quadratic extension of is unramified at every finite prime and therefore has the degree required of the Hilbert class field.
Two-spin Heisenberg Hamiltonian in an opposing longitudinal field by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For two spin-one-half particles,has two eigenvalues and two further eigenvaluesFor positive , the zero-field limit has a unique spin-one-half singlet state ground state and a triply degenerate spin-one-half triplet state excited level.
A Lagrange top is an axisymmetric rigid body with one point fixed on its symmetry axis, moving in a uniform gravitational field with its center of mass on that axis.
For a two-dimensional system of fixed area , the heat capacity at constant area is when the particle number and other conserved quantities are also fixed. It is the two-dimensional analogue of heat capacity at constant volume.
The minimum distance of a code is the least Hamming distance between distinct codewords. For a linear code, translation invariance makes this equal to the least Hamming weight of a nonzero codeword.
A standard finite-horizon linear-quadratic problem uses linear dynamics and minimizeswhere are symmetric positive semidefinite matrices and is positive-definite. The control input is unrestricted in Euclidean space. These hypotheses, rather than the word quadratic alone, make the control minimization well posed.
The value function has the quadratic form . Substitution into the Hamilton-Jacobi-Bellman equation and completion of the control square giveThus a backward matrix Riccati equation gives a linear feedback control. [ref]
Underactuated Robotics by Russ Tedrake. Underactuated Robotics by Russ Tedrake, chapter8, Finite-horizon LQR
For the scalar system , terminal cost zero and running cost , the solution is and . Differentiation verifies . Infinite-horizon formulas need additional stabilizability and detectability conditions; they do not follow from an arbitrary quadratic cost.
The matricesgenerate a free monoid in . Hence the positive words of length are distinct and has exponential growth of a group.
A finitely generated group has polynomial growth when, for some constants , its growth function of a finitely generated group satisfiesThis property is independent of the finite generating set .
For a profinite group and a finite or profinite coefficient ring , the completed group algebra iswhere ranges over the open normal subgroups. It records convergent noncommutative power series in topological generators of .
Let on and put . If , then the Parseval identity givesConsequently correlates with a quadratic phase: for some ,
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





