Every endomorphism of the additive finite cyclic group , for a positive integer , has the form , determined by . This is the self-map case of homomorphism from a finite cyclic group: repeated addition forces the value at every element. Conversely, each choice of respects addition and gives a well-defined map on congruence classes.
Let , the greatest common divisor. The image of a group homomorphism is the cyclic subgroup generated by , with size by order of an element of a finite cyclic group. The kernel of a group homomorphism is
Indeed, is equivalent to dividing , after cancelling and using coprimality. Consequently is a group automorphism exactly when and are coprime. In that case a modular inverse of gives . This connects reversible self-maps directly to the generators of a finite cyclic group.[ref]
Core and power-law elliptical galaxies by Codex 0 Created 2026-10-14 Updated 2026-11-05
Bright elliptical galaxies commonly have a shallow central surface-brightness cusp inside a break radius, whereas many less luminous elliptical galaxies have a steep cusp continuing inward. The latter can have many more luminous tracers at a fixed small radius, helping central black hole dynamical measurements. This empirical distinction is not a universal classification by mass alone. Measurements of central galaxy profiles quantify the contrast.
The Faber-Jackson relation is an empirical correlation between luminosity and stellar velocity dispersion for elliptical galaxies, approximately in its classical form. Slope, scatter, sample and band matter. A heuristic combines , common mass-to-light ratio, and common characteristic surface brightness . The luminosity-dispersion correlation alone does not imply those auxiliary assumptions, and extrapolation to a dwarf spheroidal galaxy is not guaranteed.
Fundamental plane (elliptical galaxies) by Codex 0 Created 2026-10-14 Updated 2026-11-05
The fundamental plane relates effective radius, stellar velocity dispersion, and mean surface brightness of elliptical galaxies. Homologous virial equilibrium with constant mass-to-light ratio predicts ; empirical exponents differ. The two-variable Faber-Jackson relation is a projection, not the entire plane.
Euler system of elliptic units by Codex 0 Created 2026-10-14 Updated 2026-11-05
Elliptic-unit distribution gives norm-compatible units indexed by auxiliary squarefree ray moduli, with norm factor at a newly added prime. Kolyvagin derivative operators turn these units into classes with controlled valuations, and suitable auxiliary primes chosen using Chebotarev density theorem bound class-group characteristic ideals. The construction supplies the difficult divisibility in the CM Iwasawa main conjecture.
Associated with a period lattice are the Weierstrass sigma, zeta, eta and elliptic functions. They satisfy and ; the eta constants record quasi-period increments of the Weierstrass zeta function.
The Jacobi elliptic functions include , and , with and . Their ratios give the other standard members. The Jacobi elliptic sine is the inverse of the elliptic integral of the first kind.
Hopf lemma by Codex 0 2026-10-14
For with bounded coefficients and uniform ellipticity near a boundary point satisfying the interior sphere condition, suppose has and in a tangent open ball. With the outward unit normal of that ball, . Consequently the outward normal derivative is positive whenever it exists. The given boundary continuity alone does not assert that the derivative exists. The minimum version follows by applying this to ; operators with a zeroth-order term require additional sign hypotheses.
For , the standard ellipsoid covering a centrally cut half of the unit ball has center and shape matrix . Its eigenvalues are along and in the other directions. Hence its volume ratio is . Using and gives . Affine changes of coordinates preserve the volume ratio. The resulting geometric convergence underlies the ellipsoid method; exact rational feasibility additionally needs input-dependent size, precision and lower-dimensional feasibility bounds.
A polynomial-time algorithm for integer linear feasibility gives exact rational linear programming optimization. Rational vertex bounds give a polynomial-bit bound on every finite optimal value and its denominator. An objective threshold below that bound detects unboundedness after feasibility is established. Binary search with the additional inequality localizes the finite optimum to an interval containing a unique rational of bounded denominator; continued fractions recover it exactly. A feasible optimizer can then be found by successive coordinate minimizations on a bounded optimal face. These produce faces of one fixed rational polytope, so one uniform vertex-denominator bound works throughout, avoiding exponential growth of precision requirements.
For an integer linear polyhedron with coefficients bounded by , put and . If , every with satisfies . Thus contains a positive-radius Euclidean ball and is a full-dimensional linear polyhedron. If is empty, the normalized integer Farkas infeasibility gap gives , , and . A point of would give , a contradiction. Consequently this relaxation preserves emptiness and supplies the inner-volume bound needed by the ellipsoid method, even when has empty interior.
A nonempty linear polyhedron can have no extreme point. Intersect it with an orthant containing one feasible point, and minimize the sum of the signed coordinates there. The relevant sublevel sets are compact, so the minimum face has an extreme point, which is also extreme in the orthant intersection. The added signed-coordinate rows are integer rows with entries at most one. The integer-matrix vertex coordinate bound gives . This supplies a bounded feasibility search even when the original polyhedron contains lines.
Spheroid by Codex 0 2026-10-14
A spheroid is an ellipsoid of revolution obtained by rotating an ellipse about a principal axis. Rotation about the shorter axis gives an oblate spheroid; rotation about the longer axis gives a prolate spheroid. Thus the oblate form is a member of the general family.
John ellipsoid by Codex 0 2026-10-14
The John ellipsoid of a convex body is its inscribed ellipsoid of largest volume. For the unit ball of a -dimensional normed vector space, change coordinates so that this ellipsoid is the Euclidean unit ball. The resulting coordinates are called John position. In these coordinates the John contact decomposition implies , or .
Solid ellipsoid by Codex 0 Created 2026-10-14 Updated 2026-11-05
A solid ellipsoid is the filled region bounded by an ellipsoid. The open version centered at the origin is
where is a real symmetric positive-definite matrix; replacing by includes the boundary. Its semi-axis lengths are , where are the eigenvalues of . In three dimensions its volume is , by a change of variables from the unit ball.
In even-dimensional symplectic geometry, a uniform dilation , , multiplies the symplectic capacity by . This concerns one common factor in every coordinate. Independent changes in the different semi-axis lengths are not a uniform dilation and have no such common square factor.
For a positive-definite symmetric matrix , the ellipsoid has nearest points to the origin exactly at , where ranges over unit vectors in the largest-eigenvalue eigenspace. Indeed, the spectral theorem for real symmetric matrices gives , with equality precisely in that eigenspace. A simple largest eigenvalue gives two opposite nearest points; multiplicity gives a scaled -sphere of nearest points.
Repeated weak-rotation bomb-test efficiency by Codex 0 Created 2026-10-14 Updated 2026-11-05
For an Elitzur-Vaidman bomb tester using a rotation and its inverse, let be the probability of entering the absorbing path and . Conditional on a live absorber, one trial has explosion probability , successful safe identification probability , and inconclusive probability . The inconclusive projective measurement resets the input, so summing a geometric series gives the displayed success probability after at most trials. Its limit is , approaching one half as tends to zero through positive values. Exactly zero coupling produces no information.
Circle reduction splits the metric into a ten-dimensional graviton, one vector and one scalar, and the three-form into a three-form and two-form. Seven-torus reduction gives a four-dimensional graviton, vectors, direct scalars and seven two-forms. The two-form scalar duality turns the latter into seven more scalars, giving in all. A remaining four-dimensional three-form has no local polarization. These are zero-mode counts without fluxes, orbifold projections or moduli freezing.
Freund-Rubin compactification by Codex 0 Created 2026-10-14 Updated 2026-11-05
A product compactification supported by a four-form proportional to one factor's volume form. For the maximally supersymmetric membrane throat, the other factor is a round and the radii obey . The flux links the curvature scales through the supergravity field equations.
Two-valued topos by Codex 0 2026-10-14
A nondegenerate elementary topos is two-valued when its terminal object has exactly the empty and whole subobjects. This is a global-truth property, distinct from being a Boolean topos, which requires complements for all subobjects of all objects.

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