For the cubic-matter no-scale vacuum with an exponential dilaton, put and . At , zero energy requires . On a fixed-imaginary-part slice, gives . At the double root , the first derivative vanishes but the second is , so . Therefore begins at fourth order. This real scalar has zero quadratic mass but is not an exact flat direction of a scalar potential. The imaginary part of is still lifted quadratically, and the matter field also has a quartic leading potential. Exact flat directions instead come from the complex volume modulus along the zero-energy locus.
Minimize the displayed criterion using a Leave-one-out cross-validation estimate in the second term. Its expectation is the exact mean integrated squared error minus , which does not depend on h. With standard smoothness and appropriate search ranges, the chosen bandwidth is asymptotically optimal. Its relative fluctuations are ordinarily of order , considerably larger than the estimation error achievable by well-chosen plug-in pilots.
Subtract the diagonal variance contribution from the derivative estimate's squared norm, then insert the result into asymptotic mean integrated squared error. The expected curvature estimate equals , apart from a negligible finite-n term. This makes the resulting criterion asymptotically correct even though it is not an exactly unbiased estimate of integrated risk. Under standard conditions its selector is ratio-consistent with the optimal bandwidth and has relative fluctuation order .
Nested cross-validation separates selection from assessment using two levels of held-out data. Within each outer training fold, inner cross-validation chooses a model or tuning parameters; the complete selected fitting procedure is then applied to that outer training fold and scored on its untouched outer evaluation fold. This estimates the performance of the model selection procedure, including its choices, rather than reusing its best inner score as an assessment. A final model can then be selected and fitted using all available training data. [ref]
Cross-ratio construction of generalized-circle reflection by Codex 0 Created 2026-10-14 Updated 2026-10-25
Normalize three distinct points on a generalized circle by a Möbius transformation taking them to . The inverse image of the extended real line is their generalized circle, and , with , fixes that circle pointwise and squares to the identity. Changing the three normalizing points replaces by with a real-coefficient Möbius map . Since commutes with conjugation, is unchanged. Thus this construction depends only on the circle. It is inversion in a circle for an ordinary circle and Euclidean reflection for a straight line, each extended to the Riemann sphere.
The cross-product matrix obeys and , by the vector triple product. On the orthogonal complement of a nonzero , this is ; hence the two remaining complex eigenvalues are . In an orthonormal basis adapted to , is a planar quarter-turn multiplied by , with zero action along its axis.
In the quasistatic spherical model, . Separating the radius equation gives , which is finite and evaluates to the displayed expression. Near disappearance, . The time diverges logarithmically as the initial radius approaches the critical radius from below.
Assume deterministic discount factors, deterministic risk-neutral default intensity , fixed fractional recovery , and continuous premium until default or maturity. Survival is . Expected discounted protection is , while premium is . Equating them gives the par spread. Constant intensity gives . Discrete premiums, default accrual, stochastic recovery and counterparty losses require changing the corresponding cash-flow expectations.
A basket credit contract whose protection payment is triggered by the first specified default among its reference entities. The loss and settlement terms refer to the defaulting name according to the contract. Premium generally stops at that first default or maturity. Pricing requires the joint default-time distribution; separate marginal default probabilities alone do not determine the first-default law.
For symmetric negative semidefinite matrices , each factor has norm at most one, since its eigenvalues are with . The same holds for , so their ordered product is a contraction for every , whether or not commute. This proves unconditional discrete L2 norm stability of the split Crank-Nicolson method for directional diffusion. Its splitting error remains first order in general, because the product's quadratic defect is .
Toric irrelevant ideal by Codex 0 Created 2026-10-14 Updated 2026-11-05
For the polynomial Cox ring of a normal split toric variety whose toric rays span the ambient real toric lattice space, the toric irrelevant ideal is
The Cox construction uses the open set . For the projective line, the two maximal toric cones give generators , so the excluded locus is the origin. For affine space, one maximal toric cone contains every toric ray; the empty product is one, hence and nothing is excluded.
The ray-span/no-torus-factor hypothesis belongs to this polynomial presentation. A pure algebraic torus has no toric rays and requires its algebraic torus coordinates in addition to the displayed polynomial data.[ref]
// Target: geometry-and-topology.bigb
For a normalized spherical harmonic of degree , write and . Integration of the radial Poisson equation gives , where . Cauchy-Schwarz inequality and give the displayed bound on . For bounded density amplitudes with fixed radial support this decays as , giving a quantitative angular short-scale justification of the Cowling approximation.
Plane-parallel Cowling displacement-pressure equations by Codex 0 Created 2026-10-14 Updated 2026-11-05
Take depth positive downward, vertical fluid displacement positive upward, and Lagrangian pressure perturbation . In a plane-parallel atmosphere with , the Cowling approximation and adiabatic relation give
Indeed the Eulerian perturbations are and . Horizontal momentum gives ; combine this with mass conservation and vertical momentum to eliminate the horizontal displacement. Reversing the sign convention for vertical displacement reverses both displacement-pressure coupling signs.
A covering of an infinite game unravels a payoff when its inverse image is a clopen subset of the new infinite-play space. A closed payoff can be unravelled by letting Player I announce a subset of the first exit positions, and letting Player II accept that announcement or challenge one announced position. Accepted plays stop at exit positions, while challenged plays are forced through the challenged exit. Strategy-transfer maps make this more than an ordinary continuous representation of the payoff. Depth-stabilizing inverse limits of coverings handle countable unions in a transfinite induction.
In a sequence of game coverings whose unchanged initial depths tend to infinity, each finite game-tree level eventually stabilizes. These stable levels form a limit game. Compositions of prefix projections and depth-local strategy maps give limit projections and strategy maps. Lift a compatible play coherently through successive coverings. If no premature loss occurs, stabilization of its finite prefixes supplies a compatible limit play. If a premature loss occurs, subsequent lift lengths cannot increase and eventually stabilize, supplying a losing terminal limit play. This proves the lifting condition for the limit covering. It makes countably many pulled-back payoffs clopen simultaneously in the covering proof of Borel determinacy theorem.
A coverage coalitional game has a nonempty core of a cooperative game exactly when all resource sets are pairwise disjoint. Singleton coalition constraints require , while efficiency requires . Any overlap makes these inequalities inconsistent. When there is no overlap, the allocation is the unique core allocation and gives every coalition its value exactly.
Decompose a coverage coalitional game into one-resource games and use additivity of the Shapley value. A player contributes a resource precisely when it is the earliest player in a random ordering among those holding that resource. Each holder has probability the reciprocal of the number of holders of being earliest. Summing these contributions proves the formula, regardless of overlaps or emptiness of the core.
Use and . The Faddeev-Popov gauge-orbit identity with Lorenz gauge function , followed by Gaussian averaging of , supplies the quadratic gauge-fixing term. Represent the determinant of using a Grassmann Gaussian integral over a Faddeev-Popov ghost field and antighost field to obtain the ghost term. The minus sign in this operator differs by a field-independent determinant factor from the direct gauge-condition Jacobian; it is a consistent antighost convention.
The ghost term equals up to a boundary term. Thus it contains a ghost-gluon vertex with the sign matching this kinetic convention. An equivalent auxiliary-field form replaces the gauge-fixing term by . The Nakanishi-Lautrup field equation gives and recovers the displayed Lagrangian. With left-acting BRST transformations , , , and , the gauge-fixing and ghost terms together are .
The limit of covariant gauge fixing by . It imposes the divergence condition sharply and gives a transverse photon propagator. This is distinct from the vector-potential choice called Landau gauge for a uniform magnetic field when computing Landau levels.
The Fourier-space quadratic Maxwell kernel after adding . For nonzero and non-null four-momentum, its transverse and longitudinal momentum projectors give and its inverse is . The inversion of the gauge-fixed Maxwell kinetic operator supplies the photon propagator with its vacuum boundary prescription.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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