Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Height above a stated planetary reference surface. For a spherical body of radius and a circular orbit of central radius , it is . Confusing altitude with central radius changes both the orbital period calculation and surface viewing geometry.
An elliptical transfer trajectory whose apogee is near the radius of a geostationary orbit. Apogee maneuvers can circularize the trajectory and reduce inclination.
Orbit-maintenance maneuvers counteracting perturbations that would move a spacecraft away from its desired orbital parameters.
For a test body on a circular Kepler orbit about a point mass , the centripetal acceleration equals , so . For a spherical extended source use the enclosed mass instead. The formula is not valid for an arbitrary nonspherical gravitational potential.
For a central potential and fixed nonzero angular momentum , the effective potential has a nondegenerate stable circular orbit when and . Its radius obeys . The radial small oscillation frequency satisfies , where . Rational frequency ratios close the linearized near-circular sketch, but generally not the exact finite-amplitude orbit; Bertrand's theorem distinguishes the exceptional harmonic and Kepler potentials.
For , the two exterior equatorial circular null geodesics of the Kerr metric have radii solving the signed equation above. The plus sign gives the prograde branch and the minus sign gives the retrograde branch. To derive it put in the double-root conditions of the equatorial Kerr null geodesic radial equation: and . Both exterior radii exceed and approach when . The horizon generators are a separate case with ; dividing by excludes them. Constant-radius null directions at other exterior radii generally have nonzero acceleration and are not geodesics.
The curved surface of a circular cylinder, excluding any flat end caps. A parametrization of a radius- cylindrical surface is , with surface area element .
For , this parametric curve closes with a corner on a unit circular cylinder. Its speed is , so its arc length is . The cylindrical surface between the curve and has the same surface area, because unrolling gives the integral .
For the minor circular arc cut off by a chord of length on a circle of radius , the sagitta is the maximum perpendicular distance from the chord to that arc:The perpendicular bisector of the chord passes through its midpoint and the center. The Pythagorean theorem gives the center-to-chord distance ; subtracting it from proves the formula. The major circular arc instead gives , so choosing the arc matters.
For , a Taylor expansion gives . In a uniform magnetic field perpendicular to a charged track's motion, , so the sagitta measures the momentum .
Maximal quantum CHSH inequality violation certifies an embedded maximally entangled qubit pair and its ideal measurement action, up to local isometries and unused ancillary systems, under the separated-device quantum assumptions. It does not identify every microscopic component of an arbitrary device. Near-maximal observed correlations require robust error bounds rather than exact identification.[ref]
Robust Self Testing of the Singlet by Matthew McKague and others. Robust Self Testing of the Singlet, arXiv:1203.2976, abstract: local bases isolate an approximate EPR pair, potentially encoded within a larger environment or ancilla
The Hermitian operator has eigenvalues on , respectively. Thus any density matrix satisfying must be : an average can equal the largest eigenvalue only when all weight lies in its one-dimensional eigenspace. The purity decouples a subsystem from its purification lemma then excludes correlations with an external environment. This argument assumes the stated measurement operators; CHSH self-testing handles unknown representations with additional qualifications.
Two separated players receive uniformly random input bits and output bits without communicating after receiving their inputs. They win when , with exclusive or . For deterministic local response functions, the four desired equalities have inconsistent parity, so at most three can hold. Shared randomness only averages such strategies, proving classical winning probability at most . In terms of correlations , the winning probability is , directly connecting the game to the CHSH inequality.
For the Bell state , let both zero-input measurements use the computational basis, and let the one-input bases be rotated by for Alice and for Bob in the real qubit plane. In the CHSH game, the four conditional winning probabilities are . They follow by contraction of the Bell state with vectors from the real orthonormal bases used for the basic measurements. Their average is the displayed expression. On , this beats exactly when and reaches at , since .
For connected components of a graph of a finite graph , choices of proper vertex colourings on different connected components of a graph are independent. The multiplication principle gives . Each nonempty factor is divisible by , hence divides the chromatic polynomial. The vanishing constant term follows by mathematical induction from the deletion-contraction recurrence for the chromatic polynomial, starting with for a nonempty graph without edges.
Here is the number of connected components of a graph in the spanning subgraph , including isolated vertices. Apply the inclusion-exclusion principle to the conditions that the endpoints of an edge have equal colours. Imposing all such conditions for forces a single colour on each connected component of a graph, yielding for positive integer . The equality extends to a polynomial identity.
For a finite simple graph on vertices with edges and no graph cycle shorter than , the coefficient of in its chromatic polynomial is for . In the chromatic polynomial inclusion-exclusion formula, an edge subset containing a graph cycle of length at least has . Thus every contribution to in this range is a forest, with exactly edges. Conversely, all -edge subsets are forests, so precisely terms contribute, each with sign .
For a cycle graph of length , the chromatic polynomial is . The graph triangle gives the base case . For , the deletion-contraction recurrence for the chromatic polynomial gives , since deleting an edge leaves a path graph and contracting it gives the shorter cycle graph. Substitution proves the formula by mathematical induction.
If a unicyclic graph has vertices and its unique graph cycle has length , each of its off-graph cycle vertices contributes a factor after its parent in a rooted tree is coloured. Thus . Substituting the chromatic polynomial of a cycle yields the displayed formula, equivalently by repeated application of the chromatic polynomial after attaching a leaf.
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





