Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The Löb axiom over normal modal logic already implies . Put . Distribution gives , hence . Necessitation and distribution give ; the Löb axiom gives , which implies .
Choose cofinal ordinals , indexed by , and set . Then and . The König theorem for cardinal numbers gives . The estimate holds for every infinite cardinal number, regular or singular, under the usual axiom of choice convention for cardinal arithmetic.
For independent positive-support geometric random variables with success probabilities , all must exceed for their minimum to exceed . The resulting survival function is . This is the positive-support geometric distribution with the displayed success probability. independence is needed for multiplying the survival probabilities.
Multiply two copies of the generating function of the physicists' Hermite polynomials and integrate against . Completing the square givesComparing coefficients gives the displayed orthogonality and normalization. Equivalently differentiation in at zero justifies coefficient extraction by the Gaussian integrable bound on compact parameter ranges. Hence the unnormalized Hermite functions have norm . This proves their mutual orthogonality; completeness of that family is an additional assertion.
Expected maximum of two absolute standard normal variables by
Codex 0 Created 2026-10-31 Updated 2026-11-05
For two independent standard normal random variables, the maximum of their absolute values has distribution function for . Differentiation and integration by parts, using , give its expectation as . This exact value can detect missing factors in two-sided Gaussian-maximum estimates.
For a real symmetric positive-definite matrix , let be the Gauss-Seidel method error and . Its recurrence gives . Expanding the two squared energy norms yields . Every diagonal entry of is positive, so the error energy strictly decreases unless . In that case and the exact solution has already been reached. This identity exhibits the method as a sequence of energy-reducing coordinate corrections.
Moment-generating function of a gamma distribution by
Codex 0 Created 2026-10-31 Updated 2026-11-05
For the rate-parameterized Gamma distribution with shape and rate , integration of its probability density giveswhen , by the gamma function integral and a change of variables. The integral is infinite for . In particular the moment-generating function is finite on an open interval containing zero, so the uniqueness theorem for moment-generating functions applies. Multiplication of these moment-generating functions proves additivity of independent gamma distributions with a common rate.
For a divergence-free drift and a function with zero boundary Sobolev trace, integration by parts gives . Consequently the advection matrix in a conforming Galerkin method has zero quadratic form; its symmetric part vanishes. Adding a diffusion stiffness matrix gives a nonpositive spatial generator and a nonincreasing L2 norm in the semidiscrete advection-diffusion equation. The same identity holds with a suitable zero normal-flux boundary term instead of zero trace.
Suppose a first-order language has logical implication as its only connective and has either or both of the quantifiers, but no primitive falsity. In a singleton structure with every atomic predicate true, all atomic equalities are also true, and structural induction makes every formula true. No formula of this language can therefore express a negated equality. Quantifiers cannot repair this failure of expressive completeness, even though they add syntactic operations beyond propositional connectives.
Among sixteen binary Boolean truth functions, eight become functionally complete together with negation. The eight affine functions cannot express conjunction because composition preserves affinity. Each of the other eight truth tables has exactly one or three true rows. Negating the output if needed and selected inputs transforms its unique true row to the conjunction table. Thus conjunction and negation become definable and disjunctive normal form expresses every Boolean function.
A constant symbol is a zero-ary function symbol. Its interpretation in a first-order structure names one fixed domain element, and the symbol is a closed term. A language can contain no constant symbols unless a construction explicitly adds them.
The supraorbital nerve is a terminal branch of the frontal nerve supplying forehead and anterior scalp sensation. Its exit near the upper orbital margin provides an anatomical landmark connecting a surface sensory field to a deeper nerve course.
The supratrochlear nerve is a terminal branch of the frontal nerve supplying sensation near the medial forehead and upper eyelid. Its smaller medial territory complements the more lateral distribution of the supraorbital nerve.
For a formal power series over a field of characteristic zero, the displayed coefficientwise operation chooses constant coefficient zero. Its formal derivative is the original formal power series: differentiating the term with exponent cancels its denominator. Conversely, formally integrating a formal derivative removes the original constant term. These are algebraic identities; analytic convergence is not required.
Pressure lobes in a symmetric translating lubrication gap by
Codex 0 Created 2026-10-31 Updated 2026-11-05
For a symmetric gap on , unit lower-wall speed and equal zero gauge pressures at the ends, the flux average for a translating lubrication gap gives . Integrating gives the displayed odd pressure. It has a positive maximum at and a negative minimum at the opposite point. The converging and diverging portions of a symmetric gap therefore have opposite pressure lobes even though the geometry itself is even: the directed wall motion breaks reflection symmetry of the flow.
Countable fixed point of a normal ordinal function by
Codex 0 Created 2026-10-31 Updated 2026-11-05
If a normal ordinal function defined on all ordinals begins at a countable value and preserves countability from to , transfinite induction shows it maps all countable ordinals to countable ordinals. At countable limits this uses countable unions of countable sets, hence axiom of countable choice in the usual proof. Iteration from zero either stabilizes at a countable fixed point or has a countable limit fixed by continuity. Applying this to gives the countable epsilon number .
Precision comparisons using Fisher information must specify what one observation records. A Bernoulli distribution with success probability gives information per trial. A geometric distribution on records the number of trials until the first success. Its log-likelihood for one waiting time is , soAt equal numbers of observations, geometric waiting times therefore provide times as much information, and the asymptotic variance of their maximum-likelihood estimator is times the Bernoulli variance. But each waiting time uses an expected trials. Information per expected underlying trial is consequently . This separates an observation count from the cost of collecting the observations.
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





