The minimal polynomial is the unique monic polynomial of least degree with . Existence follows from a linear dependence among powers of in the finite-dimensional vector space ; polynomial division proves uniqueness and that it divides every annihilating polynomial. The characteristic polynomial is , independent of basis because a change of basis conjugates the matrix.
Write
In the cyclic basis, the companion matrix is
For , the displayed vector relation gives . Polynomial evaluation commutes with , so for every basis vector. Thus .
No nonzero polynomial of degree below can annihilate , since applying it to the cyclic vector would contradict independence of . Hence . Finally, direct expansion of , or induction along the last column, gives . Therefore
The argument computes the determinant and annihilator directly and does not invoke the Cayley-Hamilton theorem.
The second equilibrium point equation gives . Substituting into the first gives , so . Put , with . Then
The function is strictly increasing on , since . It starts at zero and tends to infinity, so it takes the value one exactly once. Moreover , so . This proves uniqueness of the stated equilibrium point.
At that point , and the Jacobian matrix is
Its trace is and determinant . The characteristic discriminant is , so its two eigenvalues are
They are distinct and positive, with eigenvectors and respectively. Thus the linearized critical point is an unstable node. It is a hyperbolic equilibrium, so the original nonlinear equilibrium point is also locally repelling; this last observation is stronger than the requested linearized classification.
Choose characteristic parameter with initial value at . The characteristic equations are
The first two integrate immediately; substitution into the third gives
Eliminating gives the projected parabola
The sign restriction selects the half-parabola actually reached from the initial point.
The projection map has Jacobian determinant , so the initial curve is noncharacteristic for every allowed . Its global inverse is
defined precisely when have the same nonzero sign. Every such point is reached by exactly one characteristic. Hence the region of unique determination from these initial data projects onto
the first and third quadrants. The axes are not reached for finite parameter from , and the other two quadrants have no method of characteristics issued from this initial curve.
As a direct check, substitution of the inverse parameters gives the solution
It has , and differentiating gives . This is quadrant uniqueness for unequal dilation characteristics.
Figure 1.
Each initial point determines one half-parabola in the first or third quadrant
. Details.
For , the derivatives are and . Substituting gives . The independent solutions have Wronskian on , so they form a fundamental system of solutions.
Divide the inhomogeneous linear differential equation by and use variation of parameters. Choosing integrals from one gives the particular solution
Thus . The first boundary condition gives . The integral endpoint terms cancel when differentiating , so the second gives
Consequently
Collect the coefficient of on either side of . A suitable Green function is
The two pieces agree at , , and for . For an interior source point its derivative jump is
Thus multiplication by the leading coefficient gives unit in a ring source strength. Away from , both pieces solve the homogeneous linear differential equation. With continuous , the integral representation has the required second derivative and solves the equation pointwise in .
For uniqueness, the difference of two solutions is . Its boundary conditions give and , forcing . Hence the solution is unique. This is the mixed Green function for an Euler operator with exponents one and two.
A function on the open set is holomorphic if at every the complex limit
exists. The limit is independent of the direction of approach.
A pole of order at means that in a punctured neighborhood, where extends holomorphically across and . Equivalently has a nonzero finite limit at .
For the given quotient, is equivalent, on putting , to , or . Thus all possible poles are , , with no additional nonreal solutions. At such a point,
At the numerator does not vanish, so the pole has order two. At zero the numerator cancels one order:
Therefore
The numerator's cancellation at zero is why not every denominator zero produces the same pole order.
For , let denote the algebraic conjugate, not necessarily ordinary complex conjugation when . Conjugation respects multiplication, and . Therefore
If is a unit in a ring, choose its inverse in the same ring. Then , and both norms are nonnegative integers, forcing . Conversely, if , then , so belongs to the ring. Thus is a unit in a ring exactly when .
For negative , the equation becomes . If , its integer solutions give the four units . If , the term forces , leaving . Hence
For , the element has field norm . Its powers , , are all units by multiplicative function and are distinct, since their positive real values strictly increase with . Thus has infinitely many units. This argument concerns the stated integer-coefficient ring; it does not replace it by a larger ring of algebraic integers.
Use the monomial basis , . Direct differentiation gives
with the endpoint terms zero. Repeated application therefore gives , while and . Each nilpotency index is exactly , so
Next
and hence . These real eigenvalues are distinct. A polynomial annihilates this operator exactly when it vanishes at all of them, giving
The commutator is diagonal in the displayed monomial basis. Since , are nonzero nilpotent linear map; a diagonalizable nilpotent map would have a diagonal matrix with all eigenvalues zero and thus be the zero map. Therefore only is diagonalizable. The calculation realizes raising and lowering on binary homogeneous polynomials.
The weight is strictly positive and all its polynomial moments are finite. Thus the given integral is a inner product: for a nonzero polynomial, its square is positive on a nonempty interval, so its weighted integral is strictly positive.
In the finite-dimensional vector space , subtract the orthogonal projection onto a finite-dimensional subspace of onto :
This is monic, since the subtracted polynomial has lower degree, and is orthogonal to every lower-degree polynomial. If were two such monic polynomials, their difference would lie in and be orthogonal to that space. Taking its inner product with itself gives zero, hence the difference vanishes. This proves existence and uniqueness for every , with .
Odd moments vanish because the weight is even; the even moments are
Consequently , while a monic quadratic orthogonal to has no linear term, and orthogonality to one gives its constant term . Thus
Finally is also monic and orthogonal to every lower-degree polynomial, by the change of variable . Uniqueness implies . In particular is odd and
This is parity of monic orthogonal polynomials for an even weight.
The characteristic equation of a partial differential equation for is . Thus the two characteristic curve families are . Set and . The chain rule gives and , reducing the equation to
Integrating in the two independent characteristic coordinates gives , or . At , the value condition gives , while the derivative condition gives . Hence and , so
Direct differentiation gives , and , verifying both the equation and the two data. The additive constants cancel in , so they do not create different solutions.
Write the equation as with . Homogeneous solutions vanishing at the left and right endpoints are and . Their Wronskian is . The Dirichlet Green kernel for minus second derivative plus one is therefore
It vanishes at , is continuous at , and its first derivative has jump . Thus in the distributional derivative sense, with the sign appropriate to . Integration against gives the required boundary-value solution. The kernel is positive and symmetric, as is also apparent in the figure.
For the specified step forcing only contributes at , giving
The discontinuity in gives a piecewise twice-differentiable solution with continuous value and first derivative, rather than a jump in itself.
Figure 1.
A positive Dirichlet Green kernel smooths step forcing
. Original plots of three kernel sections and the solution for forcing zero on the left half and one on the right half of the interval. The derivative kink in each kernel section supplies its point source; integration produces a continuously differentiable forced solution. Details.
The fundamental theorem of calculus first gives . Integrating again, or differentiating the proposed expression twice and checking its initial values, yields the Volterra integral equation
For , the initial value problem is solved by . Its Picard iteration constructs the sine series directly. The base approximation is . If
then elementary integration gives
Substituting this finite sum in the next update, then shifting its index, proves the same formula with in place of . This is the required mathematical induction. The resulting partial sums converge to for every real , and uniformly on every bounded interval: the absolute terms on are bounded by the convergent series .
The printed update lists , which would leave unspecified if read literally. The usual Picard iteration, and the requested induction from , use the update starting at ; that intended convention is used here.

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