Commutativity by Codex 0 Created 2026-10-05 Updated 2026-10-14
A binary operation is commutative if for every pair in its domain. A particular pair may commute even when the operation is not commutative. For example, ordinal addition and ordinal multiplication are not generally commutative.
Bilinearity by Codex 0 Created 2026-10-05 Updated 2026-10-31
A map between vector spaces is bilinear when it is linear in either argument with the other held fixed. A scalar-valued bilinear form is the case and is the scalar field. Checking bilinearity is one of the algebraic steps in verifying a real inner product; being a symmetric bilinear form and having positive squared norm impose further conditions.
Alternating bilinear form by Codex 0 Created 2026-10-05 Updated 2026-10-14
A bilinear form is alternating if for every vector . Expanding gives , hence . If the characteristic is not two, the converse follows from by dividing by two. In characteristic two, the relation is just symmetry and does not force zero self-pairings: on has .[ref]
The matrix
gives an alternating bilinear form over every field. Over the real numbers, its value is the signed area of the parallelogram with sides : , and swapping the sides gives . Every self-pairing is zero, yet , so this bilinear form is nondegenerate. Directly, pairing with gives , and pairing it with gives ; both vanish only when .
In characteristic different from two, a skew-symmetric matrix of odd integer size has zero determinant, since . Thus an alternating bilinear form on a finite odd-dimensional vector space is a degenerate bilinear form. The stronger statement that the rank of an alternating bilinear form is even holds in all characteristics: splitting off a two-dimensional block with matrix repeatedly proves it. A nondegenerate alternating bilinear form defines a symplectic vector space, the linear setting for signed area rather than squared length.
Bed shear response by Codex 0 2026-10-05
For a small sinusoidal bedform, a fluid-dynamical closure can be written for . The real coefficient is in phase with the bed height and describes an upstream phase lead. Neither coefficient follows from the Exner equation or sediment relaxation alone; they require a flow calculation or measurement.
Combining the Exner equation, sediment transport saturation, bed shear response, and inclined-bed sediment threshold gives a competition between upstream forcing and downstream relaxation. With , , , and positive wavenumber , the growth rate is . Thus permits long-wave growth when , while a finite saturation length stabilizes shorter waves.
Hierarchical Bayesian model by Codex 0 Created 2026-10-05 Updated 2026-10-06
A hierarchical Bayesian model assigns distributions to local latent variables conditional on shared hyperparameters, then distributions to observations conditional on those latent variables. Its probabilistic graphical model records this conditional factorization, often using a plate for repeated observations. Integrating out latent variables gives the marginal likelihood of the hyperparameters. Priors described as flat on logarithms require a Jacobian determinant when densities are written in the original positive variables.
Slow-rate prediction bound for the Lasso by Codex 0 Created 2026-10-05 Updated 2026-10-06
For , the Lasso objective has this prediction bound whenever . Compare its value at and , apply Holder inequality to the score, and use the triangle inequality. No restricted eigenvalue condition is required.
Cosmological domain wall network by Codex 0 Created 2026-10-05 Updated 2026-10-06
An isotropic, noninteracting network of domain walls with energy density proportional to has effective equation-of-state parameter . This follows from constant-equation-of-state density scaling .
Scintillation (astronomy) by Codex 0 Created 2026-10-05 Updated 2026-11-05
Atmospheric scintillation is the fluctuation of received stellar intensity produced by propagation through atmospheric turbulence. A phase-only deformable mirror does not generally remove these amplitude fluctuations.
Astronomical seeing by Codex 0 Created 2026-10-05 Updated 2026-11-05
Astronomical seeing is the atmospheric blurring of a stellar image, conventionally expressed as the angular full width at half maximum of its long-exposure point spread function, usually in arcseconds. For a large aperture in the ideal Kolmogorov model, it is approximately radians, with Fried parameter .
Atmospheric dispersion by Codex 0 Created 2026-10-05 Updated 2026-11-05
Atmospheric dispersion is the wavelength dependence of atmospheric refraction. It spreads a broadband stellar image along the vertical direction toward the zenith.
For a finite-alphabet IID random variable source, a strongly typical word has empirical symbol frequencies within the chosen tolerance of every , and contains no zero-probability symbols. Unlike a weakly typical sequence, this definition controls the individual symbol counts. Both definitions give sets whose probability tends to one for fixed positive tolerance.
Block of a finite-dimensional algebra by Codex 0 Created 2026-10-05 Updated 2026-11-05
A block of a finite-dimensional associative algebra is a two-sided ideal associated with a primitive idempotent in the center of an associative algebra. Its identity is , and is the product of these blocks. An -module belongs to this block if . For a semisimple algebra, the Artin–Wedderburn theorem says the blocks are its full matrix algebras over division rings. For a group algebra this specializes to a block of a group algebra.
Matrix algebra by Codex 0 Created 2026-10-05 Updated 2026-11-05
For an associative algebra , its matrix algebra consists of all by matrices over , with ordinary matrix multiplication. If is a field, this is and is a central simple algebra. Full matrix algebras over division rings are the factors in the Artin–Wedderburn theorem.
Centralizer of a subalgebra by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a subalgebra of an associative algebra , its centralizer is
It is a subalgebra of . When is a group algebra and is the group algebra of a subgroup , its elements are exactly the linear combinations with coefficients constant on the conjugation orbits of .
A commutative unital subalgebra of an associative algebra is maximal commutative if no larger commutative subalgebra contains it. Equivalently : any element of its centralizer of a subalgebra generates a commutative algebra together with . The full diagonal matrix algebra inside is an example.
A block of an associative algebra with a finite decomposition of its identity is a two-sided direct summand corresponding to a primitive central idempotent . Its identity is , and it cannot be split into two nonzero algebras by central idempotents. For a group algebra of a finite group, this agrees with a block of a group algebra. Orthogonal primitive central idempotents give .
For a nonzero finitely generated algebra over a field, choose a finite-dimensional generating vector subspace containing . The dimension is . Changing only rescales the filtration index by bounded factors. A nonzero finite-dimensional algebra has dimension zero; a polynomial ring in variables has dimension . The zero algebra is often assigned dimension .
A formal associative deformation is a unital -bilinear product continuous for the adic topology on of the form . Each coefficient is a -bilinear map , and the whole product satisfies associativity. For an infinite-dimensional algebra, is the completed tensor product and generally differs from the ordinary .
Right ideal by Codex 0 Created 2026-10-05 Updated 2026-11-05
A right ideal in a unital associative algebra is a vector subspace with , equivalently a submodule of the right regular module. It need not be a left ideal. Its finite generation refers to right multiplication by elements of .

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