The inclusion
always holds: each generator coming from lies in both extended ideals.
The reverse inclusion can fail. Let
for a field . Under ,
whereas in , so
Thus statement (2) is true in general and statement (1) is false in general.
There is an exact sequence of -modules
If is a flat module over , tensoring this sequence with preserves its left exactness. The image of each tensor product inside is the corresponding extension of an ideal, so
Both displayed inclusions therefore hold. This is the flat extension preserves finite ideal intersections property.
Conversely, assume condition (b), and let be nonzero. The stated property gives
These are nonzero vector spaces over the residue field , so their tensor product over is nonzero. Associativity and base change give
Therefore . This proves the reverse implication and the local tensor nonvanishing criterion.
Assume tensor products of two nonzero modules never vanish. If were distinct maximal ideals, then and
although both residue fields are nonzero. Hence has one maximal ideal and is a local ring.
For every module ,
If , this tensor product vanishes. Since , the assumed property forces . Thus condition (a) implies condition (b).
For and ,
The map is therefore canonical only for
Then and . The type-one generating function for a canonical transformation
gives
as required.
For and ,
Thus the map is canonical only for
At that value it is the identity and is generated by
For and ,
The one-dimensional criterion for a canonical transformation therefore gives
For either value, the type-two generating function for a canonical transformation
works, because and ; when , the first equation is equivalent to . For every other , the Poisson bracket is not one and the map is not canonical.
For the regular concatenation grammar, let
Then define
If and are regular, every nonterminal rule retained from is right-linear, and each replaced terminal rule is also right-linear. A regular derivation in uses exactly one terminal rule, at its final step; the replacement transfers control to , after which a word of is generated. Hence
Choose a new start variable . The concatenation grammar is
Indeed, its derivations first produce a word from and a word from in their original order, so .
Part (a) gives
Hence both operators preserve the magnetic quantum number . They are also odd under parity, while has parity . Their matrix elements between states of equal parity vanish. The position-momentum selection rules in the first excited hydrogen eigenspace therefore leave only the coupling between
The states decouple, and all diagonal matrix elements vanish.
In the ordered basis , remove the common energy and write
Let
The rotating-frame amplitudes obey a constant Schrödinger equation
Put
Since ,
For the initial amplitudes , the exact coefficients are therefore
and
Restoring the common unperturbed phase, the solution is
This is the rotating-frame solution for a harmonically driven two-level system.
The states diagonalize :
The perturbation therefore introduces no mixing. The orbital-angular-momentum-squared perturbation of hydrogen leaves
at energy
while
remain triply degenerate at
These statements are exact because the unperturbed Hamiltonian commutes with .
Take . Every proper divisor of divides , so the points fixed by that do not have exact period are precisely those fixed by . Part (ii) therefore gives
Because different starting points are counted separately, no division by the period is made. This is the exact power-of-two periods of the doubling map.
By part (i), exactly when
Thus the periodic points of the doubling map fixed by are
and their number is
For this gives three points: the fixed point and the two points in the two-cycle. For it gives fifteen: those three points and the twelve points in the three four-cycles found above.
The result follows by induction. It is true for . If
then
Therefore
Points whose period divides two solve
so, after removing the fixed point zero, the unique two-cycle is
Points whose period divides four are for . Removing the three points fixed by , namely , leaves twelve points of exact period four. They form the three orbits
and
Starting at another point on one displayed orbit gives the corresponding cyclic rotation.
A fixed point satisfies
so is an integer. In the only possibility is
Equivalently, a binary sequence fixed by the left shift is constant; , while represents the excluded endpoint, which is the same circle point.
Concatenate every finite binary word, ordered first by length and then lexicographically:
Every finite binary block occurs in this expansion. Since iterating shifts digits to the left, its orbit enters every binary cylinder and is therefore dense. The digit string is not eventually periodic, so it gives a concrete nonperiodic chaotic orbit.
Put . Part (i) identifies as the th arrival time of a rate
Poisson process. Hence has the gamma density
The change of variables , with , gives the kth-nearest-neighbour distance in a homogeneous Poisson point process:
Write , so . For ,
whose volume is
Thus the pushforward intensity of is
The pushforward is locally finite and diffuse, so the radial volume transform of a homogeneous Poisson point process and the mapping theorem show that
Choose with , and for set
A change of variables gives
The latter tends to zero as . Since the energy is nonnegative,
This is vanishing Dirichlet energy by dilation on the line.
The infimum is not attained. If an admissible had zero energy, then its weak derivative would vanish almost everywhere, so would be constant almost everywhere. The only constant in is zero, contradicting .

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