Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A J-holomorphic curve is simple if it does not factor through a holomorphic branched covering of degree greater than one. For a nonconstant curve this is equivalent to having a point where its derivative is nonzero and its image has exactly one preimage.
A J-holomorphic curve on a punctured disc with finite energy and image contained in a compact target extends smoothly across the puncture when the target has a smooth tame almost complex structure and compatible bounded geometry. Local monotonicity controls escape from small target balls, and the elliptic small-energy estimate followed by elliptic regularity gives the extension. This is the step turning a finite-energy plane obtained by rescaling into a J-holomorphic sphere.
For and positive integers with , the number of labelled trees having vertex degree at label isBy the Prüfer degree formula, this is the multinomial coefficient counting sequences with occurrences of each label. If a degree is zero or the sum is wrong, there are no such trees. For the example degree sequence , there are labelled trees, one for each ordering of the labels . Knowing the vertex degrees thus constrains, but usually does not determine, the tree.
If , eliminate the letters private to byEvery assignment satisfying satisfies one disjunct of . If an assignment satisfies , change only the eliminated letters to its witnessing assignment. The modified assignment satisfies and hence , whose letters were unchanged. Thus , and the propositional completeness theorem gives the two derivations. The interpolant uses only common letters; an empty common vocabulary is handled by logical truth constants.
Metallicity distribution in the half-rate infall model by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For and initially pristine gas, and the formed stellar mass is . If a fixed initial mass function supplies surviving tracers per unit formed mass, then and until the current gas abundance. Complete exhaustion gives a uniform normalized metallicity distribution function on . This is uniform in linear metallicity, not in its logarithm.
A three-uniform hypergraph is bipartite when its vertex set has a partition into two parts such that every hyperedge meets both parts. All such triples on parts of sizes number . For fixed total order this is maximized by balanced parts.
In a gauge-preserving regularization and consistent renormalization convention, the proper-vertex Ward-Takahashi identity in QED equates the vertex and electron wave-function renormalization constants. With and , the vertex coefficient gives , proving the displayed charge relation in . Gauge invariance restricts counterterms but does not forbid charge running.
Suppose each job occupies two distinct resources for one whole slot, and each resource can serve at most one job in that slot. Make resources vertices and jobs edges. Two jobs conflict exactly when their edges share a vertex, so a valid schedule is a proper edge colouring. Each slot is a matching in a graph; the chromatic index is the minimum number of slots. The colour labels specify the slots, rather than physical colours. This model assumes all jobs are available initially, with equal duration, interchangeable slots and no additional conflicts. The school-timetable motivation in Graph Theory by Reinhard Diestel (author-hosted Colouring preview, opening paragraphs, pp. 123–124) uses this resource-pair interpretation.
Here is a complete example. Two technicians must each use three instruments once. Each job needs its technician and its instrument simultaneously. The six jobs are the edges of the complete bipartite graph :Within each , the two jobs use different technicians and different instruments, so is a matching in a graph. The three matchings in a graph together cover every job exactly once. Technician has three jobs, so fewer than three slots cannot suffice; the displayed schedule uses three. This is an optimal proper edge colouring with chromatic index three, witnessed by both a schedule and a resource-workload lower bound.
Repeated jobs requiring the same resource pair become distinct parallel edges of a multigraph, rather than one edge. Additional restrictions change the problem: prescribed allowed slots lead to list edge coloring, while unequal durations, deadlines, or jobs needing more than two resources require a richer scheduling model. Selecting a largest matching in a graph solves a single-round question; a shortest complete schedule must organize all jobs across rounds.
A projective embedding realizes a variety as a closed subvariety of projective space. A very ample line bundle gives such an embedding through its global sections.
The complete system of quadratic forms maps to a smooth surface of degree four in . The six coordinates are . It occurs as a degree-two image of a K3 surface and, after taking a projective cone, in the plane-quintic exception to the K3 linear system dichotomies.
The pullback of along a continuous circle homomorphism is a compact central extension of the circle. Its lifts commute: a scalar commutator is a continuous alternating bicharacter, which vanishes on a dense cyclic subgroup and hence everywhere. Average a rank-one positive operator over this compact extension. The resulting nonzero compact operator has a finite-dimensional invariant eigenspace, and commuting unitaries have a common eigenvector there. Its continuous character has central weight one; dividing the lifts by that character yields an honest continuous circle representation.
Let be a nonzero finitely generated module over a commutative Noetherian ring. Take a length- resolution with finite projective terms. If its top Ext functor with coefficients in vanished, the dual of its last injection would be surjective. The dual of a finite projective module is projective, so that surjection splits. Finite projective modules are isomorphic to their double duals, so dualizing gives a splitting of the original injection. The resolution then shortens, contradicting minimality of . When , a nonzero coordinate of a finite free module containing as a summand gives a nonzero map .
For the line-projectivization of a rank- complex bundle, . The Whitney sum formula for Chern classes gives as a formal power series. Comparing coefficients proves the formula. Since has rank , its degree- Chern class vanishes and yields the monic projective-bundle relation.
// Target: geometry-and-topology.bigb
This convention for a projective bundle parametrizes one-dimensional quotients of the fibres of a vector bundle . Its universal quotient is , and . Tensoring by a line bundle on the base leaves the projective bundle unchanged but tensors its universal quotient by the pullback of that line bundle. The alternative convention of holomorphic projectivization by lines replaces by its dual and reverses the tautological sign.
The profinite topology on has basis the residue classes , . These classes are both open and closed, since their complements are finite unions of other residue classes. Set for . Then and every is nonempty. An integer in their intersection would make divisible by every , forcing , impossible. Thus the open complements form an increasing cover with no finite subcover. The topology is Hausdorff because distinct integers are distinct modulo a sufficiently large integer, but is not compact.
For a continuous function , is differentiable at zero with , because . At any nonzero point , is differentiable exactly when is: one direction uses the product rule, and the converse applies it to near .
A maximal external point of a finite set has no other point strictly larger in every coordinate. This weak nondominance differs from a maximal element in the product order when coordinate ties exist: for example passes the weak test against but is not maximal in the product order. In an independent continuous-coordinate random sample, ties have probability zero, so the two notions coincide almost surely.
Two isospectral manifolds remain isospectral after taking a Riemannian product with the same closed factor: eigenvalues add, with multiplicities given by the product Laplacian eigenspace decomposition. For nonisometric closed connected factors , choose . Every closed product geodesic of length less than has constant projection to , since a nonconstant closed geodesic shorter than the injectivity radius is impossible. The short coordinate geodesics of the small flat torus span exactly its tangent factor at every point. Any product Riemannian isometry must preserve that intrinsically defined smooth distribution and its orthogonal complement, hence restrict to an isometry of the original factors. Thus these products are still nonisometric. Taking to be four-dimensional tori proves the higher-dimensional stabilization statement without assuming a cancellation theorem for arbitrary products.
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






