Each discrete term satisfies
and the same identity follows for the Fourier integral from . Hence
Apply to the Gelfand-Levitan-Marchenko equation. Differentiating under the integral and integrating the derivatives by parts, the boundary terms combine to . The terms containing cancel, leaving
Uniqueness of the Marchenko equation then also gives .
Solved by gpt-5.6-sol high.
The scattering data for the Schrodinger operator consist of the reflection coefficient on the continuous spectrum, the negative discrete eigenvalues , and their norming constants . Isospectrality gives
Comparing the asymptotic plane waves in gives
Solved by gpt-5.6-sol high.
The Lax equation with
reduces, after expanding the commutator, to the KdV equation
Thus the evolution is isospectral: the eigenvalues of are constant. The fourth derivative shown in the converted question is a transcription error.
Solved by gpt-5.6-sol high.
For , trajectories rapidly approach the cubic nullcline
and then move slowly along its attracting outer branches . For , the equilibrium lies on the repelling middle branch. Slow motion to a fold, a rapid jump to the opposite outer branch, and repetition produce a relaxation oscillation. For , the equilibrium lies on the attracting right branch; trajectories undergo any necessary fast jump and then drift to that equilibrium, so no relaxation cycle remains.
Solved by gpt-5.6-sol high.
Eliminating gives
For , take over one fast period. The oscillator energy satisfies
and averaging gives
Thus, if , amplitudes approach
producing a stable weakly nonlinear limit cycle. If , every nonzero small amplitude loses energy and trajectories approach the stable equilibrium.
Solved by gpt-5.6-sol high.
On each side of the stated parallelogram, substitution into the outward normal component of
shows that the leading terms point inward; the remaining terms are , so the region is positively invariant for sufficiently large .
There is one equilibrium,
Its Jacobian has determinant one and trace . If the equilibrium is unstable. A trajectory starting nearby remains in the compact trapping region, and its omega-limit set contains no stable equilibrium. The Poincare-Bendixson theorem therefore supplies a periodic orbit.
Solved by gpt-5.6-sol high.
Write . The global maximum of is the nonstationary endpoint , where
Endpoint Laplace's method therefore gives
The second exponential has its maximum at and is only of order , exponentially smaller. Hence
Solved by gpt-5.6-sol high.
Let . Its stationary points on are the endpoint and the interior point , with
The endpoint stationary-phase contribution to is
and the interior contribution is
The nonstationary endpoint contributes only . Taking imaginary parts gives
Solved by gpt-5.6-sol high.
With the other coordinates fixed, the smooth part of the objective has derivative at
The subdifferential of the penalty at zero is . Therefore
The stated condition is stronger than the needed condition , and hence places zero in this subdifferential. The one-variable exponential loss is strictly convex because the mismatch set is nonempty, so the minimizer is unique:
Solved by gpt-5.6-sol high.
For a convex function , its subdifferential is
For ,
The defining inequality shows directly that exactly when is a global minimizer.
Strict convexity means
for distinct and . Two distinct minimizers would make the midpoint have a strictly smaller value, so a minimizer is unique.
Solved by gpt-5.6-sol high.
At the optimal terminal wealth, normalized marginal utility defines an equivalent martingale measure and hence a marginal utility price
This is an arbitrage-free price, so . Concavity of utility implies that the finite-quantity indifference bid does not exceed its marginal price:
Consequently
Solved by gpt-5.6-sol high.
Let be maximal expected utility without the claim. The utility indifference price is determined by
For claims , mix optimal portfolios for their indifference problems with weights and . Concavity of shows that buying at price
gives expected utility at least . Since maximal utility decreases with purchase price,
Thus is concave.
Solved by gpt-5.6-sol high.
If were an arbitrage gain, then would be attainable from the same initial wealth for every . Since is increasing,
almost surely, with strict inequality on a set of positive probability under the usual strictly increasing meaning of utility. This contradicts optimality of . Hence existence of an optimizer implies no-arbitrage.
Solved by gpt-5.6-sol high.
A risky-asset portfolio financed through the risk-free asset has zero-cost discounted gain
It is an arbitrage when almost surely and .
Solved by gpt-5.6-sol high.
The assertion is true by the maximum principle for harmonic functions. A direct reduction to part (i) is also possible: for , set
Then , so
Because is bounded, uniformly as . Taking the limit yields
Solved by gpt-5.6-sol high.
The assertion is false. On the open unit disk take, for ,
Its relevant fourth derivatives satisfy
Nevertheless, since , every point with has
Thus the maximum lies strictly inside .
Solved by gpt-5.6-sol high.
The assertion is false. On the open unit disk, let
Then , but the unique maximum is , whereas on the boundary.
Solved by gpt-5.6-sol high.
The assertion is true. Continuity and compactness give a maximum of on . At an interior maximum the Hessian matrix is negative semidefinite, so its trace satisfies , contradicting . The maximum must therefore occur on . This is the strict form of the maximum principle for subharmonic functions.
Solved by gpt-5.6-sol high.

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