Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a unital star-subalgebra , its unit ball is dense in the unit ball of in the strong operator topology. The same holds for self-adjoint unit balls and for positive unit balls, and the full unit balls may be approximated strongly together with their adjoints. Passing first to the norm closure allows continuous functional calculus; resolvent identities prove strong continuity of continuous functions vanishing at infinity, even for unbounded approximating nets of self-adjoint operators. A cutoff function supplies the norm bound, and a two-by-two self-adjoint matrix removes the self-adjoint restriction.
Virasoro generators are the contour modes of the holomorphic stress tensor in a two-dimensional conformal field theory. Their commutators are . A contour around an operator insertion extracts the corresponding coefficient of its stress-tensor operator product expansion. generates translations, measures holomorphic weight, and all positive generators annihilate a primary state. An independent antiholomorphic copy acts on the other weight.
An irreducible unitary highest weight module of the Virasoro algebra with has integer , , , and the displayed weights. Labels and represent the same module. It is obtained from the Verma module by quotienting its zero-norm submodules; the two generating singular-vector levels are and . For this is the trivial module. For , the three weights are , , .
For a restricted representation of an affine current algebra with and , the displayed normal ordering construction is defined when . Moving the currents past each other gives ; the additional in the denominator is the adjoint-Casimir reordering term. The resulting Virasoro algebra has central charge . On a compact unitary positive-energy module, .
A unitary highest-weight Virasoro module is generated by a normalized vector satisfying the displayed relations, with a positive-definite inner product and . Its Virasoro descendants have eigenvalues for nonnegative integral levels . The commutator gives , so unitarity requires . Such a module is a quotient of a Virasoro Verma module; its Unitary Virasoro discrete series describes the cases with central charge below one.
The Virasoro Verma module is the universal highest-weight representation with central charge and ground weight . The Poincaré-Birkhoff-Witt theorem gives a basis with . Its invariant Hermitian form is fixed by and the norm of the ground vector. Quotienting by its maximal proper submodule produces the irreducible highest-weight module; in the unitary cases this removes the null vectors.
A Virasoro character records the graded dimensions of a positive-energy Virasoro algebra module. A state of weight contributes , and its multiplicity is the dimension of that energy eigenspace. The shift accounts for the Casimir energy of a two-dimensional conformal field theory. For a Virasoro Verma module, the character is , by counting the ordered descendant basis.
For identical open-string tachyons, . At , the ordered Veneziano amplitude residues in the and terms differ by , so their symmetric sum cancels odd-level -channel poles at generic . In particular the massless vector does not couple to this identical-scalar singlet amplitude. It remains a state of the open-string spectrum and is visible in suitable ordered or color-dependent amplitudes. Pole absence due to an external-state selection rule must not be interpreted as absence of the exchanged state from the theory.
Vector normalization is not a linear map. With and ,Consequently, adding individually normalized directions does not generally give the direction of the original vector sum. Compute the intended vector sum first, then normalize it if it is nonzero. Cancellation is a further boundary case: has no normalized direction even though both nonzero summands do. A numerical algorithm must check that case before dividing by the norm.
The local flow of a smooth vector field is the family of solutions of its ordinary differential equation, with . Uniqueness gives wherever defined. A compactly supported smooth vector field on a manifold without boundary is complete, so its flow exists for all real times.
For an oriented closed polygon, triangulate with a common vertex . Its total vector area is ; the terms involving telescope, giving the displayed boundary-only formula. Its signed projected area along a unit vector is . The maximum is , in direction if nonzero, and zero projections have directions perpendicular to . If , every direction has zero signed projection despite possible nonzero unsigned surface area.
A sheet with stress-free surfaces supports nearly uniform cross-thickness extensional motion. Its diverging long-wave mobility compensates the weak pressure gradient, leaving the nonzero rate limit in the creeping-flow model. The exactly uniform thickness change is excluded at fixed volume, and unsteady inertia or finite domain size can regularize the limiting prediction. Strong surfactant immobilization instead makes the rate vanish quadratically with wave number.
Let be disjoint, equally sized, nonempty sets, with . Suppose an intersecting family is unchanged by all such UV-compressions of smaller size. Then its -UV-compression is still an intersecting family. Indeed, a newly moved member can only be disjoint from a retained old member , since two newly moved members share . Here and . If , retaining forces to have been present, contradicting the old intersection property with . Otherwise choose with and . Stability under the smaller -UV-compression forces to be present; this member is disjoint from , again a contradiction. Repeatedly applying a changing UV-compression of smallest size terminates, since the sum of lexicographic order positions decreases. A terminal set family is a lexicographic initial segment: a missing earlier member and present later member would be moved by , .
In a complete market with a unit cash asset and normalized strictly positive state-price density , the optimal positive terminal portfolio wealth is whenever it is replicable in the admissible class. The state-price budget constraint is an equality: . The utility conjugate inequality gives for every affordable positive claim. This value can be infinite, because while need not be finite. Even completeness for bounded claims suffices to approximate the value: set and . Each claim is bounded and costs , while its expected logarithmic utility tends to the displayed value by monotone convergence after an integrable lower bound is subtracted.
Geometric maximum of an upward skip-free random walk by
Codex 0 Created 2026-10-14 Updated 2026-10-31
Let the increments define an upward skip-free random walk, and suppose is finite for all . If satisfies and , the exponential tilting at gives integrable increments of positive mean. The strong law of large numbers makes every nonnegative integer level attainable under this tilted law. Upward jumps are at most one, so the value at a first level hit is exactly that level. The stopped likelihood ratio under exponential tilting therefore gives hitting probability for integer . Subtracting consecutive tail probabilities yields the displayed geometric distribution on . For real thresholds use in place of .
The least upper bound in a partially ordered set of a subset , when it exists. It bounds every element of and is at most every other upper bound. For two elements it is written ; an empty join is a least element.
For an up-and-in claim in the dividend-free Black-Scholes model, set , and assume finite absolute payoff expectations. Its initial price equals the risk-neutral pricing value of the displayed European option. To prove this, express the log-price as and apply the joint endpoint and maximum law for drifted Brownian motion. Above the logarithmic barrier , use the unrestricted endpoint density. Below it, the density of paths which hit the barrier is . Substitution gives the scaled payoff, the threshold , and the factor . This is an initial-price identity, not a pathwise equality of terminal payoffs.
Hilbert-Mumford criterion for the affine null cone by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For complex , choose a sequence taking an unstable vector to zero and apply singular value decomposition to each group element. Compactness gives a limiting right-unitary factor. Every nonzero torus-weight component of the transformed vector forces a strict linear inequality on the diagonal exponents. A rational solution of these finitely many strict inequalities scales to integral exponents with sum zero, producing an algebraic one-parameter subgroup that takes the vector to zero. The converse follows immediately from the subgroup limit.
A closed lambda term is easy if adjoining to the equations of beta equivalence remains nontrivial for every closed lambda term . If is easy, then is easy for every closed : use the consistent equation to obtain . Since is not easy and solvability produces by applications, easy terms are unsolvable. The converse need not hold.
After a fixed even-depth prefix, Player I announces a move and a set of first exit positions from a closed set of infinite plays. Player II accepts, or challenges an exit . Acceptance follows the old game until the first exit, where I wins exactly when that exit belongs to . A challenge forces play through and then resumes the old game. Infinite accepted plays remain in the closed payoff; infinite challenged plays are outside it. Thus the pulled-back payoff is clopen. For an I-strategy, transfer by initially accepting and switching to the challenged simulation at an exit in . For an II-strategy, announce the set of exits that this strategy never challenges under any announcement; it must accept this set. An exit outside it permits a challenged simulation, while an exit inside it is a premature loss for II. These maps prove the game covering lifting condition, rather than merely continuity of the projection.
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





