Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Suppose one observation comes from either or , each with prior probability . A decision rule that chooses on an event and otherwise has success probabilityOn a finite set, choosing therefore gives . This is the equal-prior version of minimum sum of errors in a simple hypothesis test; allowing a statistical test to use an auxiliary random variable cannot improve it, because for each outcome the better of the two decisions already maximizes its contribution.
For the four-outcome example, choose after and after or , with either decision allowed after . Choosing after yields . The best success probability is 65%, with a 35% error probability. A smaller total variation distance means the two sources are harder to distinguish from one observation. Unequal prior probabilities, unequal costs, or multiple observations change this particular decision problem; the figure is not a universal bound for every experiment.
Consider the probability mass functions and on the finite set . Their difference is . ThusThe event attains this difference: and . Combining and gives the same absolute discrepancy with the opposite sign. Adding to either event changes nothing, because its probability mass agrees under both probability distributions.
The factor is necessary because : every unit of excess probability mass must match a unit of deficit. For any event, including a negative term cannot increase its signed discrepancy, while omitting a positive term cannot increase it either. Therefore attains the positive maximum. This is a short way to compute an apparent optimization over subsets using one pass through .
For probability density functions relative to the same measure , the corresponding identity is . Such densities can always be taken as Radon-Nikodym derivatives relative to . Beware the notation: the total variation norm of a measure applied to the signed measure equals . A formula using that norm without its factor is using a different normalization.
Torsion balance zero drift is slow motion of the unloaded reference angle during a measurement. If the torsion constant remains fixed, a constant applied torque gives . For two equal and opposite applied torques measured at the same reference zero, their equilibrium angles differ by . A stable offset cancels; a changing zero contributes and does not cancel automatically.
A simple symmetric sequence makes the limitation explicit. Let be settled equilibrium angles for applied torques at equally spaced times . If the unloaded zero is linear in time, , and and remain fixed, thenThe arithmetic average of the outer zero values equals the middle zero, so both the constant offset and linear drift cancel. Curved zero motion, unequal time spacing, changing torsion constant, changing signal strength, or unsettled oscillations violate these assumptions. This is an algebraic control example, not a claim that every torsion balance follows a linear drift law.
The torsion constant, or torsional spring constant, is the positive restoring torque per unit twist angle of a complete suspension in its linear elasticity range:Its SI unit is . The minus sign describes restoration toward the untwisted orientation. The derivative specifies a local stiffness if the response is not globally linear; using one constant over a finite range additionally requires a straight calibration curve. Return to the same zero after unloading tests recoverable elastic deformation; repeat loading in both directions to check whether the response depends on its previous loading. Staying below permanent deformation is necessary, but does not alone prove proportionality between torque and twist.
For an ideal uniform circular wire of length , radius , and shear modulus , the filament torsional stiffness is , with polar second moment of area . Uniform twist gives as the twist per unit length, soHere is stored elastic energy. Doubling the wire's radius multiplies the ideal torsion constant by ; doubling its length halves it. This explains why a long thin fiber is useful for weak torque measurement. The formula assumes linear elasticity with uniform material and circular section; it does not calibrate arbitrary ribbons, clamps, or a compound suspension. Within this ideal model, the equipartition theorem predicts an equilibrium thermal mean-square angular displacement , where is the Boltzmann constant and the uniform absolute temperature. A softer suspension magnifies both the signal and its thermal fluctuations.
Static calibration supplies known torques without assuming the unknown interaction being measured. Apply a known perpendicular force at lever arm , record the change from the unloaded twist, and useSeveral positive and negative settings test proportionality; fit the slope of applied torque against twist and retain a possible intercept. A nonzero intercept must not be silently absorbed into the slope. Convert degrees to radians before reporting . PASCO's procedure turns the Coulomb balance on its side and adds small known masses to generate a gravitational weight at the sphere's lever arm, returning the rod to its index mark by turning the dial. Its tabulated coefficient is force per degree: multiply by the lever arm and to obtain our torsion constant. [ref]
https://cdn.pasco.com/product_document/Coulombs-Law-Apparatus-Manual-ES-9070.pdf. Bruce Lee, PASCO ES-9070 manual, pp. 9–10: mass calibration and force-per-degree convention
The figure's ideal static calibration uses : an applied torque of gives . Both signs lie on the same straight line. The plotted points are calculated examples, not experimental observations; they cannot demonstrate a real fiber's linearity.
Dynamic calibration instead measures the oscillation period with known total suspended moment of inertia . For negligible damping, small free oscillations about a fixed reference obey simple harmonic motion:Include the rod, mirrors, and any attachments in unless their contributions are demonstrably negligible. Keep the applied torque absent or independent of angle. If an external torque has derivative at equilibrium, linearization gives effective stiffness : timing alone then measures that combination, and stability requires . A constant applied torque merely shifts equilibrium. Non-negligible damping changes the measured period; damped torsional oscillation gives a correction under a specified damping model. Agreement between static and dynamic calibrations is a useful check on the assumed moment of inertia, reference stability, and restoring law, rather than a reason to ignore their assumptions.
For a simplex with vertices indexed by , let closed sets have the property that every face spanned by an index set lies in . Then is nonempty. The triangle KKM lemma is a two-dimensional covering formulation of this simplex-intersection principle.
A topological space is normal when every two disjoint closed subsets have disjoint open neighbourhoods.
An -dimensional topological disc is a space homeomorphic to a Euclidean ball in , with its open or closed convention specified. A closed disc is homeomorphic to . The planar disk is the Euclidean two-dimensional instance, rather than the whole abstract topological class.
A planar Euclidean disk consists of the points within a fixed radius of a centre, with either the open or closed boundary convention. The closed disk centered at the origin is and has area . It is the two-dimensional closed Euclidean ball; the general closed disc may have any dimension.
The closure of a subset of a topological space is the smallest closed set containing . Equivalently, it is the intersection of all closed sets containing , or the set of points whose every neighbourhood in meets . The notation makes the ambient topological space explicit. This definition works without a metric or any appeal to sequences. [ref]
https://math.mit.edu/~hrm/palestine/munkres-topology.pdf. James Munkres, Topology, closure and interior of a set
For in the usual real line, : every neighbourhood of meets , while a point outside has an open ball disjoint from . Passing to the closure adds the missing endpoint and retains all original points, including isolated points when present. In general, the closure is together with its limit points; its individual points are the adherent points of .
The closure turns an arbitrary subset into a closed set with no unnecessary added points. It satisfies and ; a subset is closed exactly when . In a metric space, exactly when some sequence of points of has limit of a sequence : choose its th point in . For a general topological space, keep the neighbourhood definition; sequences need not detect every point of the closure.
A topological space is extremally disconnected when the closure of every open set is open. This concerns open sets, not arbitrary subsets. In particular, a nonisolated singleton in a Hausdorff space is closed but not open, so its closure gives a counterexample to that stronger condition.
The th symmetric product of a space is , where the symmetric group permutes the factors. Its points are unordered -tuples, with repetitions allowed. If is a Riemann surface, elementary symmetric functions in local complex coordinates make its symmetric product a smooth complex manifold, including along the locus of repeated points. A collection of disjoint circles in gives a product torus in this symmetric product.
The lower limit topology on has basis of a topology . Every such nonempty interval contains a rational, so this topological space is separable. Its topology is finer than the usual Euclidean topology; the one-sided basic neighbourhoods allow its square to have an uncountable discrete antidiagonal.
On an infinite set, the family consisting of all finite subsets and the whole set need not be closed under arbitrary unions. On , the union of the singleton subsets of is infinite and proper, so this family is not a topology. It must not be confused with the cofinite topology, whose proper open sets have finite complements.
Given a partition of a set, declare a subset open precisely when it is a union of partition blocks. Arbitrary unions and finite intersections of such unions are again unions of blocks, giving a topology. The quotient map to the block set with its discrete topology pulls that topology back to the original set. For the partition of into its two parity classes, the only open sets are the empty set, those two classes, and all of .
A closed cover of a topological space is a family of closed sets whose union is the whole space. A finite closed cover can be used in separation and antipodal arguments: in a metric space, vanishing distance to a closed member means actual membership. Unlike an open cover, a closed cover does not automatically have a partition of unity subordinate to its members.
A topological space is hyperconnected if any two nonempty open sets intersect. Every continuous map from a nonempty hyperconnected space to a Hausdorff space is constant: two distinct image points would have disjoint open neighbourhoods whose nonempty inverse images contradict hyperconnectedness. Every infinite set with the cofinite topology is hyperconnected.
These sets form a topology: a nonempty union of upper rays is another upper ray, or all of when their endpoints have no lower bound; a finite intersection of rays has endpoint the maximum of their endpoints. The whole line must be included. The continuous map from with the cofinite topology to this space is nonconstant, because each upper ray has cofinite inverse image.
The Fell topology on the closed subsets of a locally compact space has subbasic open sets requiring intersection with an open set or avoidance of a compact set. On a locally compact separable metric space, its sequential convergence says that every convergent subsequence of points from the varying sets has its limit in the limiting set, and every point of the limiting set is approximated by points from the varying sets.
The nonempty open sets are the upper tails of the natural numbers. Arbitrary nonempty unions select the smallest starting index, and finite intersections select the largest, so these sets form a topology. A map into this space is continuous exactly when the inverse image of every upper tail is open.
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







