Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A nonzero weight-fourteen cusp form would have order at infinity at least one and order at at least one, since . The valence formula for the modular group would then give , which is impossible.
The upcrossing count counts completed upcrossings by time , allowing the first purchase at time zero. For a martingale, the Doob upcrossing inequality bounds its expected value by .
A universal sentence has the form with quantifier-free formula , including an empty quantifier block. Its truth passes from a first-order structure to every substructure of a first-order structure: tuples from the smaller domain are also tuples of the larger domain, and quantifier-free truth agrees. Therefore a first-order theory of universal sentences has a first-order model class closed under substructures of a first-order structure.
A first-order theory has its class of first-order models closed under substructures of a first-order structure exactly when it is equivalent to its universal consequences . If , then is consistent. Otherwise a finite logical conjunction of signed diagram of a structure sentences yields a universal consequence false in . The compactness theorem gives a first-order model of containing an embedded copy of , and closure under substructures of a first-order structure implies . The converse is preservation of universal sentences. The diagram of a structure must include negated as well as positive atomic sentences so that the resulting map is an embedding, not just a homomorphism.
A biholomorphism of the unit disk to itself. Every such map has the form with . These maps normalize an extremal univalent function in the proof of the Riemann mapping theorem.
Suppose a Non-Archimedean absolute value on has a unique extension to every finite field extension. Any K-isomorphism between conjugate roots pulls the absolute value back to an extension on the source field, which must be the given one. Thus for every . This argument includes inseparable irreducible polynomials: no transitive Galois action or completeness assumption is needed.
Pure-power reduction of a monic irreducible polynomial by
Codex 0 Created 2026-10-05 Updated 2026-10-06
Suppose a Non-Archimedean absolute value extends uniquely to every finite extension. If is monic and irreducible, every root has absolute value at most one: otherwise its leading power dominates all lower terms, contradicting by the ultrametric inequality. In a splitting field, let be the minimal polynomial of an algebraic element of the residue of one root. Lift its coefficients to . The lift has absolute value less than one at that root and hence, by equal absolute values of algebraic conjugates, at every root. Consequently every root residue is a zero of . Since reduction preserves the product of the linear factors with multiplicities, every irreducible factor of is , proving the displayed identity for some .
For a uniquely ergodic continuous map of a compact metric space, every continuous satisfies uniformly in . Otherwise choose increasingly long orbit empirical measures with a fixed discrepancy. Compactness provides a weak limit; the telescoping identity makes it invariant, so it must be the unique measure , contradicting that discrepancy. Compactness and continuity are essential hypotheses.
For the splitting field of , the cubic is Eisenstein and its discriminant is . The quadratic subfield is , and the degree-six extension is totally ramified. If is a root and , then is a uniformizer. Transpositions have , while three-cycles have value , giving the displayed ramification groups. Its different exponent from ramification groups is .
Let be an equal-characteristic-p local field and let have , with . If , the Artin–Schreier extension has degree and is totally ramified: a root in would force the pole order to be divisible by , and forces . Choose and an integer with . For a base uniformizer , the element has valuation one. Under , , the leading term in has valuation . The uniformizer criterion for lower ramification groups therefore gives the single lower break . The Herbrand function is the identity up to that break, so the upper break is also .
Triangle support line between bipartite and tripartite Turan graphs by
Codex 0 Created 2026-10-05 Updated 2026-10-14
For , put , , and . Every graph on vertices satisfiesThus an edge count forces at least triangles in a graph. This is an exact finite bound, with the rounding in the Turán graph retained. To prove it, use edge-triangle symmetrization. The inequality allows merging the two smallest classes when there are at least four classes. With three classes, fixing the middle class makes the objective affine in the product of the other two sizes; either merge them or balance them. Only and need remain.
If , every formal associative deformation on the adic completion of a module is trivial. After killing lower coefficients, associativity makes the order- coefficient a Hochschild cocycle . Transport by subtracts and kills it. The successive transformations stabilize modulo each and converge to an invertible change of coordinates. Completeness, and equivalence congruent to the identity modulo , are essential to this argument.
On the ordered branch of tricritical crossover scaling, at zero field and , the minimizing square is . Its stationarity relation gives . Thus the minimized free-energy density becomes for fixed as , recovering the ordinary quartic continuous phase transition and its heat-capacity critical exponent . Replacing the scaling function by a nonzero constant in this limit would give an incorrect exponent.
The trapezoidal rule is A-stable but is not B-stable. For the dissipative vector field at step size one, its uniquely defined step map obeys . At , and implicit differentiation gives , so nearby states expand rather than contract. This is a concrete nonlinear obstruction, rather than merely failure of the sufficient algebraic stability criterion.
For standard three-dimensional Brownian motion started at with ,The harmonic function gives a bounded stopped martingale in the annulus, so the optional stopping theorem gives the formula. Taking yields for . This limit uses path continuity on the finite interval before a hit, rather than assuming transience to prove transience.
Edge-inclusion formula for a uniform spanning tree by
Codex 0 Created 2026-10-05 Updated 2026-11-05
For a finite electrical network with positive electrical conductances , choose a spanning tree with lawThe one-edge case of the transfer-current theorem gives for . A unit injected electric current produces voltage , and Ohm's law makes the electric current along equal to .
In a triangle of unit resistors, one resistor is parallel to a series pair, so . Each edge consequently has inclusion probability , also clear from the three equally likely spanning trees. For a wired uniform spanning forest, take the finite wired limit and use the limiting wired effective resistance.
Let be total magma volume shared between a reservoir and an advancing toughness-controlled magma intrusion, , and conduit conductance . With ,Equilibria satisfy . Two positive equilibria exist when ; the smaller is unstable and the larger is stable under this volume equation. An advancing solution between them approaches the larger. The singular pressure as prevents this late-time model from nucleating an intrusion by itself.
Maximum dimension of a totally isotropic subspace by
Codex 0 Created 2026-10-05 Updated 2026-10-14
For a real quadratic form on an -dimensional vector space, with rank and signature defined as positive minus negative index, the maximum dimension of a totally isotropic subspace is . Quotienting by the radical of a bilinear form leaves a nondegenerate form of indices . Projection of an isotropic subspace to each sign-coordinate space is injective, bounding its dimension by . The radical and vectors pairing one positive with one negative unit coordinate attain the bound .
For strictly inside a one-dimensional domain, the indicator has distributional derivative , hence . Directly from the test-function definition, , and two disjoint normalized smooth bump functions attain the bound. Values at the endpoints themselves do not change the function.
For on a bounded domain, total variation denoising has a unique minimizer. A bounded minimizing sequence has a weakly convergent subsequence; variation is a supremum of weakly continuous test-function pairings and the fidelity has weak lower semicontinuity. The strictly convex fidelity proves uniqueness. Bounded-variation contraction under clipping proves that data range bounds pass to the minimizer.
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





