The first Jackson theorem for periodic approximation asserts that a universal constant satisfies
for every continuous -periodic function , where the infimum is over degree-at-most- trigonometric polynomials.
Apply it to the even function . If is a trigonometric polynomial approximating , its even part
has no larger error, because and the triangle inequality bounds each averaged error by . Every even trigonometric polynomial has the form
Here the Chebyshev polynomials have algebraic degree , so has degree at most . Surjectivity of cosine gives
Conversely, every algebraic polynomial of degree at most yields such an even trigonometric polynomial. Taking infima therefore proves the exact identity , not merely an inequality. Combine this with the periodic theorem and the preceding modulus of continuity estimate:
Symmetrization, the degree correspondence and the equality of norms justify every step in transferring the Jackson-type estimate.
We work in the usual real-valued setting of the Chebyshev alternation theorem. For and an algebraic polynomial of degree at most , the theorem says that is a best uniform approximation if and only if its error has ordered points with alternating maximal values:
If , the zero-error case is included directly.
Existence follows, for example, by taking a minimizing sequence: its supremum norms are bounded, all norms on the finite-dimensional polynomial space are equivalent, and a convergent coefficient subsequence attains the infimum. To prove uniqueness of best uniform polynomial approximation, let both attain the minimum error . Their average has error at most by the triangle inequality and therefore exactly by minimality.
If , both polynomials equal and are equal. Otherwise apply the Chebyshev alternation theorem to . At every alternating extremal point, is either or . But it is the average of and , each lying in . An average attains an endpoint of this interval only when both entries equal that endpoint. Hence at all points. The difference is a degree-at-most- polynomial with more than distinct zeros, so it is identically zero. The best approximating polynomial is unique.
The original PDF has indices ; the exponent is lost in the TeX transcription. This lacunary indexing is essential to the positive lacunary Chebyshev series argument below.
Let be the least nonnegative integer with , so for . Define
For the sum is empty and means the zero polynomial. Each included Chebyshev polynomial has degree at most . Also on the interval, so summability of the positive coefficients gives uniform convergence by the Weierstrass M-test, and
Choose and the points , . For every omitted index , the integer is odd. Consequently,
Every term of the tail has the same sign at a given point, and therefore
This shows both that the error norm is exactly and that it alternates at distinct points. The points are in decreasing order; reversing their order still gives alternation. The Chebyshev alternation theorem proves that this partial sum is the unique best uniform approximation. Hence
In particular, and . The equal signs of all tail terms at the same extrema are the reason positivity and the odd integer frequency ratios are useful.
An explicit construction gives Bernstein's lethargy theorem in the requested inequality form. Set
Strict decrease makes every coefficient positive. Telescoping and the limit assumption give
Thus
defines a continuous function by the Weierstrass M-test and the uniform limit theorem. Apply the positive lacunary Chebyshev series calculation. At ,
For , choose so that . Its error is
Therefore the function satisfies
This explicit Chebyshev construction for Bernstein lethargy also has . It shows that continuity imposes no universal speed of convergence of best polynomial approximation, even though convergence itself follows from the Weierstrass approximation theorem.
Set and , so that . The dimension of a bounded-total-degree polynomial space in variables over is . If were smaller than this dimension, evaluation at the points of would impose fewer homogeneous linear conditions than unknown coefficients. The rank-nullity theorem would give a nonzero multivariate polynomial of total degree at most , vanishing on .
For every , select one of the promised rich affine lines in a vector space through , and write it as with . The polynomial restriction to a line has degree at most , and at least distinct roots of a polynomial from . By the root bound for a polynomial, is identically zero, so . Since this works for every , vanishes at all points of .
The Schwartz-Zippel lemma says that a nonzero multivariate polynomial of total degree has at most zeros on this grid. Here , so that count is strictly less than , a contradiction. The distinction between a formal polynomial and its function on a finite field is crucial: our degree bound is what rules out a nonzero polynomial vanishing everywhere.
We have proved the stronger quantitative rich line covering bound over a finite field
Thus , as required. The implied constant may depend on the fixed dimension . The very large numerical lower bound on is more than this proof needs.
For a finite collection of distinct affine lines in a vector space in , , a joint is a point incident to lines whose direction vectors are linearly independent. The joints theorem asserts
In the customary three-dimensional formulation this is , with three noncoplanar incident lines at every joint. We prove the general form, which includes that formulation.
Let and . The conclusion is immediate when . Otherwise set . Suppose for contradiction that . Repeatedly delete any line incident to at most of the currently retained joints, deleting those joints at the same time. Each deleted line loses at most current joints, so even deleting all lines could lose at most joints. Therefore the process must stop with a nonempty set and a line collection such that each retained line contains more than retained joints. Every retained joint still has its original independent incident lines: if any line through it had been deleted, the joint would have been deleted too.
There is a nonzero multivariate polynomial of total degree at most vanishing on , because
Choose such a polynomial of smallest possible total degree . This is an application of the polynomial method in combinatorics. Every line of contains more than roots of a polynomial of its polynomial restriction to a line, so vanishes identically on every such line.
At a retained joint , differentiating along each of its independent line directions gives . Their linear independence therefore forces . Each partial derivative of vanishes on all of and has smaller total degree. Minimality of forces every partial derivative to be the zero polynomial. Over the real numbers, a polynomial with all partial derivatives zero is constant; a nonzero constant cannot vanish on the nonempty . This is the required contradiction.
It follows that . Since for ,
This proves the joints theorem by the pruning and minimal-degree polynomial argument.
The exponent is sharp. Take all axis-parallel lines passing through the grid . There are distinct lines and joints; the coordinate directions span at every grid point. Thus no smaller power of the number of lines can bound all joint configurations.
Linearity of the integral in each argument gives a bilinear form, and gives symmetry. Also . If a polynomial is nonzero somewhere on this interval, continuity makes strictly positive on a smaller interval, so the integral is positive. A polynomial vanishing on the whole interval is the zero polynomial. Thus the form is positive-definite and is an inner product.
Apply the Gram-Schmidt process to . Odd functions have zero integral, so is already orthogonal to , and the third orthogonal polynomial is . Their squared norms are
Therefore an orthonormal basis is
These are the first three normalized Legendre polynomials. Their distinct degrees also prove that they span the three-dimensional vector space.
For any distinct nodes, the polynomial has degree , is nonnegative, and vanishes at every node. The quadrature rule sum for is zero, but because the weight is positive and is positive except at finitely many points. Therefore no such rule is exact for all polynomials of degree at most , irrespective of the chosen weights.
For the sine weight, its first four moments are . A monic degree-two orthogonal polynomial is
since direct use of these moments gives . Its roots lie in and are
The weights follow by requiring exactness for and : and , and the symmetric nodes imply both weights are one. To prove cubic exactness, divide any cubic as , with of degree at most one. The integral of is zero by orthogonality, and its nodal values vanish; the remaining linear polynomial is integrated exactly. This is the two-node Gaussian quadrature with sine weight; the argument proves its Gaussian quadrature property without assuming a general quadrature theorem.
For an affine variety , one construction defines as the functions which locally have the form , where are elements of the coordinate ring and does not vanish on the neighbourhood in question. Restrictions are restrictions of functions, and locality gives the sheaf axioms. In particular
The second formula identifies its local rings.
In the classical convention, an algebraic variety over is an irreducible ringed space with a sheaf of -valued functions, admitting a finite open cover by spaces isomorphic to affine varieties, and satisfying the separated variety condition that its diagonal is closed in . Its topology is Noetherian. One can instead allow reducible reduced varieties; the arguments below still work with the denominator-clearing version of the localization argument. A morphism of varieties is a continuous map whose pullback takes local regular functions to regular functions, equivalently a morphism of locally ringed -spaces. The maps on local rings are local because a function nonzero at the image point stays nonzero at the source point.
An affine variety supplies its own finite affine cover, is Noetherian, and is separated: its diagonal in is cut out by the differences of corresponding coordinates. A regular map between affine varieties pulls coordinate functions back to regular functions. It is continuous because the inverse image of any polynomial zero set is the zero set of the pulled-back regular functions; on affine charts such zero sets are closed. Pulling back a locally represented fraction gives a regular fraction wherever its denominator is nonzero. Hence a regular map is a morphism of varieties in this definition.
For a morphism which is an isomorphism over each member of an open cover of , every fibre contains exactly one point. Thus is bijective. Its inverse is continuous and regular on every , since there it is the given inverse of the local isomorphism. These inverses agree on overlaps, being inverses of the same map. They glue to a global inverse morphism of varieties. Therefore being an isomorphism is local on the target.
Let , and let be affine with coordinate ring . Given a -algebra homomorphism , choose a presentation . The map
lands in because all the equations in become zero functions. Its coordinates are global regular functions, so it is a morphism on every affine chart of , and therefore globally. On a target neighbourhood where a fraction is defined its pullback is , proving that the induced map on global sections is exactly . This also proves independence of the chosen generators and uniqueness. This is the affine-target adjunction for varieties.
For , the natural map sends to that regular function. In the irreducible convention, if , is dense, so this map is injective: a global regular function vanishing there vanishes everywhere. Cover by finitely many affine charts . A section on restricts on to an element of . A common power clears all these finitely many denominators. The resulting regular sections on agree on the dense principal open in each overlap, hence agree there altogether and glue to a global section . Thus . If , both sides are the zero ring of sections on the empty open. Consequently
This is localization of global sections on a principal open. For reduced reducible varieties, equality on a principal open instead means that a sufficiently large power of annihilates the difference; finitely many charts and overlap refinements allow one common extra power. The same denominator-clearing proof then gives the stated localization isomorphism without a density assumption.
Now suppose in and every is affine. Each is a finitely generated -algebra. Select finitely many generators, writing them as . Let be the -subalgebra generated by all , all , and all . It is finitely generated, and
The inclusion from left to right is immediate, while the chosen generators give the reverse inclusion. This construction does not assume that was finitely generated in advance.
The reduced algebra is the coordinate ring of an affine variety (irreducible when is). The map produces by the preceding construction. The sets cover , since their functions generate the unit ideal already in . Their inverse images are , and on them the map is the isomorphism corresponding to . The target-local argument above now proves
This is affineness from a unit-ideal principal affine cover. The printed sets are ; the missing index in the TeX aid is not a different hypothesis.
Order the index set of the open cover . The Čech cochain groups are
and their differential is the alternating sum of restrictions:
Terms obtained by deleting two indices cancel in pairs, so . The Čech cohomology is , with zero incoming differential in degree zero. Its zeroth group is the group of global sections by sheaf gluing.
The acyclic cover theorem applies if every nonempty finite intersection is acyclic for . For a quasi-coherent sheaf on a variety it is sufficient that every such intersection is affine; on a separated variety, any affine open cover has this property. On , take the standard charts . Every intersection is a principal open in an affine chart, hence affine. The Čech complex has no terms above degree , proving
This is the cohomological dimension bound from an affine cover and requires only quasi-coherence, not finite generation.
For the remaining projective calculations assume . There is a necessary zero-dimensional exception to the negative-twist assertion: is a point, every twist is trivial there, and even for .
Put with its usual grading. The twisting sheaf on projective space is the sheaf associated with the shifted graded module ; on an intersection its sections are
On a generator is , with transition . These are regular units on overlaps and satisfy the cocycle relation, so they glue an invertible sheaf for every integer , including negative .
A global section is a compatible family of these homogeneous fractions, hence a single element of degree in . For , and are relatively prime in the unique factorization domain , so ; therefore the full intersection is . It follows that
For its dimension is . The proof uses all-chart compatibility; regularity on one chart alone would permit poles on its complement.
If some , the ideal contains , so the requested containment is immediate. Otherwise every . A monomial of degree must have for some : if not, its total degree would be at most . Thus every degree- monomial, and hence every homogeneous polynomial of that degree, belongs to . This is monomial containment in an ideal of coordinate powers.
For , a top-degree Čech cochain for is a degree-zero Laurent polynomial on the full intersection. Write it with a common denominator as
The containment just proved gives , with homogeneous of degree . Consequently
The th term is regular on the intersection omitting , and has degree zero. Give it the sign in that component of the preceding Čech cochain. Its coboundary is the original fraction. Every top cochain is thus a coboundary, and
This is top Čech cohomology from missing-denominator monomials.
To obtain the negative-twist bound by induction on dimension, let be a hyperplane, with inclusion . Its equation gives the hyperplane exact sequence for twisting sheaves
The associated long exact sequence in sheaf cohomology and sheaf cohomology under a closed inclusion give
For , restriction is the surjection . Exactness and the already proved give . The displayed surjections then give the same vanishing for every . This handles the point hyperplane without making a false negative-twist claim on .
For , the induction hypothesis in dimension gives whenever . Therefore consecutive top-degree groups are isomorphic for . Starting with and stepping down through reaches . Stepping upward proves all positive twists too. We conclude
This is top-twist vanishing by hyperplane induction.
Finally, on write and . On , let be the wedge of for , taken in increasing index order. For , differentiating and gives
In the wedge, all terms involving a second copy of disappear; the surviving powers are from and from the other differentials. Moving into its original position produces the stated sign. Rescale each local generator by . Then on every overlap, exactly the transition of the twist with . This canonical-form transition on projective space proves the canonical bundle of projective space:
For line bundles the Serre duality pairing becomes
In particular is dual to , which is zero for , precisely the independently obtained bound. The case recovers , and matches . Thus the calculated transition functions, global sections and top-degree vanishing agree with Serre duality.