The step response of a damped oscillator is the time integral of its causal Green function of a damped oscillator. Put and define for . Then and its oscillator equation has constant right side . Integrating explicitly gives
This formula applies when . It is a convolution of the causal impulse response with the shifted Heaviside step function, so the response is zero before the forcing starts and has the stated zero initial data.
The integral definition also handles the degenerate parameters without division ambiguities. For ,
for , . These are the continuous zero-frequency limits of the step response.
Use the classical risk model surplus , with , and write for its ultimate survival probability. The first-claim decomposition for survival probability follows by conditioning on the first arrival time of the Poisson process. That time has exponential distribution of rate . A claim at time leaves capital if , after which the Markov property restarts the same risk model. Consequently
Put and change variable :
The convolution is continuous since is bounded and is integrable. Differentiating proves the survival integro-differential equation
For the specified claim law, expand its probability density function as . This is an equal-weight mixture distribution of exponential distributions with rates and . In the convolution, set to obtain
Since , the requested coefficients are
For the exponential-mixture differential equation for survival probability, define , and . Differentiating the integrals yields
Apply to the last equation, where . The first two equations eliminate , giving
Thus
The characteristic polynomial factors as
The ordinary differential equation therefore has solution .
The claim expected value is . The relative safety loading is , and the given zero-capital survival probability is . The limit at infinity sets . A third condition comes from the original survival integro-differential equation: its convolution vanishes at zero, so . Therefore
which gives and . The final survival probability and ultimate ruin probability are
Both exponential coefficients of are positive. Hence increases from to one, and decreases from to zero. The initial slope is essential: the two stated boundary values alone do not determine all three constants of the eliminated differential equation.
Use and , so the Fourier transform of is . Write for the homogeneous degree- part. An elliptic differential operator has for every real . By continuity on the unit sphere, . The lower-degree terms are bounded by for , whence
for sufficiently large . This proves the high-frequency lower bound for an elliptic polynomial. Degree zero just means a nonzero constant and has no derivative gain.
With the Fourier convention in Question 3, the Sobolev space is
The condition includes that the weighted transform is represented by an function. For open , the Local Sobolev space consists of for which , extended by zero, belongs to for every . We use the elementary Sobolev multiplication by a smooth cutoff fact for every real . It follows from Fourier convolution with the rapidly decreasing , the weighted inequality , and the convolution bound.
For a compactly supported distribution, continuity on test functions supported in a fixed compact neighborhood gives finite order: for some integer ,
Insert a compact smooth cutoff function equal to one near the support, times . The resulting Fourier transform is smooth and satisfies . The distribution is also tempered by this same finite-order bound. Thus
Indeed the square of the weighted bound is integrable exactly when . This is negative Sobolev regularity of a compactly supported distribution.
We next prove local regularity by a high-frequency reciprocal parametrix kernel, including its off-diagonal smoothing property. Choose equal to one on a ball containing all real zeros of , and put , defining it smoothly as zero in the inner ball. Differentiation of the reciprocal and the elliptic lower bound give
The Fourier multiplier maps to by its zeroth-order bound, and
The kernel is smooth away from the origin: for , repeatedly integrate by parts using . After sufficiently many integrations, the differentiated symbol is integrable. For any desired derivative, repeat the argument with the additional polynomial . A large-radius cutoff function justifies each step and its removal uniformly on compact sets away from zero. Thus convolution by carries a compactly supported distribution to a smooth function at points separated from its support. Also carries a compactly supported distribution to a Schwartz function, because is smooth with compact support.
For a target compact set in , choose equal to one on a neighborhood of it. Then and have compact support, and the commutator is supported where derivatives of occur, away from the target. The parametrix identity gives
The first term is in since . The other two terms are smooth near the target by the proved kernel property. Since the target was arbitrary,
This proof does not discard the cutoff function commutator; it places its support away from the set where regularity is sought.
For the final polynomial, select a multi-index with and a nonzero constant. The derivative-ratio hypothesis immediately gives at large frequency. In particular has no real zero there. For , its degree bound also forces . Differentiating gives products of ratios , whose total derivative order is . Hence the corresponding high-frequency reciprocal satisfies
Its multiplier maps to . Its kernel is still smooth off zero: each frequency integration by parts now lowers the order by , so more iterations may be needed, but supplies arbitrarily much decay. The same separated-support commutator identity applies without a change. The derivative-ratio Sobolev gain for a polynomial operator is therefore
Simply estimating the commutator by its differential order would lose this sharper gain; the off-diagonal kernel argument uses the full derivative-ratio hypothesis.
Use the conventional Laplace operator . The fundamental solution of the Laplace equation in two dimensions is , with . To check its sign, integrate the outward normal derivative around a circle: . Applying integration by parts against a smooth compactly supported test function and shrinking the circle gives the distributional identity.
The printed stream function has . For each multi-index with , transfer derivatives to the compactly supported function:
The logarithmic singularity is locally integrable. On a bounded region in , the convolution uses one fixed bounded region in the integration variable; splitting off a small disk around the singularity proves continuity of these derivatives. Thus , and convolution of the distributional identity gives
The asserted plus sign is false for the printed kernel and the conventional Laplacian. Any nonzero smooth compactly supported is a counterexample. To obtain , replace the kernel's minus sign by a plus sign, or explicitly adopt the negative Laplace operator. Below, retain the printed kernel and velocity convention. With that convention, , so is the negative of conventional scalar vorticity. This sign does not change the transport or flow arguments.
Use the phase-distance convention for a Bohr set:
where the norm is distance to the nearest integer. This is the Bohr set in phase-distance convention; the alternative condition has a different radius and corresponding constants. Assume , as requires.
For each residue , form in the -dimensional torus. Around these points place translates of a box of side length in each coordinate. For , their volumes sum to . If , two boxes overlap, and their distinct indices differ by a nonzero with every phase distance less than . Thus the Bohr set contains a nonzero element at the stated threshold. For larger radii the entire group is already present.
Letting the box width decrease to and using the finite number of possible nonzero , obtain a nonzero with for every . By the triangle inequality, lies in whenever . Since is prime, these multiples are distinct up to length . Therefore, in the usual radius range , the arithmetic progression
has the requested length. For literally unrestricted , the correct lower bound is : a progression of distinct residues cannot exceed . For example, , makes the uncapped printed bound impossible. If is empty, the Bohr set is the whole group and has a progression of length ; the displayed exponent is simply inapplicable.
Now transfer the dense integer set to a larger cyclic group. Choose a prime , using Bertrand's postulate, and regard as a subset of . Its density is at least . Normalize Fourier coefficients on a finite abelian group and convolution by
The Fourier inversion and Parseval identity formulas are and ; convolution turns into multiplication of Fourier coefficients on a finite abelian group.
For , set . Then Parseval identity bounds
Also, with , the nonnegative convolution is supported exactly on the modular set , and
The frequencies outside contribute in absolute value at most . For , the real part of each phase from is at least ; moreover and . Hence . We have proved the cyclic Bogolyubov lemma with explicit phase radius:
The previous Bohr set argument gives a modular arithmetic progression of length at least . The remaining step is lifting a short modular progression to an integer progression. Every one of its elements has a unique integer lift belonging to . Successive lifted differences lie in and are congruent to the same residue. Since , at most one integer in this difference interval represents that residue, so every successive difference is the same. The lifts form a genuine integer arithmetic progression, not merely a modular one.
For sufficiently large , the constants can be absorbed into half the exponent. Thus
No attempt to optimize this absolute constant is needed.
A counterexample comes from dense integer sets with only logarithmic-length progressions. To show that itself need not have such a progression, choose a random subset by independent inclusion with probability . Its size has mean and variance at most , so Chebyshev's inequality shows . There are at most increasing arithmetic progressions of any fixed length , and each belongs to with probability . Taking makes the union bound at most . For large , some realization has at least elements and no length- arithmetic progression. Take a subset of exactly elements. It retains that avoidance. Such a set has no progression longer than , and therefore no progression of length for any fixed , eventually. Interpret the prescribed exact cardinality on values of where it is integral, or use its integer part.