For a Fourier mode, the amplification polynomial is
Put and . The roots become
If , the square root is real, both roots have modulus one, and their separation is at least . The companion matrix has eigenvectors , so their uniform separation gives a mesh-independent bound on its powers. By power boundedness of a two-level Fourier scheme and the discrete Fourier transform, this proves stability for .
If , choose . The roots have product of modulus one and unequal moduli, so one has modulus greater than one. The scheme is unstable.
The boundary cases require more than a root-modulus check. At , gives , while gives . The companion matrices have nontrivial Jordan blocks and solutions of the form . Their linear growth rules out a uniform stability bound. This mode occurs on even periodic grids, which are enough to disprove mesh-uniform stability at the endpoints.
Therefore the stable range is exactly
Within this range, second-order convergence additionally requires two appropriately accurate starting time levels. The unit-modulus parasitic root near does not decay, so poor initialization cannot be repaired by the scheme.
The one-dimensional Time-dependent Schrodinger equation for a wavefunction in a real potential is
Multiplying this equation by , multiplying its complex conjugate by , and subtracting gives the probability continuity equation
If and its first derivative decay sufficiently rapidly as , then the probability current vanishes at both ends. Integrating the continuity equation and using the fundamental theorem of calculus yields
This conservation of quantum probability is required by the Born rule: once a normalizable wavefunction has total probability one, its time evolution must preserve that normalization.
For the stated Gaussian wave packet, put . Since
its squared modulus is
The Gaussian integral then gives
which is independent of time, as required.
Taking the squared modulus and using gives
The incident wavevector makes an angle with the downward vertical, so . Substitution gives the required formula.
Rouché's theorem states that if and are holomorphic functions on a neighbourhood of the closure of a bounded domain and
on its positively oriented boundary, then and have the same number of zeros in the domain, counted with multiplicity.
The Open mapping theorem states that a nonconstant holomorphic function on a domain maps every open subset to an open subset. To prove it, fix and put . By the identity theorem, the zeros of are isolated. Choose so that the closed disc lies in the domain and is the only zero of in that disc. Then
Whenever , the constant has modulus smaller than on the circle. The Rouche theorem therefore says that
has the same positive number of zeros in the disc as . Thus every lies in the image of , proving that the image is open.
If had a local maximum at , take a small open disc on which . The restriction of to cannot be constant, since the identity theorem would then make constant on the whole domain. The complex open mapping theorem says that is an open neighbourhood of , and such a neighbourhood contains points of modulus greater than , a contradiction. This proves the maximum modulus principle from the complex open mapping theorem.
Now let be bounded. Its closure is compact, so the continuous function attains a maximum there. If is nonconstant, the maximum modulus principle excludes an interior maximum; if is constant, the claimed bound is immediate. Hence
which is the maximum modulus principle on a bounded domain.
Finally let and suppose throughout . Fix . The principal complex logarithm is holomorphic on the right half-plane, so for each positive integer the function
is holomorphic on and continuous on its closure. Given , choose so large that
Apply the bounded-domain result to on . On the vertical part of the boundary, and hence . On the circular part,
It follows that
Letting and then gives . Since was arbitrary, this proves the bounded half-plane maximum principle.
The boundedness assumption is necessary. The function
is holomorphic on and continuous on its closure, and on the boundary, but is unbounded for real . Thus the boundary estimate does not control an unbounded holomorphic function on this unbounded domain.
Let
be reflection in the unit circle, and represent a Möbius transformation by
A direct calculation shows that is represented by
Thus exactly when and differ by a nonzero scalar. Applying the conjugate-linear involution twice shows that this scalar has modulus one. Rescaling by a suitable complex scalar then makes . Consequently all commuting maps, and only those maps, have the form
This is the Möbius maps commuting with reflection in the unit circle classification.
For such a map,
It follows that whenever precisely when
The inverse has the same property, so these and only these maps preserve the unit disc.
For a slowly varying envelope , the paraxial approximation to the Helmholtz equation is
Because and , passage through a sufficiently thin phase screen produces
Its modulus is one at the screen exit. Beyond the screen, , so the parabolic wave equation is . A Taylor expansion in propagation distance gives
Since
we find
It follows that
or, equivalently, . Thus random phase curvature produces local focusing and defocusing: free-space diffraction converts phase fluctuations into amplitude fluctuations immediately after the screen.
The reflected P-wave is propagating only while its normal wavenumber is real, equivalently while . Since
it is evanescent when
Put
Then its spatial factor is
which decays as . The reflected SV amplitude becomes
The numerator and denominator have equal complex modulus, so
Thus evanescent mode conversion changes the reflected SV phase but not its amplitude, as described by Unit-modulus SV reflection with evanescent P conversion.
The travelling-wave substitution gives
Write
Its real part satisfies
For , the imaginary part also gives
With and a translation chosen so that the notch is centred at zero,
Its limiting modulus is , as required. The same expression at is obtained directly from the second-order equation.
The special orthogonal group is
If
its first column is a unit vector, say . The second column is the unique unit vector perpendicular to it that gives positive determinant, namely . Thus
so is rotation through about the origin.
For , its real characteristic polynomial of odd degree has a real eigenvalue. Every eigenvalue of an orthogonal matrix has modulus one, so every real eigenvalue is . Nonreal eigenvalues occur in conjugate pairs whose product is one, while ; if all eigenvalues are real, their product likewise forces at least one to be . Hence fixes a nonzero vector . The plane is -invariant, and the restriction to it is an orientation-preserving orthogonal map. By the result it is a planar rotation. Therefore is a rotation about the axis .
An algebraic number is an algebraic integer when it is a root of a monic polynomial in .
If and are algebraic integers, the ring is a finitely generated -module. Multiplication by preserves this module, so the algebraic integer module criterion shows that is an algebraic integer.
The ring of integers of a quadratic field gives
since . For a direct verification, if with is integral, then its trace and norm are integers. Writing and reducing the norm condition in lowest terms shows first that can have denominator at most ; a denominator with odd numerator would require , which is impossible. Thus , and then the norm condition forces even, so . Conversely, every with is integral because is integral and algebraic integers form a ring.
Now let have degree and roots . Since
and , the integer cannot be ; hence . Thus is monic up to sign and is an algebraic integer.
Let be the product of all roots with modulus greater than one, counting multiplicity. Complex roots occur in conjugate pairs, so is real up to the signs of the real roots and
As a product of algebraic integers, is an algebraic integer; the equality forces . Therefore
is the absolute value of the product of the remaining conjugates, is rational, and is an algebraic integer. It is consequently a nonzero rational integer. Every remaining factor has modulus at most one, so this integer is at most one. It must equal one, and hence
This is the mahler-measure norm argument at measure two.
Let the intercepted ciphertexts be
Since , the extended Euclidean algorithm gives integers with . The common-modulus RSA attack recovers
Negative powers are evaluated using modular inverses. If an inverse does not exist, its greatest common divisor with already factors the modulus.
Let . The Jacobi method is
so and . If is strictly diagonally dominant, every Gershgorin disc of is centered at zero and has radius
Every eigenvalue therefore has modulus below one, so and part (i) proves convergence.
The product is entire. From and ,
Its modulus is therefore periodic with period one. The assumed bound for on , together with the reflected bound for , bounds on that strip and hence on all of . By Liouville's theorem is constant, while forces that constant to be zero.
If were nonzero at one point, it would be nonzero on a neighborhood, so on an open set; the identity theorem would then give , a contradiction to that choice. Therefore and .
The power method starts from and iterates
If the eigenvalue of largest modulus is separated by a spectral gap and the initial vector is nonorthogonal to a corresponding eigenvector, the iterates converge in direction to that eigenvector.
Inverse iteration with shift instead solves
It applies the power method to and therefore finds an eigenvector whose eigenvalue is closest to .
The vertices satisfy
After removing the root , the product of the other roots has modulus equal to the constant term of , namely . Hence the product of the chord lengths from one vertex of a unit regular polygon is . Multiplying this identity over all vertices counts every chord twice, so the product of all chord lengths is . Scaling the circle by scales each of its chords by , giving
The eigenvalues of the recurrence matrix have modulus , so transients decay and the coefficients approach the fixed point
Thus
For and , this is
Even multiples deliver impulses in phase and produce resonance; odd multiples alternate the phase and largely cancel.