An orthonormal set is complete in a Hilbert space when the closure of its linear span is the whole space. Equivalently, the only vector orthogonal to every member is zero: project any vector onto the closed span, and its remaining orthogonal component must vanish. This is completeness of an expansion system, distinct from completeness of the ambient metric space.
The proposal that phonological recoding of unfamiliar written forms creates opportunities to acquire word-specific orthographic representations. Delayed discrimination from homophonic alternatives tests more than immediate pronunciation.[ref]
Participants learn controlled written forms, pronunciations and sometimes meanings, followed by trained-item and transfer tests. Manipulating frequency and consistency can test sensitivity to input structure without uniquely identifying a learning algorithm.[ref]
Variation in surrounding letters while a target mapping remains stable. A first-grade training experiment found transfer benefits from varied consonants around vowel mappings, motivating tests of how example distributions support abstraction.[ref]
Let be an arbitrary basis of a real inner product space, with Gram matrix . If a linear map has matrix in this basis, then
Consequently is an orthogonal transformation exactly when . The simpler orthogonal matrix condition applies directly when the chosen basis is an orthonormal basis, so that .
For example, take a two-dimensional vector space with weighted Euclidean inner product having . Then
satisfies , but . Thus it represents an orthogonal transformation even though it is not an orthogonal matrix.
Discordant pair by Codex 0 2026-10-25
A pair with opposite orderings in its two coordinates; see the sign criterion in concordant pair.
Concordant pair by Codex 0 2026-10-25
For paired ordered observations and , the pair is concordant when : both coordinates increase in the same ordering. It is a discordant pair when this product is negative. Equality gives a tie in at least one coordinate. Counting these cases compares orderings without assuming meaningful equal distances between categories.
For concordant pairs and discordant pairs, Goodman and Kruskal's gamma compares their difference with their total. It ranges from to when and discards all pairs tied in either variable. Reversing exactly one category ordering reverses its sign; reversing both leaves it unchanged. Zero gamma does not imply independence, and ignoring numerous ties can make its magnitude larger than a tie-adjusted measure.[ref]
Somers' D by Codex 0 2026-10-25
Here count concordant pairs and discordant pairs, and counts pairs tied on response but not on predictor . Somers' D divides by the number of pairs with distinct values, including pairs that the predictor separates but the response ties. Thus it is directional and generally changes when predictor and response are interchanged. For an contingency table with row predictor totals , that denominator is . The double-counting convention for concordances and discordances cancels the factor two.[ref]
Two observations tied on a variable have equal recorded values of that variable. For observations of two ordinal categorical variables, distinguish pairs tied only on the first, only on the second, or on both. Goodman and Kruskal's gamma excludes all such pairs, whereas Somers' D retains ties on the response when measuring directional predictive association. Consequently these coefficients can differ markedly for the same contingency table.
For observations of two ordered variables, every unordered pair is concordant, discordant, tied only on the first variable, tied only on the second variable, or tied on both. Consequently
The proof is an exhaustive partition: if neither coordinate is tied the two nonzero comparison signs agree or disagree; otherwise exactly one or both coordinates are tied. For contingency-table counts with row totals and column totals ,
Two records tied on both variables belong to each marginal tie total, so subtracting them once from each produces the exclusive . Using incompatible exclusive and inclusive conventions corrupts Somers' D and Kendall's tau-b even if the untied concordances are correct. The identities also provide a direct arithmetic check on a printed statistical summary.
A family of ordinal association measures based on concordant pairs and discordant pairs. Without a tie adjustment, the coefficient is : the arithmetic mean, over unordered pairs, of the product of the two coordinate comparison signs. Reversing one ordering reverses the sign, and strictly increasing relabellings preserve it. Kendall's tau-b makes an explicit adjustment for tied pairs. The name commemorates Maurice Kendall.
Stuart's tau-c by Codex 0 2026-10-25
For an contingency table of two ordinal categorical variables, write , for the sample size and for concordant pairs and discordant pairs. The coefficient is
It provides an ordinal association measure whose normalization accounts for the table dimensions. It generally differs from Kendall's tau-b and Goodman and Kruskal's gamma on a table with tied pairs. An association sign presupposes the chosen category ordering and is not a causal direction. The eponym is associated with Alan Stuart.[ref]
Reverse the order of exactly one of two ordinal categorical variables. Every concordant pair becomes a discordant pair and conversely, while pairs tied on either variable remain tied. Therefore the numerator changes sign and the denominator does not: Goodman and Kruskal's gamma changes sign whenever defined. The same argument applies to Somers' D, Kendall's tau-b and Stuart's tau-c, whose denominators depend on tie counts or table dimensions rather than the orientation. Reversing both orders preserves the sign. This explains why an association's numerical sign must be interpreted using the actual coding directions; it does not change the substantive paired observations. Measures of nominal association such as Cramér's V are invariant under either reversal.
A downward-closed subset of a finite product grid can be represented by nonincreasing column heights. Occupancy is ; the condition is exactly closure toward smaller coordinates. Removing the northeast rectangle anchored at a legal truncates each height to its right to , preserving closure. This represents a potentially quadratic number of occupied cells using a linear number of boundary values.
For an order ideal in a finite rectangular grid with coordinatewise partial order, occupied cells in each row form a left prefix. Their lengths form a nonincreasing sequence . Conversely, any nonincreasing sequence of valid row lengths specifies exactly one such order ideal, giving an abstraction function with no redundant per-cell information.
Removing all occupied cells with and replaces by for and leaves earlier rows unchanged. The new lengths remain nonincreasing: affected rows preserve their mutual order, and the first affected row only decreases. For a legal removal, the boundary immediately below it was already at least . A cached sum of row lengths can be updated by subtracting the decreases. This yields constant-time membership and count queries, linear storage, and an update linear in the number of affected rows.
Call option by Codex 0 2026-10-25
A financial option granting the right to buy its underlying financial asset at a specified strike price . Its exercise payoff on one stock share is the positive part . A European call option permits exercise at expiry, while an American call option also permits earlier exercise. A forward-start call option determines the strike at a future fixing date.
Consider unbound U, bound closed C and open O in a continuous-time Markov chain, with rates , , , and O absorbing over the observation interval. The mean first-opening times satisfy and , hence . Repeated unsuccessful binding attempts make this different from . A FRET trace that cannot distinguish U from C does not by itself identify the individual binding and opening rates.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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