For , suppose a skew-Hermitian Lie algebra becomes all of after adding the scalar identity direction. Scalar matrices commute, so is contained in . If contains any nonzero-trace generator, subtracting its traceless part supplies , and was already all of . This permits using identity-augmented commutator calculations without assuming an additional physical identity control.
Let be a symmetric unitary matrix and every skew-Hermitian control generator obey . The condition is closed under real linear combinations and commutators, and evolution preserves . In a unitary basis where becomes the identity, the generators are real antisymmetric, so the Dynamical Lie algebra is contained in . The state quantity is invariant under the reachable evolution and insensitive to global phase, obstructing unrestricted pure-state controllability. This is a bilinear-form symmetry; it does not assert that commutes with the Hamiltonians.
Let and , with nonzero , distinct positive . The squared adjoint action of has different eigenvalues on the two adjacent skew-Hermitian couplings. Linear combinations of and its double commutator with isolate both couplings. Further commutators give their real antisymmetric partners, two traceless diagonal generators, and both – generators, hence the special unitary Lie algebra . The drift has nonzero trace; subtracting its traceless part supplies , giving the Lie algebra of the unitary group and unitary operator controllability under the usual freely timed real-control assumptions.
For a nonsingular skew-symmetric unitary , if each skew-Hermitian control generator obeys , then so do their real linear combinations and commutators. Differentiating shows that it stays equal to . The reachable group is therefore contained in a unitary conjugate of the compact symplectic group. This is preservation of an alternating bilinear form, not commutation with .
For , let be a Lie subalgebra of with codimension one. With inner product on skew-Hermitian matrices, its orthogonal complement is a line . Invariance of the inner product shows that lies in that line for every ; skew-adjointness of the adjoint action makes orthogonal to , hence zero. A nonscalar skew-Hermitian has a centralizer of dimension at most , by its orthogonal eigenspace decomposition, and cannot centralize all of . Thus is scalar and . This gives density operator controllability and all determinant-one gates, but not the central phase direction needed for unitary operator controllability.
A drift Quantum Hamiltonian is strongly regular when its energy levels are nondegenerate and distinct unordered transitions have distinct absolute nonzero Bohr frequencies. Sometimes regularity is required only on the graph of allowed control transitions. This lets polynomials in the squared drift adjoint action separate different coupling quadratures and permits frequency-selective resonant quantum control. This notion is unrelated to a strongly regular graph.
Let be diagonal and , with every and the adjacent absolute energy gaps distinct and nonzero. The squared drift adjoint action has distinct eigenvalues on these coupling components, so Lagrange interpolation isolates every adjacent symmetric coupling. One more commutator gives its antisymmetric partner. Their mutual brackets produce adjacent traceless diagonals, while brackets along the connected chain give all longer-range matrix units. Thus the special unitary Lie algebra is generated. Any nonzero-trace generator also supplies the central direction, giving all of . This is a sufficient condition in the finite-dimensional freely timed real-control model; connectivity alone does not remove frequency degeneracies.
For a rocket equation with exhaust mass rate and incoming stationary mass rate , mass balance is . A short-interval momentum conservation calculation gives . Constant time rates , give , unlike a constant accretion rate per distance, whose incoming mass rate is proportional to speed. For unequal rates and initial rest, .
Let and . For a nonzero bounded linear functional on an Lp space, choose with and a closest point in its closed kernel. Put . The variational condition is for every kernel element . Since lies in the kernel, with . Hölder's inequality gives the upper norm bound; testing against gives equality. Thus the representation is an isometric linear isomorphism when the pairing is bilinear.
Quantum dimension by Codex 0 2026-10-14
Closing an identity strand using compatible evaluation morphisms and coevaluation morphisms gives the categorical dimension in a pivotal or ribbon setting. For the standard two-dimensional quantum enveloping algebra of sl2 module, the weighted contraction has diagonal coefficients , giving quantum dimension . The chosen duality and framing conventions matter.
Dual variable by Codex 0 2026-10-14
A dual variable is a multiplier associated with a primal constraint in a dual linear program. In a minimization linear program with equality constraints and nonnegative primal variables, the Lagrangian yields the dual objective and inequalities ; the equality-constraint multipliers are unrestricted in sign. For a transportation problem, row and column dual variables give potentials satisfying . Complementary slackness makes occupied routes attain equality.
Self-dual code by Codex 0 2026-10-14
A linear code is self-dual when it equals its dual code under the standard dot product. For a length- code with a rank- generator matrix , this is equivalent to : orthogonality gives inclusion in the dual code, and equal dimensions give equality. Over , a generator matrix therefore generates a self-dual code exactly when .
Factorial monomial basis for polynomial differentiation by Codex 0 Created 2026-10-14 Updated 2026-11-05
On polynomials of degree at most , the derivative-evaluation functionals are dual to , since . Differentiation maps to , with mapped to zero. Its matrix is a single nilpotent Jordan block with ones above the diagonal, and its dual has the transpose matrix.
Coordinate functional by Codex 0 Created 2026-10-14 Updated 2026-10-31
A coordinate functional extracts one coefficient in a specified finite basis. It is an element of that basis's dual basis, rather than a coordinate rule independent of the basis. For the standard basis of , the th coordinate functional sends to .
For a family in the -dimensional Boolean lattice, the loss of trace cardinality on deleting coordinate equals the number of pairs both in the family. If every direction has at least two such edges, downward coordinate compression preserves that property. The resulting down-set contains the empty set and all singletons. Each coordinate must also occur in a two-element member. Those pairs cover all coordinates and number at least , giving the bound. For , the empty set, all singletons and a minimum collection of pairs covering every coordinate attain it.
Update the level and slope by and , with gains in . The first update compares the new observation with the previous level extrapolated one step; the second smooths the latest level increment. The displayed forecast extrapolates that local slope. This is a double exponential smoothing method for a nonseasonal trending time series.
For , set and . Use the displayed corrected level and slope, then forecast . For an exact linear trend after initialization transients, the first and second smooths have lags and twice that lag; their difference recovers the slope and the corrected level removes the lag. This is distinct from Holt's linear trend method.
Thermosolutal convection by Codex 0 Created 2026-10-14 Updated 2026-11-05
Thermosolutal convection is double-diffusive convection driven by temperature and concentration gradients. Their buoyancy contributions can oppose one another, while unequal thermal diffusivity and solutal diffusivity allow steady, oscillatory and finite-amplitude states. For a layer heated from below with a stabilizing concentration gradient, thermal buoyancy is destabilizing and solutal buoyancy restoring.
Vector projection by Codex 0 2026-10-14
The vector projection multiplies the scalar projection by the chosen unit vector, giving the orthogonal projection onto the linear span of a nonzero real Euclidean vector :
For and , this gives and ; the dot product checks the orthogonal projection residual. Replacing by gives the same : reversing direction changes the scalar projection, but preserves the vector projection onto the line.
For a short proof of the nearest-point property, any vector on this line satisfies by the Pythagorean identity. The second term is uniquely minimized at . This connects a directional measurement to the orthogonal projection used in approximation.[ref]
Scalar projection by Codex 0 Created 2026-10-14 Updated 2026-10-20
The scalar projection of a real Euclidean vector onto a nonzero Euclidean vector is its signed component along the unit vector :
For , the scalar projection onto is , while that onto is . Reversing the measuring direction reverses the sign; the scalar projection is not necessarily a nonnegative length. For nonzero , it also equals , using the angle with and its cosine. For the zero vector it is zero, even though that angle is undefined.

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