Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Over a model of Generalized continuum hypothesis, add Cohen reals with finite binary partial functions. The Delta-system lemma proves the countable chain condition for forcing. The generic reals give the continuum lower bound , while nice forcing names for subsets of number at most in the ground model. Cardinal preservation then gives .
An infinite cardinal number is singular when . Thus a short cofinal function reaches arbitrarily high ordinals below . For example, has cofinality . The complementary case is a regular cardinal.
If is a nonzero limit ordinal and is strictly increasing, then . A cofinal subsequence of the index order gives one inequality. Conversely, a cofinal family in the supremum determines a cofinal family of indices by choosing an index past each of its values. This also explains the cofinality of limit-indexed aleph numbers.
Conditional evolved-companion fraction in a coeval binary population by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Giant-pair fraction in an instantaneous stellar burst by
Codex 0 Created 2026-10-06 Updated 2026-11-05
In an instantaneous burst all binary components have a fixed common age. If the initial component masses are independent, the probability of two red giants is the square of the individual giant probability at that age. This need not equal the age-averaged pair fraction in a continuously forming population.
On an oriented boundaryless Riemannian manifold, apply Stokes theorem to the compactly supported form . The graded Leibniz rule gives . The Hodge star operator identifies these top forms with the scalar integrands displayed above. This proves that the codifferential on one-forms is , the formal adjoint of the exterior derivative. Compact support of suffices.
On the whole Euclidean space, an -Lipschitz gradient of a convex function is -cocoercive. Subtract the supporting affine function at one point, apply the descent lemma to a gradient step at the other point, then interchange the points and add. The conclusion needs convexity but no second derivative.
The notation suppresses the summation index of a comultiplication; iterated indices use coassociativity. For a comodule, write .
For a coalgebra and a unital associative algebra over a commutative ring , maps have convolution , with unit . The two-sided convolution inverse of is the antipode.
A right comodule over a coalgebra over a commutative ring is a -module with a coaction satisfyingusing the canonical tensor identifications. In Sweedler notation, . The equations are the reversed-arrow counterparts of associativity and the unit law for an algebra module.[ref]
Tensor Categories by Pavel Etingof and others. Section 1.9, Definition 1.9.2, with tensor factors reversed for right comodules
For the group algebra coalgebra with , a direct sum gives a right comodule by . Conversely, expanding a coaction in the basis of group elements recovers this direct sum decomposition. Thus comodules over this coalgebra encode a decomposition indexed by , whereas modules over the same group algebra encode a group representation. More generally, the definition extends to comonoids in a monoidal category whenever the relevant tensor action is specified.
The principal CNO cycle follows , beta-plus decay to carbon-13, proton capture to nitrogen-14, proton capture to oxygen-15, beta-plus decay to nitrogen-15, and . The carbon seed is regenerated. The ordinary bottleneck is , so nitrogen-14 accumulates in cycle equilibrium.
A branch of the CNO cycle proceeds through proton captures on nitrogen-15 and oxygen-16, beta-plus decay of fluorine-17, and . Returning through oxygen-15 and nitrogen-15 closes the cycle. It also catalyzes the conversion of four protons into helium-4, with branch-dependent neutrino loss.
On a regular uncountable cardinal number , the club filter consists of all subsets containing a club set. It is a kappa-complete filter by club filter completeness. Its members are stationary sets, although a stationary set need not be a filter member, and a filter member need not itself be closed.
A subset of a regular uncountable cardinal number is stationary if it meets every club set in . Intersecting a stationary set with a club set preserves stationarity. Every member of the club filter is stationary. At a regular infinite , the stationarity of ordinals of prescribed cofinality supplies important examples.
A sequence in which is closed and unbounded in . At a successor ordinal its predecessor is a club singleton. Such sequences define minimal walks along a club sequence.
For , its diagonal intersection consists of belonging to every with . For club sets on a regular uncountable cardinal, this is a club.
For a bounded self-adjoint operator , every bounded sequence whose images converge has a norm-convergent subsequence exactly when its kernel is finite-dimensional and its range is closed, or equivalently for the essential spectrum of a bounded self-adjoint operator. Split the sequence into kernel and kernel complement: finite dimensionality gives a subsequence on the first part and the closed-range bound on the kernel complement makes the second part a Cauchy sequence. Infinite kernel or approximate null unit vectors in its complement obstruct the property.
The resolvent formalism studies the spectrum through the resolvent of an operator and its dependence on a complex spectral parameter. This connects operator theory with complex analysis.
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





