Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Represent each original value choice by a Boolean variable and impose an exactly-one constraint for each original variable. For every forbidden tuple of a constraint with scope , add the Boolean clause . A complete original assignment satisfies every constraint exactly when its one-hot indicators satisfy all these Boolean clauses: each forbidden-tuple Boolean clause excludes precisely that joint choice. A satisfying assignment decodes by reading the unique true indicator for each original variable.
For constraint domain sizes , pairwise uniqueness requires Boolean clauses. If a constraint has forbidden tuples and arity , its contribution is Boolean clauses and literal occurrences. Thus bounded arity gives a polynomial-size encoding in explicitly listed domains, whereas enumerating a succinct high-arity relation can be exponential in its description length. Unit propagation on this encoding can be weaker than arc consistency on the original binary constraints.
Choose distinct squares of an chessboard so that no chosen pair has absolute coordinate differences or . One constraint satisfaction problem representation has square-valued variables, requiring distinctness and pairwise nonattack. Another has one Boolean variable per square, a cardinality constraint fixing their sum to , and one mutual-exclusion constraint for every edge of the knight attack graph. The first has fewer variables when is small but represents each unlabelled placement up to times; the second uses only binary constraint domains and sparse local attack restrictions.
A cardinality constraint restricts how many members of a specified collection are selected or satisfy a property. For Boolean variables, exactly selected entries gives the displayed sum; upper and lower bounds give at-most and at-least variants. Constraint propagation can maintain the number already selected and the number still available. A requirement involving many variables is a global constraint, even when it has a compact arithmetic description.
With positive opposing load magnitude and positive viscous drag coefficient , steady contraction requires . A decreasing motor force curve and an increasing drag-magnitude line have a unique intersection for each load below the limiting stall force. Using as the signed drag would instead make drag assist forward motion, reversing its physical role.
Total kinetic energy is unchanged between the incoming and outgoing states of an elastic collision. This does not require each body's kinetic energy to be unchanged, nor that kinetic energy remain constant during temporary elastic deformation. In general mechanical energy includes potential energy, so conservation of mechanical energy alone does not imply constant kinetic energy.
For a real phi cubed theory with labelled external points, the connected three-point function at third order in the coupling constant has seven labelled one-loop Feynman diagrams: one triangle, three external-branch bubble insertions, and three tadpole-ended chains. The symmetry factors are respectively , with graph weight . To prove completeness, use and : gives and . The unique internal cycle is then a triangle, a pair of parallel edges, or a self-loop; the degree-three condition fixes the external attachments. Only the triangle remains one-particle irreducible after amputation of external propagators. A tadpole-free prescription removes the three chains but must be stated separately.
For a symmetric positive-definite matrix , the Conjugate gradient method minimizes the error in the induced weighted norm over its affine Krylov subspace. Writing the error as givesFor , choose the scaled Chebyshev polynomial . On the spectral interval its numerator has absolute value at most one. With , the denominator equals . This proves the displayed bound. If the two endpoints coincide, is a positive scalar multiple of the identity and one iteration solves the system exactly.
Two Riemannian metrics lie in the same conformal class when one is a positive smooth scalar multiple of the other. They measure the same angles, while lengths may change from point to point. On an oriented Riemannian surface, rotation of each tangent plane through determines a complex structure which depends only on this conformal class.
Map a conformal quadrilateral to a rectangle of width and height , with the chosen opposite boundary arcs mapped to its vertical sides. Their extremal length is ; the other pair has extremal length . The constant conformal metric is extremal. For an arbitrary density, average horizontal joining lengths over height and apply the Cauchy-Schwarz inequality to obtain , proving the upper bound. Vertical joining segments prove the dual formula. Conformal invariance of extremal length transports both equalities back to the quadrilateral.
A cone class with spectral sensitivity relatively shifted toward longer wavelengths compared with M and S classes. Its broad response is not a detector for a unique red sensation.
A cone class with an intermediate relative spectral sensitivity. Its broad overlap with L-cone sensitivity makes comparisons informative; a response does not label a stimulus green.
If total-wave branches become disjoint in the relevant environment configuration variables and the actual environment lies within one branch, the subsystem's conditional wave function is proportional to that branch's subsystem factor. Persistent separation makes its autonomous use an effective description. No term of the universal wave function has literally been deleted. Possible recombination prevents treating every temporary packet separation as irreversible collapse.[ref]
Suppose a fair input bit is independent of a publicly known channel-position label . At position , let the channel be a binary symmetric channel with error probability . Forgetting gives a binary symmetric channel with error . ThereforeThe chain rule for mutual information and show that their difference is the nonnegative conditional mutual information . Equivalently, the inequality follows from concavity of binary entropy. For with equal position weights, the known-position value is bits and the pooled value is bits. These quantities answer different statistical questions.
Let be an integrable random variable, let be a finite -measurable random variable, and suppose is an integrable random variable. Then a known factor can be taken outside the conditional expectation:For a bounded , first verify the defining integral identity when is the indicator function of a measurable set in , extend by linearity to simple functions, and then use bounded approximation and the dominated convergence theorem. For nonnegative , truncating and using the conditional monotone convergence theorem proves the identity with extended nonnegative conditional expectations. In particular,For general under the stated integrability assumptions, the conditional Jensen inequality bounds by that integrable random variable. Apply the bounded-factor result to truncations of , then use the dominated convergence theorem on the products and the L1 contraction of conditional expectation. This proves the identity without assuming itself is an integrable random variable.
The product-integrability condition is essential to the ordinary finite conditional expectation statement. An unbounded factor cannot be moved through an expected value simply because its partner is an integrable random variable.[ref]
For nonnegative random variables , the corresponding nonnegative conditional expectations increase almost surely to , allowing the extended value . When is an integrable random variable, all conditional expectations can be taken in their ordinary finite sense.
To prove this integrable case, choose versions simultaneously ordered outside a single null set, and put . This limit is -measurable. For every , the ordinary monotone convergence theorem twice givesIn particular , and this is exactly the defining property of conditional expectation. For a general nonnegative , define its extended conditional expectation by increasing bounded truncations; the same nonnegative integral argument proves the statement.
Let belong to L2 space, and suppose and almost surely, for two possibly nonnested sigma-algebras. Then almost surely. No independence or inclusion between the sigma-algebras is required.
The identities supply -measurable and -measurable versions of and . The measurable-factor rule for conditional expectation and Cauchy-Schwarz inequality giveExpanding the square shows , and hence the required almost sure equality. Equivalently, each conditional expectation is an orthogonal projection in L2 space, and the two projection identities force equality in the equality case for conditional second moments.
Equality after applying a function need not identify its original input. For instance, on four equally likely outcomes let take and set . Their squares are the same nonconstant random variable, even though and differ everywhere. Injectivity of the function would rule out this loss of information.
The probability mass function of a discrete conditional distribution. The elementary ratio requires ; a value of zero gives no event-conditioning definition through this 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





