Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Let be the weak typical set of a finite alphabet independent and identically distributed source with Shannon entropy , and let be any sets with . The asymptotic equipartition property and union bound give . Every word in the intersection has probability mass between and . Summing these bounds givesFor every fixed , the first probability eventually exceeds , proving the title bound. A sample mean within a fixed positive tolerance of the expected value supplies by the strong law of large numbers.
The type-two generating function for a canonical transformation defines and . On any branch with and , its inverse in mixed coordinates isThe square root equals on this branch. Differentiating proves the generating equations, and proves local invertibility by the inverse function theorem. Also , so the symplectic form obeys . This proves the transformation is canonical locally. It is not a single global chart across the inverse-trigonometric branch boundaries.
Since is independent of time, the transformed Hamiltonian is obtained by substitution, with zero generating-function time correction. An added function of time alone is an irrelevant Hamiltonian freedom, since it leaves Hamilton's equations unchanged.
A two-qubit gate in which an interaction shifts the energy of a selected joint computational basis state and thereby accumulates a relative quantum phase. With Hamiltonian operator , where has units of energy, an interaction time gives with . The selected basis state is part of the convention: this gate differs from the usual Controlled-Z gate at . Conjugation by a Pauli X gate on the first qubit gives , because the conjugation interchanges and .
A two-field vacuum expectation value. Its ordered, time-ordered and anticommutator versions are different distributions. For a free Dirac field, fermionic time ordering combines the positive-energy particle and antiparticle contributions into a Dirac propagator. Its nonzero value at spacelike separation does not violate microcausality, which constrains the field anticommutator.
The elastic scattering of two photons into two photons. In vacuum QED there is no photon self-coupling at tree level; its leading scattering amplitude is the sum of six oriented charged-fermion box diagrams. The superficial degree of divergence is zero, but the photon Ward identities forbid the required local dimension-four counterterm. The complete one-loop Feynman diagram sum is consequently ultraviolet finite. This does not remove its finite four-momentum dependence or its physical thresholds.
If a wrong Bell-label partner occurs with probability and differs from the intended two-bit label in positions, its contribution to the error probability of a uniformly selected bit is . Relabeling the Bell states can change while preserving the physical wrong-state probability. Thus symbol error probability and bit error probability are different quantities.
Consider a change of distant-time convention , where is constant and . This changes time labels and simultaneity slices while leaving the world lines and the metric tensor as geometric objects unchanged. In one spatial dimension,Substitute into the Minkowski interval to obtain the formula. For a timelike curve, the proper time calculated from this transformed metric tensor equals the old value. At shared departure and reunion events with , the labels also obey . Thus a distant synchronization convention cannot alter the twin paradox's reunited clock readings. It would be an error to change time labels while retaining the old diagonal metric components.
The usual convention that the empty coalition creates no value. It makes the sum of a marginal contribution vector equal by a telescoping sum. Without it, that sum is , so the vector need not satisfy efficiency in the core of a cooperative game. The constant function is supermodular but gives a zero marginal vector and fails efficiency for a nonempty player set.
A transferable utility game satisfying the displayed equality for every coalition. This forces . It does not by itself guarantee a nonempty core: core rigidity in a constant-sum cooperative game shows that nonemptiness requires the characteristic function of a coalitional game to be additive.
A transferable utility game represented by a weighted undirected graph, with one player per graph vertex. A coalition receives the sum of weights of the graph edges in its induced subgraph; absent edges have weight zero. Singleton and empty coalitions have value zero. This is a representation of a transferable utility game, distinct from a graphical description of local payoffs in a normal-form game.
Players are symmetric when interchanging them does not affect any coalition value. The displayed condition is equivalent to invariance under their transposition. If every pair is symmetric, arbitrary permutations preserve the game, and coalitions of equal cardinality have equal values. This is a property of the transferable utility game, rather than a requirement that a chosen payoff allocation treat players equally.
The probabilistic Banzhaf index averages a player's marginal contribution over all coalitions not containing that player, each given equal weight. In a simple cooperative game, it is the probability of changing a losing coalition into a winning one when every other player joins independently with probability . Its sum over players need not equal the grand-coalition value: in a three-player majority game each player has index , giving total despite . This convention differs from both the raw count of pivotal coalitions and the normalized Banzhaf index.
The name refers to John Banzhaf, whose 1965 paper addresses the mathematical analysis of weighted voting.[ref]
A value assigning a vector of payoffs to a transferable utility game has cooperative-game efficiency when it distributes exactly the grand-coalition value. This is a budget-total condition; it does not assert membership in the core of a cooperative game.
A null player has zero marginal contribution to every coalition. The axiom for a null player requires allocating that player zero. This is the zero-marginal convention used here.
A value has cooperative-game additivity when adding two characteristic functions on the same player set adds their allocation vectors. Here for every coalition. The sum of two simple cooperative games need not be simple; the axiom is naturally stated on transferable utility games.
An open promoter complex is a promoter-bound RNA polymerase assembly in which a short region of DNA is unwound and the template strand is accessible to the active site. This distinguishes it from the initially bound closed complex; it need not yet have escaped into productive elongation.
On the vector space of continuous functions of bounded variation with , the total variation of a function is a norm. Its triangle inequality and absolute homogeneity of a norm follow by applying the corresponding absolute value identities to every partition of an interval, then taking the supremum. The partition of an interval gives , so zero total variation of a function forces . The same inequality gives , proving that convergence for this norm implies uniform convergence. Without , every constant function would have zero total variation of a function.
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





