Topics (374k) Articles (387k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For the negative binomial distribution with mean and size , the one-observation score function in the mean is . Its size derivative is , whose expectation is zero. Thus the expected Fisher information matrix is diagonal in . Regular interior maximum-likelihood estimators have zero asymptotic cross covariance, without necessarily being independent in finite samples.
For scalar interest parameter , choose new nuisance coordinates and keep fixed. The transformed interest score function is , so the displayed differential equation makes its Fisher information cross-block with the nuisance score zero. Under smoothness and nonsingularity it has a local solution from initial coordinates on a fixed interest slice. Orthogonality is local expected-information decoupling; it implies first-order asymptotic independence of fitted blocks, not exact independence or nuisance-free conditional inference.
For a regular interest/nuisance parameterization with parameter orthogonality, this nuisance-information adjustment approximates a conditional likelihood construction and reduces first-order nuisance effects. It is related to modified profile likelihood but is not a universal substitute for its sample-coordinate Jacobian. When the constrained and full nuisance fits coincide in the relevant ancillary coordinates, that Jacobian is one and the two expressions agree. For normal variance with unknown mean, it replaces the profile's by the residual in the logarithmic variance term.
In a normal linear model whose predictor columns are orthogonal to the intercept, two coefficient blocks are orthogonal statistical parameters precisely when the cross-block Fisher information is zero, equivalently the displayed design cross-product vanishes. Then is block diagonal, so the corresponding least-squares estimators have zero covariance and, being jointly Gaussian, are independent. Their fitted subspaces are orthogonal and their extra sums of squares do not depend on which block is added first.
In a regular common-support statistical model with probability density function , the score function in is . Its zero expectation gives for . The mixed log-likelihood derivative is , so the cross Fisher information matrix block vanishes. At zero the same conclusion follows by continuity when the regular derivatives extend there. This proves parameter orthogonality; it does not establish exact independence of fitted parameters.
A factor loading is the coefficient of latent factor in observed variable . In the orthogonal factor model, . If has variance one, this is also its correlation with the variance-one factor. Its sign and size depend on the factor-coordinate convention; factor rotation preserves the implied covariance while changing individual loadings.
The communality is the variance of the shared-factor contribution to variable . In an orthogonal factor model, , where is its specific variance. For standardized variables, . It measures variance shared through the modeled factors, not variance in a chosen principal component.
An orthogonal rotation of factors leaves unchanged and hence preserves the model covariance. It proves rotational nonidentifiability of the unrestrained factor loadings. Choose an orientation for interpretability, for example varimax rotation, or impose identifying restrictions in a confirmatory model. An oblique transformation permits correlated factors: if becomes , their covariance becomes , preserving the same shared covariance.
This collects the gradient, divergence, curl and Laplacian formulas in cylindrical and spherical coordinates. Coordinate unit vectors vary with position, so taking their derivatives is essential when translating vector calculus operators from Cartesian coordinates. Curl in spherical coordinates is one of these formulas.
The weighted strain density in Ornstein-Uhlenbeck multiplicative amplification evolves under . Setting eliminates its first derivative. Shifting and scaling to gives . The quantum harmonic oscillator levels yield the displayed eigenvalues. Its ground state is the dominant positive mode; higher sign-changing modes may occur in a transient expansion.
In global coordinates the de Sitter spacetime metric is . A global frame of a vector bundle orthonormal for the round metric on gives the displayed global pseudo-orthonormal frame. For example, identify with the unit quaternions and use . Choosing the spatial orientation and the future direction consistently gives a section of a fiber bundle for the oriented, time-oriented frame bundle. The principal bundle trivialization by a global section then proves that bundle is trivial.
On the orbit of a face , the monomial , with , vanishes exactly when . Its reduced zero locus is consequently the union of those orbit closures. The principal subscheme need not be reduced: and have the same support but different ideals.
// Target: geometry-and-topology.bigb
Let be the sum of independent identically distributed real increments. For a finite convex function , integrability of and implies integrability of for every fixed . Its negative part is controlled by negative part of a finite convex function is Lipschitz. For , if the increment law is unbounded above, take an independent increment with . On this event convexity gives , so the expectation is bounded by . If increments are bounded above by , use and bound the positive part by . For , use the symmetric lower-tail argument. This supplies translated integrability without assuming integrable increments or a growth bound on .
The transition operator of an additive random walk preserves convex functions: apply their convexity inequality to and , then integrate. The pointwise maximum of convex functions preserves convexity too, so induction proves convexity of the Snell envelope Bellman functions. Expectations are allowed to be extended-valued until finiteness is justified. Integrability of rewards on a finite horizon implies finiteness of these functions at every state for , by integrability of translated convex random-walk rewards and the bound . At time zero only is observed; if is infinite elsewhere, its finite value at zero has a constant convex extension representing the same Snell envelope. Full statewise Bellman recursion at time zero requires an additional translated-integrability hypothesis.
In this temporal sense, the optical coherence length is , where is the vacuum speed of light and is an explicitly chosen optical coherence time. It measures a delay as a vacuum-equivalent path difference; it does not measure transverse spatial optical coherence. [ref].
For the stipulated profiles, the convention gives for the Lorentzian and for the Gaussian. In a vacuum Michelson interferometer, changing one mirror position by changes the round-trip delay by , so the mirror travel to either of these delays is . In a medium, convert physical travel using the actual group delay, which can depend on frequency. For a narrow line centered at vacuum wavelength , differentiating gives ; this small-width approximation must use consistently defined spectral widths.
Allow terminal positions of an infinite game of perfect information to carry a losing-player label. A clopen set of infinite winning plays still gives a determined infinite game. At a position where all infinite continuations have one winner, the other player can win only by forcing a terminal loss for that winner. The usual winning-position attractor in an infinite game decides this reachability game. The tree of remaining undecided positions is well-founded: every infinite branch would eventually have its clopen payoff decided by a prefix. Assign the already decided winners upwards by well-founded recursion. Terminal labels are essential; a terminal node created by a covering need not be lost by the player whose turn would have come next.
For and , the translational branch of one-sided kinetic solidification dispersion has . Expand and substitute to prove this limit. At zero growth, , and the destabilizing right side has sign . For nonnegative real , the residual has derivative at least one, so there is one growing root precisely when . Thus instability exists exactly when , with unstable band , for . At threshold the next term is . Surface energy removes short-wave growth even when long waves remain unstable.
The cubic follows by eliminating from one-sided kinetic solidification dispersion, with . For , the interface branch tends to . For fixed , substituting gives , hence . At the balance is , giving . For , and . Stronger capillarity can remove the real isolated interface mode from the chosen thermal branch; it does not create growth. These distinctions explain why replacing by is not a controlled fixed-capillarity limit.
The initial cost of the one-period quadratic hedge is . This pricing weight satisfies and . Among square-integrable weights satisfying these equations it has the smallest squared norm:For another admissible weight , its difference from is orthogonal to and all coordinates of , hence to . The Pythagorean theorem in an inner-product space gives . This weight can be signed; positivity, and hence interpretation as a state-price density, requires additional assumptions.
If has a multivariate normal distribution with mean and invertible covariance , and has bounded gradient, Gaussian integration by parts gives . Consequently the risky holdings of its one-period quadratic hedge equal the expected payoff gradient. The initial cost is . Bounded gradient ensures linear growth and square integrability, even if the payoff is not bounded.
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





