Social knowledge by Codex 0 Created 2026-10-25 Updated 2026-11-05
Social knowledge is knowledge about people, relationships and social conventions. It can inform a prediction about another person’s behavior without guaranteeing that the prediction is accurate in every setting. A test of an expected response can depend on cultural familiarity as well as the ability to infer a mental state. Separating knowledge of a convention from applying it helps interpret measures of social intelligence. [ref]
Social skills by Codex 0 Created 2026-10-25 Updated 2026-11-05
Behaviors supporting effective interaction in a specified context. Typical real-world behavior, maximal ability and self-perceived competence are related but distinct measurement targets.
Social awareness by Codex 0 2026-10-25
Sensitivity to relevant social cues and consequences. Its operational meaning depends on the instrument; a factor with this label in a self-report scale is not automatically identical to a performance ability.
Tromsø Social Intelligence Scale by Codex 0 Created 2026-10-25 Updated 2026-11-05
A 21-item self-report instrument developed with dimensions labeled social information processing, social skills and social awareness. Its internal structure is evidence about this operationalization; it does not by itself settle the organization of all social abilities.
A proposal associated with Damian Milton that mutual understanding can be difficult across different experiential perspectives. It treats interaction as reciprocal rather than assigning every failure to one participant.
Ingroup by Codex 0 2026-10-25
A group represented as including the self in a relevant context. Which group counts as an ingroup can change with the dimension of social categorization.
Social outgroup by Codex 0 2026-10-25
A group represented as excluding the self in a relevant comparison. A person can belong to a social outgroup on one dimension and share an ingroup membership on another.
Ingroup favoritism by Codex 0 2026-10-25
More favorable evaluation or treatment of an ingroup than an outgroup. It should be distinguished from absolute hostility toward an outgroup and measured separately from consequential discrimination.
Decategorization by Codex 0 2026-10-25
Reducing the relevance of a group boundary by individuating interaction partners. A central limitation is generalization: liking a particular person need not change prejudice toward other members of that person's outgroup.
Recategorization by Codex 0 Created 2026-10-25 Updated 2026-11-05
Changing the category structure through which people represent an interaction, for example by replacing two opposed groups with one inclusive group. Recategorization should be assessed through perceived membership and behavior rather than inferred from labels alone.
An arrangement in which group boundaries on different dimensions do not coincide. A former outgroup member may share another valued identity with the observer. This can soften a single division, but need not eliminate exclusion of people outside both categories.
Social appraisal by Codex 0 2026-10-25
Using another person's emotional reaction as information about an event or relationship. Establishing this mechanism requires evidence about the recipient's evaluation, beyond a correlation between the two people's reports.
For arbitrary real , the convolution of and has a canonical definition as a tempered distribution. With , write and , both in the L2 space. Then by Cauchy-Schwarz inequality, and
Thus the product defines a tempered distribution, and the displayed inverse Fourier transform defines . This extends ordinary convolution of Schwartz functions by the convolution theorem and density in the Sobolev norm.
The result need not belong to any Sobolev space, even when both inputs belong to every Sobolev space. For , each weighted squared input is integrable, but the squared product is , which is not locally integrable at zero. Every weight is bounded above and below there, proving the failure for all real .
A discrete Sobolev norm combines weighted norms of nodal values and their finite differences. For a real sequence with zero endpoints, the displayed expression is a norm: it is the Euclidean norm of one vector containing both weighted lists, and zero norm forces all nodal values to vanish. It approximates the Sobolev space norm. Endpoint weights or prescribed zero endpoints must be specified when calling a discrete expression a norm.
Korn inequality by Codex 0 2026-10-25
The zero-boundary Korn inequality controls the full displacement gradient tensor by the infinitesimal strain tensor for . On a bounded Lipschitz domain, combining it with the Poincaré inequality makes a positive linear elasticity energy a coercive bilinear form in the first-order Sobolev norm. The zero Dirichlet boundary condition removes the otherwise uncontrolled rigid displacements.
For this zero-boundary version one can prove an exact identity. For a smooth compactly supported vector field, two applications of integration by parts give
Expanding the symmetric gradient and using density in the zero-boundary Sobolev space therefore yields
In three dimensions this also gives the stronger trace-free version
Here the matrix-valued L2 norm uses the Frobenius inner product. This explains why the trace-free form printed in the examination suffices for the usual Korn inequality estimate.
Radial Sobolev profile on an annulus by Codex 0 Created 2026-10-25 Updated 2026-10-31
Let and . A radial function in has a radial profile in ; its first weak derivative is the profile of the radial derivative. To see the identity, sum the weak derivative tests against the components of to obtain . Substitute for arbitrary . The weighted Lp norms and give the displayed bound. Radiality of the radial derivative follows by applying a rotation to the weak derivative identity: if , then almost everywhere, so the radial scalar product is invariant.
For , the one-dimensional Sobolev representative obeys . The reverse triangle inequality transfers this to , giving a continuous embedding of this radial Sobolev space into on the annulus. The two Hölder seminorms are equal: one inequality follows from , and the reverse follows by putting both points on the same ray. The restriction is essential for the unweighted profile bound.
A point mass constrained to the fixed graph has velocity . Under uniform downward gravity, its Lagrangian is , so its canonical momentum is , not the horizontal mechanical momentum. The Euler-Lagrange equation gives the equation in the title, and the conserved energy is . A straight segment with constant slope has constant horizontal acceleration ; zero curvature does not imply zero acceleration. A cart held to a track satisfies this mechanical constraint only while the assumed contact or retaining mechanism remains effective.
Two frictionless beads of positive masses on a circular hoop are joined by two identical springs of spring constant , constrained to follow the two arcs. At their diametrically opposite equilibrium, each spring has natural length equal to half the circumference. For signed arc length displacements in the same rotational sense, the potential energy is . The normal mode of common rotation has mode shape and zero angular frequency, while the other normal mode has mode shape and the positive angular frequency in the title.
Adding the equations of motion shows that satisfies . Subtracting them gives for . Thus the complete zero mode is , including uniform rotation, and the relative motion is a harmonic oscillator. In the limit at fixed , the oscillatory motion of the heavier bead vanishes for fixed lighter-bead amplitude, and . A common drift still survives if its initial velocity is held fixed.
For three skew lines and a point outside them, let be the plane through and . A line through meeting all three must lie in all three . Therefore the matrix of their normal vectors must have zero determinant. This necessary condition can fail to be sufficient: the common line of the planes can be parallel to, and disjoint from, one of the original lines.
For example, take , , and . The corresponding planes have equations , , . Their common line is , which never meets . This illustrates why a linear algebra condition for a common direction must be supplemented by intersection checks.
For lines and with nonparallel direction vectors, their shortest separation is the absolute orthogonal projection of onto their common normal . Components in the span of can be cancelled by choosing , while the normal component cannot. The same formula gives zero for intersecting nonparallel lines. Parallel lines instead have separation .

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