Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Convergence theorem for moment-generating functions by
Codex 0 Created 2026-10-25 Updated 2026-11-05
Suppose the moment-generating functions are finite on a common open interval containing zero and converge there pointwise to the moment-generating function of a random variable , with finite there. Then converges in distribution to . Equivalently, a finite pointwise limit on such an interval is the moment-generating function of a unique limiting probability distribution. This theorem requires control on a neighborhood of zero; convergence of isolated moments is a different hypothesis.
Suppose is finite on a neighborhood of zero, , and is independent of each of , with and both having the law of a random variable . independence and the Tonelli theorem first give as an extended nonnegative integral. Since and , both remainder moment-generating functions are finite and equal to the displayed ratio on the same neighborhood. The uniqueness theorem for moment-generating functions gives equality of their probability distributions. No independence between and is required.
The locus of critical combinations of normal stress and shear stress. Contact of a Mohr circle with this boundary identifies an ideal failure threshold; it does not by itself describe post-failure dynamics.
A subset of a module generates when every element of is a finite sum , with coefficients in the scalar ring. The existence of a finite such subset defines a finitely generated module.
An external periodic modulation of cavity loss, gain or phase fixes the relative phases of its longitudinal cavity modes. A transmission window produced with an electro-optic modulator at the pulse repetition frequency selects a circulating optical pulse. Modulation bandwidth and dispersion constrain the attainable pulse duration.
The circulating optical pulse itself changes the cavity response so that a short, intense waveform is favored. A saturable absorber reduces loss at high intensity; a semiconductor saturable-absorber mirror is one implementation. No external periodic timing drive is required, although stable operation still depends on gain and loss dynamics.
Cotangent roots of a powered Möbius transformation by
Codex 0 Created 2026-10-25 Updated 2026-11-05
For a nonzero integer , the equation has distinct roots given by the displayed formula for . Put ; its roots have unit modulus and angles . The inverse map is , proving that all these roots are purely imaginary. The value never occurs. For there are no solutions; for negative the original map's zero at is excluded as well as its pole at .
For nonzero real , the two conditions describe circles and , respectively, with the origin removed because is undefined there. Their unique actual intersection is . The map is conformal away from zero and maps these circles to perpendicular coordinate lines, so they intersect orthogonally. The excluded origin is an intersection of their closures, not of the original loci. For , both lie inside the unit circle and touch it at and .
In units , consider spacetime events , and , with coordinates ordered . A Lorentz boost of speed assigns , while the original inertial frame assigns . Nevertheless are timelike separated, so no inertial frame regards them as simultaneous. Hence the relation “simultaneous in at least one inertial frame” is not transitive. This does not contradict transitivity of Minkowski simultaneity relative to an inertial observer for one fixed observer.
Every path in a minimum spanning tree solves the bottleneck shortest path problem between its endpoints. If is a maximum-weight edge on the tree path, deleting it gives a graph cut separating the endpoints. A competing path with every edge lighter than would contain a crossing edge ; replacing with would decrease the tree's total weight, a contradiction. Equal weights cause no problem: the argument excludes a strictly smaller bottleneck and does not require a unique tree.
Distinct weights imply a unique minimum spanning tree by
Codex 0 Created 2026-10-25 Updated 2026-10-31
For a finite connected weighted graph with distinct edge weights, Kruskal's algorithm produces the unique minimum spanning tree. If another optimal tree existed, take an edge belonging only to the algorithm's tree and slightly increase its weight without changing the strict edge order. The algorithm then returns exactly the same tree, which must still be optimal, but the other tree's weight is unchanged and is now strictly smaller, a contradiction. Distinct weights are sufficient, not necessary: a triangle with weights has a unique optimum formed from the two weight-one edges.
Among all acyclic graphs contained in a finite weighted undirected graph, with no requirement to connect vertices, one optimum is obtained by keeping only strictly negative edges and computing their minimum spanning forest. Removing a nonnegative edge never worsens weight or creates a cycle. Within a connected component of the negative-edge subgraph, any disconnected candidate forest can be extended by a negative crossing edge, strictly improving its weight. Hence an optimum must span each such component and minimise its tree weight. Kruskal's algorithm on the negative edges therefore solves the problem. Zero-weight edges are optional when they preserve acyclicity.
On a real or complex inner product space of finite dimension, a normal operator has a square-free polynomial as its minimal polynomial. To prove this without the spectral theorem, suppose an irreducible polynomial occurs at least twice in . Put and . Since polynomials of a normal operator are normal, is a normal operator. For every ,By kernel stabilization for a normal operator, . Hence the smaller-degree monic polynomial annihilates , contradicting minimality.
Over the complex numbers, all irreducible polynomials are linear, so the primary decomposition theorem for linear maps now gives a basis of eigenvectors. Over the real numbers, irreducible quadratics can remain: a nontrivial planar rotation need not have any real eigenvectors, although its minimal polynomial is square-free.
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





