Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For an -bit unsigned dividend and positive divisor , read the dividend bits from most to least significant. If the processed prefix is , maintain with . Appending bit gives trial remainder ; append quotient bit and replace the remainder by . This preserves the quotient–remainder identity.
The old dividend and new quotient can share one -bit processor register: after iterations its value is , where . The shifted dividend occupies the upper positions and the accumulated quotient occupies the lower positions, so no information is overwritten. The high processor register holds . For an -bit dividend the next trial remainder is no larger than the next prefix, hence fits in bits through the final iteration. This last bound is specific to the dividend width; it must not be assumed for unrestricted multiword dividends.
The anterior part of the insular cortex. Interpreting activity here requires task contrasts and alternative-process controls, rather than treating the location as an empathy-specific marker.
Let be the vector space of real polynomials of degree of a polynomial at most . Choose distinct real sample points and positive real weights . Thenis an inner product. Symmetry and bilinearity follow from linearity of polynomial evaluation. Its value at is nonnegative, and equality forces all . By the root bound for a polynomial, a nonzero polynomial of degree of a polynomial at most cannot vanish at distinct points. Thus the form has positive definiteness.
Equivalently, the polynomial evaluation map on a finite point set identifies with , equipped with a weighted Euclidean inner product. Too few sample points destroy positive definiteness: if the distinct points number at most , the nonzero polynomial lies in and has zero sampled squared norm.
For three equally weighted samples at , an orthonormal basis isThis construction gives a finite sampling version of orthogonal polynomials and permits exact Gram-Schmidt orthogonalization using only finitely many evaluations.
On real symmetric matrices of size , the displayed pairing is symmetric because . It is not bilinear: , whereas linearity would require . Its self-pairing is always nonnegative, but a nonzero singular matrix has , so positive definiteness fails as well. For it reduces to the ordinary real inner product. The Frobenius inner product supplies the appropriate bilinear, positive-definite geometry in every size.
An initial-boundary value problem specifies a partial differential equation, initial conditions, and boundary conditions. For example, the half-line wave equation requires an initial displacement and initial velocity for together with an endpoint condition such as for . Its meaning also depends on the chosen solution class: a classical solution satisfies the equation pointwise, while a weak solution satisfies an integrated form. These data must obey the compatibility conditions needed by the chosen regularity.
An experimenter taps once or twice and the child must produce the opposite count. The task taxes inhibition of imitation together with maintenance of the response rule; its score is not a process-pure measure.[ref]
Control of the influence of an observed action when a different action is required. It can be studied through compatible/incompatible response tasks with separate controls for spatial interference.
An infrared regulator suppresses the small-momentum region responsible for an infrared divergence. Examples are a small positive mass or a finite volume. It must be distinguished from an ultraviolet cutoff: setting external momenta and masses to zero to extract an ultraviolet divergence can introduce a spurious infrared divergence. Keep a positive auxiliary mass until the divergent local coefficients have been separated, then take the desired limit in infrared-safe quantities.
In an extensive-form game, a player has imperfect information when some decision information set contains more than one node. The player cannot distinguish those histories at the time of acting. This does not itself imply failure of perfect recall: a player can remember all their own earlier information and actions while never having observed an opponent's hidden choice. Conversely, merging histories in which the player's own earlier actions differ violates perfect recall.
The contribution of a symbol with probability to Shannon entropy, with . It is a concave function because on and its endpoint extension is continuous. Its sharp bound for pairs exactly distance apart in isTo prove this, the increment decreases with , from to . For , the maximum is : the difference vanishes at zero and one half and has second derivative between them. Hence it is nonnegative by concavity.
For probability mass functions on symbols, set and . The entropy summand bound gives . The triangle inequality and Jensen's inequality giveAt , use the continuous value zero. This proves uniform continuity of Shannon entropy on a fixed finite alphabet; the alphabet size appears explicitly in the bound.
Finite cross entropy bounds countable information entropy by
Codex 0 Created 2026-10-25 Updated 2026-10-31
Let and be probability mass functions on a countable alphabet, with whenever . If the cross-entropy is finite, then is finite, , and . To avoid assuming the desired finiteness, first apply with to each positive . For a finite initial segment,Zero coordinates satisfy this inequality too. Monotone convergence of the nonnegative information entropy summands and convergence of both total masses give . Both logarithmic sums are then finite, justifying their difference and the relative entropy identity. This supplies a rigorous route to the maximum entropy distribution on the nonnegative integers without presupposing finite information entropy for every competing law.
For a nonempty bounded array of real numbers, taking the supremum of each row and then the supremum of those values gives the supremum of all entries. Every row supremum is bounded by the global supremum; conversely, every entry is bounded by the iterated supremum. The same argument with lower bounds proves . Mixed infima and suprema satisfy the weak minimax inequality rather than an equality in general.
A derived inference rule abbreviates a logical derivation from the primitive inference rules. Its use retains the assumptions and side conditions required by that logical derivation; proving the abbreviation once allows subsequent proofs to use the rule without expanding every intermediate line.
Induction of the planar square representation to the symmetric group on four letters by
Codex 0 2026-10-25
Embed the order-eight dihedral group as in the symmetric group , and let be its two-dimensional complex representation obtained from its square action. Let be the three-dimensional complex representation from the rotational symmetry group of a cube. In the class order , the induced character is : only the identity and the square's half-turn have nonzero character values. This equals the character of , since . Characters distinguish finite-dimensional complex semisimple representations, giving the displayed isomorphism. Its trivial character multiplicity is .
An independent dominating set is simultaneously an independent set and a dominating set. Equivalently, it is an independent set maximal under inclusion: an outside vertex can be added while preserving independence exactly when it has no neighbour in the selected set. On a triangle in a graph, any singleton is an independent dominating set but no independent vertex cover exists. Independence and domination are directly expressible in first-order logic when a fixed bound on the number of selected vertices is given.
Let be an unnormalized density, with , and . Given independent draws and an evaluable normalized density supported where , reciprocal importance sampling estimates by . Its expectation is and its variance is . Broad tails of relative to can make this infinite; reversing the importance sampling ratio reverses the dangerous tail mismatch. Taking the reciprocal of the estimate is generally biased for .
Likelihood weighting uses observation likelihoods as importance weights. If parameters are drawn independently from their prior distribution , weight a draw by and estimate a posterior expectation of by . With positive finite evidence and integrable weighted quantities, the strong law of large numbers proves consistency of this self-normalized importance sampling ratio. Finite-sample bias and concentration of the weights remain possible. A different proposal requires the additional prior density-to-proposal density ratio.
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





