Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a first-order ordinary differential equation rational in the dependent variable, with coefficients meromorphic on the chosen independent-variable surface, analytic continuation along an arc ending outside the fixed exceptional set has a definite limit in the Riemann sphere. Its movable singularities are poles or algebraic branch points. To see the limiting assertion, the cluster set of a continuous lifted arc is connected and compact. Any cluster value where the vector field is holomorphic permits uniform local continuation by the Picard-Lindelöf theorem. Otherwise the cluster set lies in finitely many coefficient poles, so it is a singleton. At a pole of the vector field, the inverse equation is holomorphic; its solution has a finite-order critical point, giving a convergent root expansion. The reciprocal dependent variable handles infinity. Points where both reduced numerator and denominator vanish belong to the fixed exceptional set and are excluded from this argument.
The Painlevé property excludes movable critical singularities, such as branch points, of the analytically continued general solution of a complex differential equation. A common stronger formulation requires every movable singularity to be a pole, so local solutions are meromorphic there. Fixed singularities determined by the coefficients are distinguished from movable ones whose locations depend on initial data. Riccati equations with meromorphic coefficients have only movable poles at ordinary points: linearization expresses their solutions as logarithmic derivatives of linear-system solutions. More generally, set and solve the holomorphic linear system , . Its quotient satisfies directly. Initial data , recover every local solution, and holomorphic make the quotient a meromorphic function, even at zeros of . At a zero of with , uniqueness prevents there, so and the pole is simple. This proves the absence of movable branching without assuming that the quadratic coefficient never vanishes.
Two complex lattices are homothetic when multiplication by one nonzero complex number takes one onto the other. Changes between oriented integral bases have determinant one, so normalized period ratios classify these classes by . The lattice Eisenstein sums scale as .
For the complex-linear Hodge star operator and complex orientation on a Hermitian manifold of complex dimension , every -form has the displayed eigenvalue. In an adapted orthonormal real coframe, each factor has two-dimensional star eigenvalue . Regrouping the factors introduces , giving . This is a pointwise metric identity; the metric need not be Kähler.
Use the complex-linear Hodge star operator on the direct sum of all form degrees. Its square on degree is . In positive odd dimension this is always one; in positive even dimension its sign is positive on even-degree forms and negative on odd-degree forms. Complementary basis wedges provide both roots of each sign, so the displayed eigenvalues all occur. On a single degree the Hodge star operator is an endomorphism only in middle degree; on middle degree in dimension its possible eigenvalues are for even and for odd .
For real and , this complex amplitude equation has a destabilizing cubic term and a saturating quintic term. Nonzero uniform intensities solve . The upper branch is radially stable and the lower branch radially unstable; constant phase is neutral because multiplication by preserves the equation. Stable conduction and the stable upper pattern coexist for . At the fold, a zero radial eigenvalue conceals one-sided nonlinear instability, so strict stability cannot be inferred from eigenvalues alone.
For , the uniform oscillation has phase diffusion coefficient . Its amplitude-phase dispersion relation is . Thus gives a long-wavelength modulational instability, whereas gives linear stability of all nonzero Fourier modes. On a fixed periodic domain, instability requires an allowed wavenumber with .
The orientation of a contour specifies the direction in which its parametrization is traversed. Reversing that direction negates its contour integral. For a simple closed curve in the complex plane, positive orientation of a contour is the direction keeping its bounded interior on the left.
A piecewise smooth curve has a continuous function as a parametrization on a compact interval, with a finite partition into subintervals on each of which the parametrization is continuously differentiable. One-sided derivatives may differ at joining points, so polygonal contours are allowed. A contour integral is the sum of the integrals over those smooth pieces.
Algebraic closure of the p-adic numbers is not complete by
Codex 0 Created 2026-10-14 Updated 2026-11-05
Choose compatible primitive roots of unity . The partial sums form a Cauchy sequence. Each generates : for a nonidentity cyclotomic automorphism with , the first changed term has valuation , strictly below every later changed term. Thus the conjugate distance is at least . The tail bound is , strictly smaller. If the limit were algebraic, Krasner's lemma would place every one of these unbounded-degree cyclotomic fields in one finite extension, a contradiction.
A completely positive map with is a trace-nonincreasing quantum operation, representing an outcome branch with its probability retained in the trace. A deterministic quantum channel has equality and is trace preserving. Dividing a branch output by its trace gives a conditional state but generally produces a nonlinear update; that normalization is not part of the linear quantum operation.
Bounded completeness requires the defining implication for a complete statistic only for bounded measurable functions. Completeness implies it, but the converse need not hold. If a sufficient statistic gives a parameter-independent event probability and the conditional probability of that event is nonconstant, then is a bounded zero-mean obstruction to bounded completeness.
A metric space is complete if and only if every decreasing sequence of nonempty closed sets whose diameters tend to zero has nonempty intersection. In that case the intersection contains exactly one point.
Cauchy-sequence construction of a metric completion by
Codex 0 Created 2026-10-14 Updated 2026-10-25
For two Cauchy sequences, , so the displayed limit exists. It defines a pseudometric on the Cauchy sequences, and its metric quotient identifies sequences whose mutual distance tends to zero. Constant sequences embed the original metric space isometrically. Their image is dense, because the class of is approached by the constant classes of . The quotient is complete: from a Cauchy sequence of its points select a subsequence whose successive distances are below and choose original-space points within of these subsequence points. Those original-space points form a Cauchy sequence and its class is the limit of the subsequence, hence of the whole sequence. The original embedding is onto exactly when the original space is complete.
In a one-period complete market with a strictly positive numéraire, at most one positive state-price density prices every traded asset. Suppose do so. For each event , replicate the contingent claim . Linearity of the pricing equations givesBoth weighted densities are integrable because they price the numéraire. An integrable random variable whose integral over every event is zero vanishes almost surely: take the events where it is positive and negative. Therefore , and strict positivity of the numéraire gives . This argument avoids assuming that the unweighted densities themselves are integrable.
In an arbitrage-free one-period market with finitely many assets and an equivalent martingale measure, market completeness is equivalent to uniqueness of the dominated martingale measure. Completeness prices every indicator function, forcing two measures to agree on every event. Conversely, if the attainable payoff span has dimension but is not the whole payoff space, choose disjoint positive-probability events. Their moment vectors against a basis of attainable payoffs are linearly dependent. A nonzero bounded linear combination of their indicators consequently has zero pricing moments. Multiplying an existing equivalent density by , for sufficiently small positive and negative , constructs distinct equivalent martingale measures. This proves the converse without assuming that the original space was finite. On a general probability space, completeness here means replication of all bounded claims, or equivalently all square-integrable claims when asset payoffs are square-integrable.
A star graph is the complete bipartite graph with one centre and leaves. Any pair of its edges meet at the centre.
A universal set fixes the objects under consideration in a particular discussion; each set under consideration is a subset of . For example, makes the complement of equal to . This use of “universal” is local to the discussion: it does not assert the existence of a set containing every set. Stating makes exclusion rules precise.
EM algorithm for a censored lognormal competing-risks mixture by
Codex 0 Created 2026-10-14 Updated 2026-11-05
Let eventual outcome have probability , with . An observed outcome at time contributes to the likelihood, while right censoring at contributes . The expectation-maximization algorithm imputes both the censored outcome and its latent log event time. Its E-step uses the displayed conditional weights and the first two moments of a truncated normal distribution above . With and inverse Mills ratio , these moments are and . Observed outcomes use deterministic class weights and moments . The M-step updates each class probability to its average weight, its mean to the weighted first moment, and its variance to the weighted second moment minus the squared new mean. Outcome-specific cumulative probabilities are cumulative incidence functions, not the conditional distributions themselves.
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





