If , let act on itself by multiplication and let the extra generator act by . Its th power is multiplication by , and these operators give the cyclic algebra as . Conversely, if the algebra is a matrix algebra on an -dimensional vector space, its embedded degree- field makes that space one-dimensional over . The extra generator is then in an -basis, so its th power forces .
Cycle class by Codex 0 2026-10-14
The cycle class of an algebraic cycle is its image under the cycle class map. For a codimension- cycle on a smooth complex projective variety, it belongs to and is the Poincare dual of its fundamental homology class. The map factors through the Chow group, but a Chow class retains finer information than its cohomological cycle class.
For a unit-speed geodesic , a finite cut time is the last time to which its segment from minimizes Riemannian distance. Its endpoint is the Riemannian cut point along that geodesic. It lies in the cut locus; it need not be a cut point in the topological sense. The segment up to the cut time still minimizes by continuity of distance.
For the symplectic Lie algebra , the defining crystal basis is the chain , with weights . Its successive lowering-edge colors are . Every step subtracts its color's simple root. Applying the crystal tensor-product rule to two copies gives a complete grid description of the tensor-square crystal. For , its only highest vertices are , , and , of highest weights , , and zero. For , the middle vertex is absent and only the other two highest vertices remain.
B2 spin crystal by Codex 0 2026-10-14
For the B2 root system with long and short, the spin fundamental weight is . Its four-dimensional highest-weight representation has the minuscule weight orbit , each of multiplicity one. The crystal basis is the chain , where signs denote the coordinates. Each Kashiwara operator subtracts its indicated simple root; the sl2 Lie algebra strings have length one. This fixes every edge and gives a connected highest-weight graph with the correct character.
B2 adjoint crystal by Codex 0 Created 2026-10-14 Updated 2026-11-05
With long-first simple roots , , the Adjoint representation has highest weight . Its crystal basis has one vertex for every root and two distinct zero-weight vertices . The color-one strings are , , and . The color-two strings are , , and . All other edges vanish. One construction takes the component generated by in the tensor square of the crystal of the defining odd-orthogonal representation; the crystal tensor-product rule produces exactly these ten vertices. The equivariant isomorphism identifies its highest weight and representation.
At a point of local degree , the critical multiplicity is . At an ordinary finite point this is the order of vanishing of the derivative. The invariant local-coordinate definition also works at poles and infinity. For , zero and infinity both have multiplicity , so a critical-point count must count multiplicities: there are two distinct critical points but total multiplicity .
Local degrees multiply under composition: , directly by substituting the two local power-series expansions. Consequently
In particular every critical point of remains critical for each positive iterate, and every critical point of an iterate reaches a critical point of in fewer than steps. This covers infinity as well as finite points. For polynomials at finite points the same conclusion follows from .
A critical orbit is the forward sequence starting at a critical point of a rational map. The postcritical set records the forward images, usually from the first iterate onward, of all critical points; a single critical orbit and the union of all such images are distinct notions. For quadratic polynomials there is one finite critical point, zero, and its orbit controls connectedness of the filled Julia set and membership in the Mandelbrot set. A bounded orbit can be preperiodic to a repelling cycle, as for ; boundedness then does not imply Fatou membership.
In the crystallographic convention, a Coxeter graph is admissible when it is realized by linearly independent unit vectors in a Euclidean space, with nonpositive mutual inner products and for distinct vertices. The number records a single, double or triple connection; equivalently, the displayed Gram matrix is positive-definite. In edge-label notation the nonzero connections have labels . Forgetting multiplicity, the underlying graph is a forest: for any cycle of distinct vertices, the sum of the corresponding unit vectors would have squared norm at most , contradicting their linear independence. Multiple lines on one connection are labels and are not length-two cycles. This is the convention of Wehler's Lie algebra notes, section 6.3.
A five-cycle whose points are in orbit order along the real line gives four interval vertices with arrows and . The transition-matrix traces for lengths one through four are . Primitive closed words force at least one fixed point, one two-cycle, two three-cycles and three four-cycles. The second iterate has a two-branch horseshoe for an interval map on vertices two and three. The map itself need not have a one-step horseshoe: the unimodal affine example for , for has precisely this five-cycle and has no two disjoint self-covering branches.
For cycle points ordered , successive gap vertices have arrows , , , . Their transition-matrix traces through length four are , forcing periods one, two and four but not three. The affine interpolation through ordered values has no three-cycle: its only length-three closed interval itinerary is , on which the map is and its third iterate has only its fixed point. Two distinct length-four return words at vertex one give a horseshoe for the fourth iterate.
With the local martingale definition requiring each stopped process itself to be a martingale, the initial value is integrable. A normalized continuous semimartingale decomposition with can therefore have a local-martingale part only if is integrable. A smooth transformation need not preserve this condition: take , for an initially known standard normal random variable, and . Then is finite almost surely but has infinite expectation. The always-valid decomposition is instead with a zero-starting continuous local martingale and a continuous finite-variation process starting at zero.
For a smooth map on the plane with zero Jacobian determinant and , set . The determinant identity gives . Along a curve solving , both and have zero derivative. Local existence and uniqueness for this smooth differential equation through every nearby point produce a local foliation by curves of constant .
A relative-consistency result constructs a model of a first-order theory , or interprets its proofs, from the assumed consistency of a background theory . It establishes in the stated metatheory, not an unconditional proof of consistency. For independence of an axiom from , obtain consistent models of both and , relative to the background assumption.
A relative cycle is represented by a singular chain whose boundary lies in . Define . If a representative changes by with , its boundary changes by , an -boundary. Thus the map is well-defined and additive. Its image is exactly the kernel of : a cycle in dies in precisely when it is the boundary of a relative cycle lifted to . This proves the corresponding exactness in the long exact sequence in relative homology directly.
Let a nonzero Jacobi field vanish at times zero and . On a longer geodesic segment ending at , extend it by zero to a continuous piecewise smooth field . Then . Choose an endpoint-vanishing field with ; integration by parts gives . Thus for small positive . Smooth approximation preserves negativity. The second variation of geodesic energy supplies a shorter path, so a minimizing geodesic cannot extend beyond its first conjugate point.
// Target: differential-geometry.bigb
For an odd prime , let . Its two-isogeny descent partner is . The first two-torsion square-class homomorphism has image exactly : prime-support bounds allow only these classes, and the four rational two-torsion points realize all of them. Every nonidentity point on has positive , so its square-class image is contained in . The two-isogeny rank formula gives , hence the rank is at most .
A Lambert quadrilateral with acute angle and sides incident to the opposite right-angle vertex satisfies the displayed relation. Reflect four copies around that vertex to make a symmetric hyperbolic quadrilateral whose four corner angles are . Identifying opposite sides yields a torus with one cone angle . The two central axis loops have lengths and meet once at right angles. Cutting along one loop gives a pair of pants with two equal geodesic boundaries and the cone point; reglue the boundaries with a Fenchel–Nielsen twist to obtain the two-parameter cone-torus family. Its seven-sheeted torsion-free covers have genus four.
For a regular two-parameter exponential family, condition on the sample mean of the nuisance canonical statistic. Exponential tilting to its observed value and the saddlepoint density approximation give a nuisance-statistic density proportional to times its large-deviation exponential. Dividing the joint likelihood by this density gives the profile log-likelihood plus the displayed adjustment, up to a data-only constant. The sign is positive. This construction assumes an interior saddle with positive curvature and a sufficiently regular nonlattice density; conditioning on a lattice statistic requires the corresponding mass approximation.

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