For antiplane shear, the only nonzero infinitesimal strains are and . Their trace is zero. The isotropic constitutive law consequently gives
with every other component zero. The first two equations of motion vanish because the fields are independent of . The third is , hence
The PDF omits the final equals-zero; this is the equation supplied by momentum balance.
For a steadily moving field put and . In the subsonic case , the equation becomes . With it reduces to . Thus is a harmonic function and, on a simply connected region, has a harmonic conjugate; there is a holomorphic function such that
This is steadily moving antiplane shear. The representation is local on more general domains unless the conjugate's periods vanish. The subsonic condition is essential: at or above the shear-wave speed the coordinate rescaling is degenerate or the equation is hyperbolic rather than this elliptic harmonic problem.
A material fibre segment of reference length and unit direction has reference vector . The uniform deformation gradient maps it to , whose current length is
Therefore its length is preserved if and only if
This is the inextensible fibre constraint. The quadratic form uses the right Cauchy-Green deformation tensor; a subsequent rigid rotation does not change it, consistently with the polar factorization .
For a real matrix with positive determinant, the polar decomposition of an invertible real matrix gives unique factorizations
where and are the right stretch tensor and left stretch tensor, respectively. Positivity here means positive definiteness, not merely nonnegative entries.
To prove existence, is symmetric and for every nonzero , because is invertible. The spectral theorem for real symmetric matrices supplies an orthogonal matrix and positive eigenvalues such that . Define using the principal square root of a positive semidefinite matrix construction:
Then , so is orthogonal. Also ; an orthogonal matrix has determinant plus or minus one, hence . Set . It is symmetric positive definite, , and .
For uniqueness, any second factorization with the same properties gives . Since commutes with its square, it preserves every eigenspace of . On a -eigenspace its own positive eigenvalues must square to , so it equals times the identity there. Thus , then , and finally is fixed too. This proves both uniqueness and the polar decomposition in continuum mechanics, with the same proper rotation in its left and right forms.
Write , choose , and let count the points of in the length- window ending at , for . Each element occurs in precisely such windows, so . The Cauchy-Schwarz inequality consequently gives
On the other hand, a pair of difference belongs to exactly windows; larger differences contribute none. The Sidon set condition permits at most one pair for each positive difference . Therefore
Combining these two estimates proves the sliding-window upper bound for Sidon sets:
If , the final inequality for this quadratic polynomial implies ; otherwise . With the chosen , and . Thus
Together with part (i)'s construction, this proves that the maximum cardinality is . The lower and upper error terms need not have the same size to establish that asymptotic conclusion.
We use the Bose-Chowla Sidon construction, deriving its difference property explicitly. Let be an odd prime and choose a generator of the multiplicative group of a finite field of the quadratic finite field extension . Such a generator cannot belong to , so are linearly independent over the prime field. For each , the nonzero field element has a unique exponent modulo , with . The exponents are distinct.
Suppose in the cyclic group. Multiplying the corresponding field elements gives
Subtract the common term. Linear independence of gives and . Thus the two unordered pairs are the roots of the same monic quadratic polynomial, so . Either , giving the same ordered difference, or , giving two zero differences. This is exactly the Sidon set property.
Choose the integer representatives in . Equality of integer differences implies equality modulo , so their Sidon property persists in the integers. Now apply the given prime-gap hypothesis at to get for large . The representatives fit inside , because , and their cardinality is
Only the supplied short-interval prime existence and the elementary structure of a finite field are used.
Use normalized Fourier-Walsh transform coefficients . The Hamming weight counts the nonzero coordinates. Norms on the input cube use uniform probability, and a frequency integral here is counting over . A common alternative normalization multiplies both sides of the requested comparison by the same factor and does not change it.
Beckner's inequality states that for and , the noise operator on the Boolean hypercube, with coefficients , satisfies . In particular choose , , .
Let and . Then . On frequencies of weight at most two, , so Beckner's inequality and Parseval's identity give the low-degree Fourier mass of a sparse Boolean set estimate
The indicator function is real and the cube characters are real, so the displayed squares equal the squared absolute values. Total Fourier weight is . If , then and , since . Therefore
This establishes the strict comparison for every power , not merely for an unspecified very large threshold. The original PDF supplies the density condition and Beckner request, both missing from the converted TeX.
A Boolean function takes each vector of bits to either zero or one. Use independent uniform input bits; the influence of a variable is the probability that flipping that bit changes the value. A quite fair Boolean function has . All logarithms in the estimates below are natural, except where a base is explicitly written.
Here is a balanced tribes construction with unused coordinates valid for every . For each put , and choose the largest with . Partition of the bits into blocks of size . Let be one when at least one block is all ones, and ignore the other bits. This is a tribes function. With , its zero probability is .
For the function is a single bit and has mean . For , and . The elementary inequalities give
Thus both output probabilities are between one quarter and three quarters.
A used bit is pivotal exactly when the other bits of its block are one and every other block fails. Hence its influence is ; unused bits have zero influence. Maximality of gives . Also for : this is immediate for , while for one has . Therefore
This proves the requested existence with room in the constant. The dimension-one boundary case cannot satisfy the printed logarithmic bound: a quite fair function of one bit is nonconstant and has influence one, whereas . Thus the statement requires the usual nontrivial range (or its intended large- interpretation).
The entries in (b) satisfy
Thus has strict diagonal dominance with margin at least . To prove the inverse infinity-norm bound from diagonal dominance directly, choose with . The reverse triangle inequality gives
This also proves that the kernel is zero and hence that is invertible. Substituting and taking the operator norm gives
Combined with (a), it yields for linear splines, independently of the knot spacings. The diagonal-dominance argument already proves the required estimate.
For distinct ordered knots, put . The linear B-spline is the triangular hat supported on , equal to on its rising segment and on its falling segment. Its integral-normalized partner is . Thus
For example, the left overlap is . Nonadjacent hats have disjoint interiors of their supports, so their inner product is zero. The linear-spline mixed Gram matrix therefore has row
Retain only column indices in : the first or last row has no neighbor outside this range. Admissible repeated endpoint knots are obtained by a limit with zero spacings, provided ; a degenerate hat with zero support width is not a basis element.
The orthogonal projection condition is for all . Since , it is equivalently
The mixed-normalization spline Gram matrix is invertible: , where and is the positive-definite ordinary Gram matrix of the basis. Nonnegativity and the unit-integral normalization of a B-spline give . The subpartition of unity for B-splines gives, on all of ,
Consequently
so
This is the maximum-norm bound for spline projection. Using a subpartition matters when the basic knot interval is a proper subinterval of . As in the paper's assertion that the image lies in , the spline space here must consist of continuous functions; order-one step splines or full-multiplicity interior knots do not have that property.
Assume the spline knot sequence is ordered and its relevant support spans satisfy . For distinct knots, the divided difference is a finite linear combination of evaluations, so it commutes with integration. With ,
Taking the order- divided difference in gives
Indeed, the order- divided difference of a degree- polynomial is its leading coefficient, here . This proves the unit-integral normalization of a B-spline. Admissible repeated knots follow by coalescing knots, with the usual one-sided endpoint conventions.
Order the interpolation nodes as , as required by their alternating nodal data. Write and for the Lagrange cardinal polynomials. Differentiating Lagrange interpolation gives
The upper bound is the triangle inequality; equality follows by choosing each independent nodal value to be the sign of its weight. Thus this is the nodal derivative norm from Lagrange cardinal polynomials.
To identify the maximizing signs, put , a monic polynomial of degree . Since ,
For , let be the ordered roots of , . The roots of decrease componentwise as increases: deleting a later node replaces one retained node by an earlier one. The monotonicity of polynomial critical points in their roots, iterated times, therefore gives . Moreover, and weakly interlace, so the Markov interlacing lemma gives . Together,
These root bands have disjoint interiors. At a fixed , all but at most one band lie wholly on one side of . In the possible remaining band, moves monotonically as increases. Since the leading coefficients of all are positive, the sequence has at most one sign change after zero entries are ignored. The same holds for . If , every , so the conclusion also holds.
The maximizing nodal signs can consequently be chosen as throughout, or as before one index and from that index onward. Zero weights can be assigned either sign to complete such a pattern. These are precisely the nodal values of or , proving
The argument works for all real , hence in particular for . For every derivative vanishes and the result is immediate.
The Markov interlacing lemma says that differentiation preserves interlacing roots of polynomials. More explicitly, if two degree- real polynomials have ordered real roots satisfying , their th derivatives have ordered roots satisfying
The analogous alternating order is preserved for polynomials of consecutive degrees. Common roots are allowed through weak inequalities; strictly interlacing simple roots give strict inequalities. When a derivative is constant, its root list is empty.
Choose a best uniform approximation . It exists because this vector subspace is a finite-dimensional vector space and a minimizing sequence is bounded: . Finite-dimensional equivalence of norms then supplies a convergent subsequence of coefficients. If , the Chebyshev alternation theorem gives alternating error extrema. The intermediate value theorem supplies a zero of in each of the intervening open intervals. These interpolation nodes are distinct, and uniqueness of polynomial interpolation gives
The convergence follows from the Weierstrass approximation theorem. If , choose any distinct nodes: the polynomial interpolant is still . This constructs interpolation nodes from best uniform approximation; the nodes depend on , and no universal node system for all continuous functions is asserted.
The Chebyshev alternation theorem states that is a best uniform approximation to real precisely when there are increasingly ordered points with
For sufficiency, an improving polynomial direction would have to share these alternating signs, by the Kolmogorov criterion for uniform approximation. The intermediate value theorem would give at least distinct roots of a polynomial between consecutive points. A nonzero polynomial of degree at most cannot do that. If , no improvement is possible anyway.
For necessity, suppose and the active set has no alternating sequence of length . Its positive-error and negative-error subsets are disjoint compact sets, hence separated by a positive distance. Reading them from left to right splits into finitely many consecutive sign blocks. If there are blocks, choosing one point per block gives an alternating sequence, so . Choose in the gap between each consecutive pair of blocks. The polynomial has degree at most ; choose the sign of to match the error on the first block. Its sign then matches the error on every block, and it is nonzero throughout . Thus on , contradicting the Kolmogorov criterion for uniform approximation. There must therefore be alternating extrema.
Let , , and . The Kolmogorov criterion for uniform approximation says
If , is already best and the criterion holds. Suppose . If were strictly better, then on , which forces there. Conversely, if a direction has everywhere on , compactness gives a positive lower bound on this product. On a sufficiently small neighborhood of , and therefore have matching signs with bounded away from zero and bounded away from zero. On its compact complement, for some . Choose so small that and that subtracting does not cross zero on that neighborhood. Then , so is not a best uniform approximation. This proves both directions.

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