Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
An affine map combines a linear map with a translation. After choosing coordinate origins, it has the form , , where the matrix is its linear part of an affine map and is a fixed vector. Equivalently, it preserves every affine combination. [ref]
Curves and Surfaces in Geometric Modeling: Theory and Algorithms by Jean Gallier. §2.7, Definition 2.7.1 and linear-map construction, pp. 37–38
An original planar example isIt stretches horizontally, applies a shear mapping, and then translates. The vertices , and become , and . A square grid becomes a grid of parallelograms; straight edges and their weighted points still fit together.
This map is not a linear map with respect to the displayed origins, because rather than zero. It also is not a Euclidean similarity: has length and has length , while the right angle at becomes . Its determinant is , so it doubles planar area. These metric changes explain why affine geometry studies straightness, incidence and weighted points rather than treating every transformation as an isometry.
The linear part is an invertible matrix, giving the concise inverse . More generally an affine map is bijective exactly when its linear part of an affine map is bijective. Between equal finite-dimensional spaces, this means an invertible matrix; the translation cannot repair a loss of rank of a linear map.
The cofactor matrix consists of the signed minors of a matrix. It is the transpose of the adjugate matrix. The inverse expression applies to invertible matrices; the definition by minors also applies to singular matrices. Cofactors transform oriented hypersurface area vectors in a change of variables formula.
A popular sum of a finite set is an element having at least a specified number of ordered representations as , with . Popular sums define a dense bipartite graph when additive energy is large. Since the total representation count is , there are at most popular sums.
For every , some has this property: any nonempty finite with has an arithmetic progression of length at least in . The small-difference-set form of the Balog-Szemerédi-Gowers theorem, Ruzsa modelling lemma, cyclic Bogolyubov lemma and nonwrapping progression in a cyclic Bohr set prove it. An order-eight Freiman s-isomorphism suffices to lift the progression because its consecutive second-difference equations expand into equalities of eight-term sums.
For a set of shifts and a map into a circle group, this additive energy counts quadruples whose shift sums and frequency sums both agree. It is the additive energy of the graph of in the product abelian group.
An accelerated life family consists of survival distributions related by positive time scaling: has the distribution of . Therefore the survivor function is and, for densities, the hazard function is . This need not be a constant hazard ratio.
For a minimally coupled scalar field with spatial induced metric , the field's derivative along the future unit normal is . If the shift vector enters as , then . The canonical momentum of the density is . Confusing this density with the normal derivative loses a volume factor.
The velocity induced by planar vorticity is a convolution with this kernel, whose sign depends on the stream function and vorticity conventions. Its magnitude is and its derivative is bounded by . Splitting the convolution at radius gives . The same singularity yields a log-Lipschitz modulus, enough for a Yudovich characteristic flow.
A bounded gravitational system in statistical equilibrium satisfies the time-averaged virial theorem. For inverse-distance gravity with negligible boundary stresses, . This relation does not require static particles or a homogeneous density profile, and reaching it does not erase the system's dynamical history.
Coprime elements of a unique factorization domain by
Codex 0 Created 2026-10-07 Updated 2026-10-14
Two nonzero elements with no common nonunit irreducible factor. In a unique factorization domain this is equivalent to their greatest common divisor being a unit. Coprimality of numerator and denominator makes a fraction reduced, so simultaneous restrictions on its denominator can force it to be a regular function.
A trigonometric function defined where . It has real simple poles at , and . This local pole identity generates the large roots near tangent poles.
This is the travelling salesman problem on a complete graph with nonnegative symmetric distances satisfying the triangle inequality. Repeated visits can be shortcut without increasing cost. Assigning distance one to edges of an input graph and two to its nonedges creates a metric instance with a tour of cost at most the number of vertices exactly when the graph has a Hamiltonian cycle. Thus the metric problem remains NP-hard.
The best mean-square linear predictor from a semi-infinite past is the orthogonal projection onto the closed linear span of past observations in the random-variable Hilbert space. For a causal invertible ARMA representation, past observations and past innovations generate the same closed span. The next linear innovation is orthogonal to it and is therefore the prediction error.
The best mean-square linear predictor is orthogonal projection onto the span of the available centered observations, plus the known mean. Orthogonal innovations give a convenient basis of that span. Prediction at a future horizon must use only actually observed variables; it need not be a one-step predictor.
For a differentiable normalized eigenstate of a differentiable self-adjoint Hamiltonian, differentiate and pair with . The terms involving cancel because is self-adjoint, leaving the stated formula. It turns energy derivatives into observable expectations. A smoothly chosen eigenbranch and suitable operator-domain regularity are required, particularly at degeneracies or crossings.
Writing the wavefunction in modulus and dimensionless quantum phase gives a probability continuity equation and a Hamilton-Jacobi equation with a quantum potential:The phase equations hold locally away from wavefunction nodes. They follow by equating real and imaginary parts of the Time-dependent Schrödinger equation.
Represent each person's successive eligible episodes by separate left-open, right-closed intervals, retaining a common patient identifier and event-order information. A recurrence ends an interval and can be followed by another one; administrative censoring ends the final interval without an event. The row's entry time determines risk set membership. Multiple rows remain one patient history, with possible within-patient recurrent-event dependence.
A gap-time model uses time since the previous recurrence as the episode clock, instead of calendar time since treatment or study entry. Subtract the previous event time from both interval endpoints. Eligibility restrictions become delayed gap entry, and patient/episode labels preserve the actual order of recurrent events. Risk sets on this clock compare eligible episodes of a common gap age, not patients at one common calendar time.
Repeated episodes from one person share susceptibility, treatment and history, so row-wise independence is generally inappropriate. Patient-clustered sandwich covariance matrices estimate uncertainty using whole-patient score contributions under a suitable working model. Shared frailty models instead model persistent latent heterogeneity. These methods require independent sampling units at the patient level and do not necessarily estimate the same marginal versus conditional effect.
A survival concordance index measures agreement between predicted risk ordering and observed event ordering over comparable subject pairs, with half credit for prediction ties. A pair is ordinarily comparable when the earlier observed follow-up ends in an event. Censoring-adjusted versions can reduce dependence on follow-up patterns. Good discrimination does not imply good survival prediction calibration or correct proportional hazards.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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






