A real number is an eigenvalue of if there is a nonzero vector with ; such a is an eigenvector for . The nonzero condition is essential.
For distinct eigenvalues , choose corresponding nonzero eigenvectors . Prove their linear independence by induction on . The claim for one vector is immediate. Given a relation , apply to get
By the induction hypothesis, every coefficient here is zero. Distinctness gives for , and the original relation then gives since . Thus the eigenvectors are linearly independent.
With distinct real eigenvalues, the real eigenvectors form a basis of . Put them into the columns of . Then is invertible and
This proves diagonalizability directly.
Solve for a general right-hand side . Subtracting the fourth equation from the second gives . The first and fourth then give
Substitution into the third equation reduces the remaining condition to
If , every right-hand side therefore has a unique solution, and collecting its four coefficients yields the matrix inverse
For , the nonzero vector lies in the kernel of a linear map represented by , so is singular. Hence is invertible exactly when . The same calculation gives ; the formula above can also be checked by multiplying its numerator by to obtain .
An elementary row operation is one of three operations: interchange two rows, multiply one row by a nonzero scalar, or add a scalar multiple of one row to a different row. Each operation is reversed by another operation of the same kind.
Performing such an operation on an matrix is equivalent to left multiplication by the elementary matrix obtained by applying that operation to the identity matrix. Each elementary matrix is invertible, with inverse corresponding to the reverse operation. Thus a sequence of operations gives
For square matrices, if were invertible, then would have inverse . Hence if is singular, must be singular as well. In fact the two are invertible together, because gives the converse.
For a linear map , its kernel of a linear map and image of a linear map are
Its nullity of a linear map is , and its rank of a linear map is .
Choose a basis of and extend it to a basis of . The vectors span , because applying to an arbitrary linear combination of the full basis eliminates the terms. They are also linearly independent: if , then , so for some coefficients. Independence of the extended basis forces all to vanish.
Consequently , and . This proves the rank-nullity theorem:
Choose a basis of , extend it to a basis of , and extend again to a basis of by adding . Define
Every member of the full basis lies in or , so the sum of vector subspaces is . If , express it in both displayed bases. Uniqueness of the coordinates in the full basis forces its and coefficients to vanish. Thus . The reverse inclusion is built into the construction, proving . This is a subspace supplement with a prescribed intersection.
For the matrix example, let
The skew-symmetric matrices are exactly , and the traceless matrices form . A suitable answer is
The matrix trace of is , so . Every real matrix has the decomposition
whose first term lies in and second in . Therefore , as required.
For a finite set of vectors in a real vector space, its span is the set of all linear combinations:
The span of the empty set is . The set is linearly independent if implies for every . It is a spanning set for if . A basis is both a linearly independent set and a spanning set.
For basis extension, start with the given linearly independent set. If it does not span , choose and adjoin it. The enlarged set remains linearly independent: a relation with would express as a linear combination of , a contradiction; if , independence of forces all other coefficients to be zero.
Repeat whenever the current span is proper. Each step increases the set's size by one, while the allowed bound says its size cannot exceed . Thus the process terminates with a linearly independent set spanning , hence a basis containing the original set. This also covers an initially empty set and the zero-dimensional vector space.
Write , and introduce perturbations to water depth, velocity, concentration and bed height. Take the leading quasi-steady approximation for the fast water and suspension response, retaining the small friction parameter . For , the linearized equations are
Here surface height is , and linearization of gives . Eliminating gives the dispersion relation
In particular, putting and expanding at large ,
Thus the temporal growth rate tends to a finite constant, while the phase velocity is
For supercritical flow , the waves propagate upstream. They grow if ; at leading order in small , this holds for fixed positive away from critical flow. They are antidunes, upstream-migrating bedforms coupled to the free surface. Indeed and , so surface height is in phase with the bed perturbation in this regime.
For clarity, neglecting completely gives the exact leading-order expressions
These also identify the missing qualification in the source: the unstable upstream branch requires . For this leading model gives decay and downstream propagation. The near-critical case needs a different balance; it is not covered by the expansion. Small nonzero perturbs the slow bedform branch and adds fast water modes, so the stated result concerns the leading slow morphodynamic branch. This is the high-wavenumber antidune dispersion calculation.
For the travelling wave , continuity gives . The upstream state fixes the constant as , hence
Substituting in momentum yields
so
A constant downstream state requires . The positive square-root choice would give , so the upstream-moving wave uses . Thus
The downstream flow reverses. Where the numerator is positive in , a smooth increasing profile requires a positive denominator. Its minimum occurs at , giving
Equality does not give the prescribed asymptotic upstream state: cancellation of the two simple zeros at leaves a nonzero slope there. For the strict inequality, separation of variables constructs the monotone profile whenever the numerator remains positive between its endpoint zeros.
There is an additional restriction hidden in the printed positivity hint. Put and . Since , the potentially vanishing factor of the numerator is
The other factor, , is positive for . Therefore the asserted positivity throughout holds precisely for , that is . For , the zero at intervenes before , preventing the requested monotone connection. For example , , gives . Thus the smooth upstream tidal-wave admissibility conditions are
At the downstream zero is double, giving an algebraic approach; below four the endpoint approaches are exponential. The displayed Froude number bound is the requested necessary condition, with the source's missing amplitude qualification made explicit.
Let be the constant canal width, large compared with water depth. Then and , so friction is . Choose a reference uniform water depth , normal-flow speed satisfying , and scales
The continuity equation becomes . Dividing momentum by and dropping hats gives
The Froude number compares velocity to long gravity-wave speed. At the reference state, is subcritical flow, critical flow, and supercritical flow. In dimensional variables the wave characteristics travel at : one can propagate upstream in subcritical flow, while both move downstream in supercritical flow. Away from the reference state the local Froude number is .
These are the one-dimensional shallow water equations with bed slope and friction. The coordinate measures distance downstream, is time, is the wetted cross-sectional area, is section-averaged downstream velocity, and is water water depth above the bed. Thus is water volume flux and the first equation expresses mass conservation.
In the momentum equation, is the material acceleration, is gravitational acceleration, and is the positive downward bed slope, so drives the flow. The wetted perimeter is and is a dimensionless friction coefficient in the stated convention. The frictional deceleration is for downstream flow, while is the hydrostatic pressure contribution from surface-height variation relative to the sloping bed. The formula assumes the chosen positive-flow direction; a bidirectional friction model uses .

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