Gauss lemma for polynomials states that the product of two primitive polynomials over a unique factorization domain is primitive. In particular, a primitive polynomial in is reducible over exactly when it is reducible over .
Eisenstein criterion says that a primitive polynomial
is irreducible over if there is a prime such that , for every , and . To prove it, suppose with both factors of positive degree. After removing contents, Gauss's lemma lets us take primitive. Reduction modulo gives
so both reduced factors are monomials of positive degree. Their constant terms are therefore divisible by , making divide , a contradiction.
An algebraic integer is a complex number satisfying a monic polynomial in . Let be one and let be its monic minimal polynomial. The usual proof using polynomial content shows that . The set
is the kernel of the polynomial-evaluation ring homomorphism, hence an ideal. Every is divisible by in . Because is monic, polynomial division of by takes place in , and the remainder must vanish by minimality. Therefore
where is monic and irreducible.
For
translation gives
This is Eisenstein at , so and therefore are irreducible over . Hence
Irreducibility and Gauss's lemma also show that is a prime ideal of , so
It is not a field. The class of is nonzero but not a unit: reducing further modulo gives a nonzero quotient
in which the image of is zero, whereas a unit must remain a unit under every unital quotient map. Thus
Set
Conditioning on gives the affine recurrence
Its fixed point is the first component of the stationary distribution,
Thus , and gives
Starting instead from state two gives the same recurrence with initial value zero. Therefore
Let the upper plate in flow A move at speed , with the lower plate fixed. The Couette flow profile is
so its mid-plane speed is and its total viscous dissipation per unit plate area is
Write for the constant pressure-gradient magnitude in flow B. The plane Poiseuille flow profile is
Equality of the mid-plane speeds gives
Since ,
Hence
Let be distance from the common centre. By Gauss's law, the electric field is radial and equals
Taking the electric potential to vanish at infinity and requiring continuity across each shell gives
The electrostatic energy is the integral of the electric-field energy density:
Only the two nonzero-field regions contribute, so
Therefore
Use the angular-frequency Fourier transform
Then
with the continuous value .
The convolution is times the length of the overlap of the intervals and . Thus
The convolution theorem states, for this convention, that
Since , it follows that
again interpreted continuously at , where .
Because the constraint determines
the constrained function is
Its stationary points satisfy
When , these equations give
When , subtracting the two bracketed equations gives , and substitution then gives
with the two signs chosen independently. These are exactly the constrained stationary points; equivalently they follow from the Lagrange multiplier equations.
Under the additional restriction , the constraint gives the compact elliptical disc . On its boundary , the objective is zero. At the four nonzero interior stationary points,
with the sign determined by . Therefore
Write . The zero and constant-one polynomials give and . Also,
so is closed under finite intersections. Every nonzero one-variable complex polynomial has only finitely many roots, and every finite subset is the zero set of . Consequently is exactly the cofinite topology: its open sets are the empty set and the complements of finite sets. An arbitrary union of such sets is again empty or has finite complement, so is a topology.
The product topology on is the topology with basis
The proposed complement need not be open. Take
Then is the diagonal. If its complement were open, a point such as would have a basic neighbourhood contained in that complement. But and are nonempty cofinite subsets of , so . For , the point belongs both to and to the diagonal, a contradiction. Hence
Fix . If , then normality of gives
Thus the transitive group action of permutes the orbits of a group action of , so all -orbits have the same cardinality . They partition the prime-sized set , hence divides . The only possibilities are and . The first would make every element of fix every point, contrary to the assumption that acts nontrivially. Therefore and
Now suppose . Define the orbit map
It is surjective by transitivity of . If , then , so ; hence is bijective. For ,
Thus is an equivariant map: conjugation by on corresponds exactly to the given action of on .
The Lagrangian sufficiency theorem for a maximization problem says the following. Suppose the constraints are and , and define
If a feasible satisfies complementary slackness and globally maximizes , then globally maximizes . Indeed, for every feasible ,
This proves the theorem. In a concave maximization problem, stationarity and the boundary optimality conditions ensure the required global maximum of the Lagrangian.
For the problem at hand, retain as the domain and attach a multiplier to the equality:
For , this is concave in on the domain. Its separate maximizers satisfy
while the term is . Thus may be positive only when ; when , its maximizing value is .
If
take . Then , , and feasibility fixes
The Lagrangian sufficiency theorem gives the maximum
If
then and . The equality constraint becomes
so
Consequently
The assumptions and ensure . At the stationary point , so the maximum value is
The two formulas agree at .

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