A map between vector spaces over the same field is a linear map precisely when it preserves vector addition and scalar multiplication:
Equivalently, for all and .
A vector space over a field is a set with vector addition and scalar multiplication satisfying the following vector space axioms. Under vector addition, is an abelian group: addition is associative and commutative, there is a zero vector , and each has an additive inverse . For all and ,
The operations are defined for every indicated pair and take their values in .
Write , where
The binomial theorem for commuting matrices applies because . All terms of degree at least three vanish, so for every positive integer ,
The same expression directly gives when , so no small exponent is excluded.
If is a strictly upper triangular matrix, then unless . We prove by mathematical induction that
The assertion for is the definition. In the matrix multiplication formula
a nonzero summand would require and , hence . This proves the induction step. Since for all entries, . In particular, every strictly upper triangular matrix is a nilpotent matrix.
Perform the elementary row operations and , then , , and finally , :
Consequently the reduced row echelon form is . Applying the same operations to the augmented column gives
Thus every admits exactly one solution. This follows because the elementary row operations preserve the solution set of the augmented linear system, and the reduced coefficient matrix is the identity matrix.
For an matrix, the corresponding elementary matrices are , because the operation is implemented by left matrix multiplication. Apply the desired elementary row operation to the identity matrix . Writing for the matrix unit with its only nonzero entry, , in position gives:
Indeed, these matrix products interchange rows , scale row , and add times row to row , respectively. The displayed inverses undo precisely those operations. Algebraically, when , so ; the other two inverse identities follow immediately from their row actions. Thus every elementary matrix is an invertible matrix.
The three elementary row operations on an real matrix are:
  • Interchange two distinct rows: .
  • Multiply one row by a nonzero real number: , with .
  • Add a scalar multiple of one row to a different row: , with .
Each operation changes whole rows, so it acts on every column by the same rule. Each can be undone by an elementary row operation.
Eliminate the two pure second derivatives by taking to be the roots of . They are distinct real numbers exactly when
Thus the required function is . The mixed coefficient becomes , so the transformed equation is . Integrating once in each coordinate gives
with arbitrary sufficiently smooth functions . This is the characteristic form of a strictly hyperbolic partial differential equation.
The multivariable chain rule gives and . Substitution into the differential equation yields
The coordinate transformation is invertible exactly when .
At , the integration interval first moves through positive arguments, then crosses zero, and finally contains all of . The result is
The final plateau is the integral of the entire initial velocity profile divided by .
Figure 1.
Two traces of the D'Alembert solution for the compactly supported initial velocity
. The spatial profile has two peaks at half the initial support radius. The time trace at that location eventually reaches a constant plateau. Axes use dimensionless variables; plotted curves use . Details.
At , the interval of integration has half-width . Evaluating the cumulative integral in part a gives the even function
It has value at zero and maxima at , then falls to zero at the two wavefronts.
Take the boundary pieces in the order
On the circular arc , use for . Then and , so its line integral is zero.
On , use , , with decreasing from two to zero. Since and , , giving four. On , use , , with increasing from zero to two. Again , giving minus four. The total is , agreeing with Stokes theorem.
The curl is . For the upward orientation of the paraboloid, the vector surface area element is . Therefore Stokes theorem gives
The upward normal gives the prescribed anticlockwise boundary orientation viewed from above.
For , the positive- branch is above the negative one, so the orientation in part i is outward. Consequently
The integral follows from .
Parametrize the surface of revolution by
An oriented vector surface area element is
Use the vector field , whose divergence is one. If this parametrization has the outward orientation on an enclosing surface, the divergence theorem gives
The second equality is integration by parts, using the endpoint values. For example this outward convention applies when the positive- branch lies above the negative- branch, for .
The stated regularity and endpoint conditions alone do not guarantee an embedded enclosing surface: branches can cross or coincide. Without an appropriate orientation assumption the flux formula is an algebraic signed volume. If “inside” is defined as the region between the two graph branches for each radius, its nonnegative geometric volume is instead
This explicitly handles a reversal or change in the order of the two branches.
Take in Green's second identity. Since , , on the unit sphere, and there,
The final term vanishes by the divergence theorem, because it equals . Therefore
We assume sufficient boundary regularity for the stated boundary values and integrals, or use the corresponding trace/limit formulation. This is the equality of volume and surface averages for a harmonic function, since the unit ball and sphere have volume and area .
Apply the divergence theorem to . The product rule gives
because the two gradient inner products cancel. Also . Thus
This is Green's second identity, under the usual regularity assumptions permitting these derivatives and boundary integrals.
For a bounded region with piecewise smooth boundary and a continuously differentiable vector field on a neighborhood of its closure, the divergence theorem says
where is the outward unit normal vector. The left side integrates divergence over the volume; the right side is the outward flux.
The truncated Fourier cosine series gives the better approximation on the closed interval, in the senses of uniform convergence and the asymptotic L2 norm error. To make the comparison precise, let and retain the frequencies , with the constant term also included in .
The cosine Fourier coefficients are . In fact, absolute convergence gives the uniform tail bound
For the Fourier sine series, every Fourier partial sum satisfies . Thus
so there is no uniform convergence to on the closed interval. Its odd extension has jump discontinuities, producing the Gibbs phenomenon near the endpoints; its Fourier coefficients decrease only like .
The advantage persists in the L2 norm, which ignores individual endpoint values. By Parseval's identity and Fourier orthogonality,
The nonzero odd cosine coefficients and both parity classes of sine coefficients also give matching lower bounds of these orders by comparison with the corresponding p-series. Hence their L2 norm errors decrease respectively like and . This is a comparison of approximation quality in specified norms, not a claim that one finite sum has smaller error at every individual interior point.
For the Fourier cosine series, integration by parts gives
and, for ,
Only odd Fourier harmonics remain, so
For the Fourier sine series, another integration by parts gives
Consequently
At and , the Fourier sine series instead has value zero.
To describe the requested graphs precisely, take congruent to modulo . The Fourier cosine series converges to the continuous triangular periodic extension
Its minima occur at the even multiples of , with value , and its maxima at the odd multiples, with value . The Fourier sine series converges to
The jump discontinuities at even multiples of go from to ; those at odd multiples go from to . Each jump is assigned its midpoint, zero, by the Fourier series.
Figure 1.
Limits of the Fourier cosine series and Fourier sine series of on
. Details.

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