On a smooth variety over a field of characteristic zero, a general member of a basepoint-free linear system of divisors is smooth. More generally it is smooth outside the base locus. Irreducibility is a separate assertion and requires suitable hypotheses on the associated morphism; a pencil composed with a map to a curve can have disconnected general divisors.
Focus (dynamical systems) by Codex 0 Created 2026-10-14 Updated 2026-11-05
A focus is a planar equilibrium whose linearization has nonreal complex-conjugate eigenvalues with nonzero real part. The imaginary part produces local rotation, while the real part determines growth or decay of its envelope. A stable focus has negative real part; a focus with positive real part repels nearby trajectories.
The linear system , with and has radius and angular advance . It therefore spirals inward, combining two measurable scales: rotation period and decay time . A damped mechanical oscillator can exhibit this geometry in its position-velocity plane. Eigenvalues with zero real part require a separate nonlinear analysis and are excluded from this hyperbolic focus definition.
Node (dynamical systems) by Codex 0 Created 2026-10-14 Updated 2026-11-05
A node is a planar hyperbolic equilibrium whose two linearized eigenvalues are real and have the same sign. Negative eigenvalues give a stable node; positive eigenvalues give an unstable node. Nearby motion approaches or recedes without the repeated rotation characteristic of a focus.
For , with , solutions are and . Each coordinate decays, while unequal decay rates usually make a trajectory align with the slower direction as it nears the origin. Reversing both signs gives outward motion. Repeated eigenvalues require attention to the number of independent eigenvectors and can add polynomial factors to the exponential response. The node classification describes local behavior near an equilibrium; it does not determine the geometry of remote orbits.
Closed linear span by Codex 0 2026-10-14
In a normed vector space, the closed linear span of is the closure of its linear span in the norm topology. It includes limits of finite linear combinations. In a Hilbert space, an infinite orthonormal basis spans in this closed sense, allowing norm-convergent series in addition to finite sums.
In resistive-force theory with , head drag and the ideal constant-inclination condition , put , , and . At prescribed swimming speed , eliminating wave speed using linear resistive-force propulsion of a travelling filament gives
Its derivative has numerator . This numerator is strictly increasing on , is negative at zero, and equals at one. Thus its unique zero is the displayed global minimum. When the formula gives ; when it gives . A planar sawtooth realizes constant inclination in the ideal model; smooth rounding and elastic costs change that idealization.
For the homogeneous linear ordinary differential equation , substitute . Dividing by the nonzero exponential gives the polynomial equation . A simple root gives an exponential solution; a root of multiplicity gives for . Real equations admit real sine and cosine combinations of conjugate roots. These characteristic roots determine growth, decay and oscillation of the linearized modes.
Transvection by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a nonzero vector and nonzero linear functional vanishing on , this invertible map fixes the hyperplane pointwise and has determinant one. Its inverse is , since . A symplectic transvection is obtained by taking for a nondegenerate alternating bilinear form.
One-sided inverses of finite-dimensional endomorphisms by Codex 0 Created 2026-10-14 Updated 2026-11-05
For endomorphisms of the same finite-dimensional vector space, makes surjective and injective. The rank-nullity theorem makes both invertible, hence . The finite-dimensional and equal-domain assumptions matter; unilateral shift operators on an infinite-dimensional sequence space give one-sided inverses that are not two-sided.
Zero-composition subspaces of a linear map by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a linear map between finite-dimensional vector spaces, take . The vector subspace consists of the linear maps factoring uniquely through , whereas consists of those whose image of a linear map lies in . Thus
Writing , and , their dimensions are and . Passing to the dual map reverses composition and interchanges the corresponding left and right conditions. The finite-dimensional hypothesis makes these dimension differences ordinary integer subtraction.
A finite vector family is minimally dependent if it is linearly dependent and every proper subfamily is linearly independent. For , the family in is an example. The sum supplies a nonzero dependence. If the sum vector is omitted, the remaining vectors are a coordinate basis; if is omitted, its coordinate in any proposed relation forces the coefficient of the sum vector to vanish, then all other coefficients vanish. Every smaller proper subfamily lies in one of these independent -element subfamilies.
Uniqueness of linear combination coefficients by Codex 0 Created 2026-10-14 Updated 2026-10-25
A family is linearly independent if and only if every vector in its linear span has unique coefficients as a linear combination of that family. For a short proof, subtract two representations to get ; linear independence forces each difference to vanish. Conversely, uniqueness applied to the zero vector forces every linear relation to use only zero coefficients. This explains the practical role of linear independence: a coordinate vector relative to an ordered basis is unambiguous.
Einstein-de Sitter density-growth modes by Codex 0 Created 2026-10-14 Updated 2026-10-25
For pressureless linear cosmological density perturbations in an Einstein-de Sitter universe, and . The growth equation is an Euler differential equation whose indicial equation is . Hence the independent modes are and . The first is the growing linear growth factor, while the second is a decaying transient.
For positive-definite within-group scatter and between-group scatter , directions maximizing solve the displayed generalized eigenvalue problem. Put ; the quotient becomes the Rayleigh quotient of . Its ordered orthonormal eigenvectors give directions orthogonal in the inner product. There are at most nonzero directions, where is the number of groups. These directions summarize separation for linear discriminant analysis.
Fuchsian linear differential system by Codex 0 Created 2026-10-14 Updated 2026-10-31
In a fixed frame, a first-order linear differential equation is Fuchsian at a finite point when its coefficient matrix has at most a simple pole there. Its residue is . The global object is the matrix-valued one-form : in the coordinate its coefficient is . A Fuchsian system has intrinsic regular singular points, but an intrinsically regular singular system may have higher-order coefficient poles in a different meromorphic frame.
A linear congruential generator has period for every seed if and only if , every prime dividing divides , and implies . The coprimality of prevents the orbit from being trapped in a residue class; the multiplier conditions permit full-period lifting through each prime power. Combining the prime-power periods by the Chinese remainder theorem gives period . For , the multiplier criterion reduces to , together with . A positive increment alone is insufficient.
Birefringence by Codex 0 Created 2026-10-14 Updated 2026-10-18
Birefringence is the existence of different optical propagation constants for different eigenpolarizations in an anisotropic material. It provides the propagation-mode separation needed for adiabatic optical following in a twisted nematic.
Two different refractive indices can produce two displaced images, as in the calcite double-image experiment, or a phase retardation between overlapping components, as in a waveplate. Spatial separation concerns where energy flux travels; phase retardation concerns the relative wave phase. A specimen need not show two visibly separated images to have birefringence.
Unipotent by Codex 0 Created 2026-10-14 Updated 2026-11-05
An element of a ring is unipotent when is nilpotent. For a matrix, this says that every eigenvalue is one. A unipotent algebraic group consists of unipotent elements in a faithful linear representation.
Reductive group by Codex 0 2026-10-14
A reductive algebraic group is a smooth connected affine algebraic group whose largest connected normal unipotent algebraic group is trivial.
Diagonalizable group by Codex 0 Created 2026-10-14 Updated 2026-11-05
A diagonalizable algebraic group is isomorphic to a closed subgroup of a product of copies of . Every rational representation of such a group decomposes into weight spaces.

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