Chapter 4: A Priori Estimates

Chapter 3 proved that the vector field of system (L1) is locally Lipschitz and that the Picard-Lindelöf theorem gives a unique local solution from every initial condition in the phase space Code Test. That solution lives on a maximal interval Code Test, and the blow-up alternative tells us that if the solution stays in a compact set, then Code Test.

The question is: does the solution stay in a compact set?

In the Chapter 0 example, the answer was visible by inspection. The actor Code Test stayed in Code Test because the damping Code Test vanished at the boundary, silencing the drift before Code Test could escape. The distribution Code Test stayed in Code Test because the relaxation equation Code Test is a convex combination that preserves the simplex. And the critic Code Test stayed bounded because the equation Code Test has a coercive linear term that pulls Code Test back toward the origin. Together, these three mechanisms trapped every trajectory in the compact absorbing set Code Test.

This chapter proves that all three confinement mechanisms extend to the general model. We will establish them in order — actor-box invariance, simplex invariance, critic coercivity — and then combine them to build the compact absorbing set. Once the absorbing set is in hand, the blow-up alternative from Chapter 3 gives global existence, completing the semiflow construction.

The proof plan has five steps:

  1. Actor-box invariance (Section 4.1). The damping matrix Code Test vanishes on the boundary of Code Test, so a scalar barrier argument confines Code Test to the box for all time.

  2. Simplex invariance (Section 4.2). The law equation has an explicit variation-of-constants formula that represents Code Test as a convex combination of simplex elements.

  3. Critic coercivity (Section 4.3). The uniform positive definiteness of the critic matrix gives an energy estimate that bounds Code Test and identifies the level toward which the critic norm decays; the absorbing radius Code Test is chosen strictly above that level.

  4. The compact absorbing set (Section 4.4). Combining the three invariance results yields the explicit compact absorbing set Code Test, which is forward invariant and absorbs every bounded subset of Code Test.

  5. Global existence (Section 4.5). The a priori bounds prevent blow-up, and the blow-up alternative from Chapter 3 extends the local semiflow to all positive time.

4.1 Actor-Box Forward Invariance

The actor equation from Chapter 2 is

Code Test

where Code Test is the damping matrix and Code Test is the raw actor drift. The damping factor Code Test in the Code Test-th coordinate vanishes when Code Test, which is the boundary of the actor box Code Test. The question is whether this vanishing is enough to prevent Code Test from escaping.

For the dynamical-systems reader. The damping Code Test acts as a soft projection: instead of discontinuously reflecting the trajectory at the boundary of Code Test, it smoothly reduces the drift to zero as the boundary is approached. This is a design choice in the RL algorithm — the actor parameter space is bounded, and the damping enforces that bound without introducing discontinuities that would break the Lipschitz regularity proved in Chapter 3. The resulting invariance is stronger than what a hard projection would give: the boundary of Code Test is an invariant face of the box, and a trajectory either stays away from it or stays on it forever.

Proposition 4.1 (Invariance of the actor box). Let Code Test be a local solution of system (L1) (Definition 2.10) on an interval Code Test. Then

Code Test

More precisely: if Code Test for some coordinate Code Test, then Code Test for all Code Test. If Code Test, then Code Test for all Code Test.

The proof uses a scalar barrier argument based on the arctanh function. The idea is that the change of variable Code Test absorbs the damping factor and transforms the actor ODE into one with a bounded right-hand side. Since arctanh maps Code Test to all of Code Test, a trajectory that starts in the interior can never reach the boundary in finite time — it would need to push the arctanh coordinate to infinity, which the bounded right-hand side prevents.

Proof. Fix a coordinate Code Test. Write

Code Test

The function Code Test is continuous on Code Test because the solution is continuous and Code Test is continuous (Lemma 3.2). The Code Test-th actor coordinate satisfies the scalar ODE

Code Test

Case 1: Interior start (Code Test). Define the first exit time

Code Test

with the convention Code Test. We will show that Code Test, meaning the trajectory never reaches the boundary.

For every Code Test, we have Code Test for all Code Test, so the damping factor is strictly positive and we may divide both sides of the ODE by Code Test. Using the identity

Code Test

we obtain the transformed equation (the chain rule contributes a factor Code Test from the argument Code Test):

Code Test

Integrating from Code Test to Code Test gives

Code Test

Taking absolute values:

Code Test

Now suppose for contradiction that Code Test. Then Code Test is continuous on the compact interval Code Test, so the quantity

Code Test

is finite. Therefore, for every Code Test,

Code Test

Applying the hyperbolic tangent (which is increasing and satisfies Code Test for all finite Code Test):

Code Test

By continuity of Code Test, the same bound holds at Code Test:

Code Test

This contradicts the definition of Code Test as the first time Code Test. Therefore Code Test, and

Code Test

Case 2: Boundary start (Code Test). Define Code Test. Then Code Test, and

Code Test Code Test Code Test Code Test

The coefficient Code Test is continuous on Code Test. The function

Code Test

therefore has derivative zero. Evaluating at Code Test gives

Code Test

The exponential factor is strictly positive. Therefore Code Test for every Code Test, which means Code Test for all Code Test.

Case 3: Boundary start (Code Test). Define Code Test. Then Code Test, and the analogous computation (with the integrating factor of opposite sign) gives

Code Test

The function

Code Test

has derivative zero. Since Code Test and the exponential is strictly positive, we conclude Code Test for all Code Test, hence Code Test on Code Test.

Since the argument applies to every coordinate Code Test, we conclude

Code Test

The proof is complete. Code Test

Verification in the Chapter 0 example. In Chapter 0, the actor is a scalar with Code Test, so the actor box is Code Test and the damping is Code Test. The actor equation is

Code Test

At Code Test, the damping factor Code Test kills the drift regardless of Code Test, Code Test, or Code Test. The arctanh transformation becomes

Code Test

which is a bounded function on Code Test. In particular, consider a trajectory that starts in Code Test with Code Test; Chapter 0 verified that Code Test is forward invariant, so Code Test for all time. Then Code Test, and the arctanh coordinate grows at most linearly in time: at rate bounded by Code Test. Since Code Test and Code Test on Code Test, the arctanh coordinate is bounded by Code Test. The hyperbolic tangent of Code Test is always strictly less than Code Test, confirming that Code Test never reaches Code Test from an interior starting point.

The boundary cases are even simpler: if Code Test, then Code Test, the right-hand side of the ODE is zero, and Code Test. The uniqueness argument in Case 2 shows that Code Test for all time. Likewise Code Test gives Code Test for all time. These are the boundary equilibria observed in Chapter 0.

Takeaway. The actor stays in its box because the damping matrix Code Test vanishes at the boundary, and the arctanh barrier argument shows that no interior trajectory can reach the boundary in finite time. The boundary itself is invariant: any trajectory that starts there remains there forever. This confines the first Code Test coordinates of the solution to the compact set Code Test.

4.2 Simplex Forward Invariance

The law equation from Chapter 2 is

Code Test

where Code Test is the relaxation rate and Code Test is the prescribed closure map. The question is whether a distribution that starts in the simplex Code Test stays there.

In the Chapter 0 example, the distribution variable was a single scalar Code Test (with Code Test), and the law equation was Code Test. We observed that the relaxation pulls Code Test toward a target in Code Test, and the exponential decay Code Test in the explicit solution ensures that Code Test stays in Code Test if it starts there. The general argument is essentially the same: the explicit solution of the law equation represents Code Test as a convex combination of simplex elements.

Proposition 4.2 (Invariance of the state simplex). Let Code Test be a local solution of system (L1) on Code Test. Then

Code Test

Proof. The law equation is a linear, non-autonomous ODE in Code Test:

Code Test

This is a first-order linear equation with constant coefficient Code Test and time-dependent forcing Code Test. The unique solution is given by the variation-of-constants formula: multiply both sides by the integrating factor Code Test, observe that

Code Test

and integrate from Code Test to Code Test:

Code Test

Dividing by Code Test gives the explicit representation

Code Test

We now verify that this is a convex combination of elements of Code Test.

Nonnegativity and normalization of the coefficients. The coefficient of Code Test is Code Test. The integrand in the second term has coefficient Code Test for Code Test. The total weight is

Code Test

Membership in Code Test. The initial condition Code Test by hypothesis. Every value Code Test belongs to Code Test because Code Test maps into Code Test by definition (Definition 2.9). Since the coefficients are nonnegative and sum to Code Test, the representation expresses Code Test as a convex combination of points of Code Test — an integral average rather than a finite convex combination — so we check membership coordinatewise. Each coordinate

Code Test

is nonnegative because every term on the right is nonnegative, and summing over Code Test — using that Code Test and each Code Test have coordinates summing to one — reproduces the total-weight computation above: Code Test. We conclude

Code Test

The proof is complete. Code Test

Verification in the Chapter 0 example. In Chapter 0 the law equation is

Code Test

with Code Test. The variation-of-constants formula gives

Code Test

Since Code Test by Proposition 4.1, the target Code Test lies in Code Test. The initial condition Code Test. The coefficients are nonnegative and sum to Code Test, so Code Test is a convex combination of values in Code Test, which means Code Test for all Code Test.

We can also check the simplex property directly at the level of the vector field. The full two-component law equation is

Code Test

Since Code Test and Code Test, adding the two equations gives

Code Test

The total mass is conserved, confirming that the simplex constraint Code Test is preserved by the flow.

Takeaway. The distribution stays in the simplex because the variation-of-constants solution is a convex combination of simplex elements, with nonnegative coefficients that sum to one. This confines the last Code Test coordinates of the solution to the compact set Code Test.

4.3 Critic Coercivity and the Energy Estimate

Propositions 4.1 and 4.2 confine the actor to Code Test and the distribution to Code Test. The actor box and the simplex are both compact, so these two coordinates cannot cause blow-up. The remaining question is whether the critic Code Test stays bounded.

The critic equation from Chapter 2 is

Code Test

where

Code Test

The term Code Test acts as a restoring force that pulls the critic back toward the origin, while Code Test is a bounded forcing term. The strength of the restoring force is controlled by the coercivity constant Code Test, which appears in the definition of Code Test as the scalar multiple of the identity.

For the RL reader. The coercivity constant Code Test above is the regularization strength in the critic update. In a typical linear temporal-difference learning rule, the data-driven sum Code Test of rank-one feature-outer products can be degenerate — it may fail to be positive definite if the critic features do not span all of Code Test. The added term Code Test prevents this degeneracy. From the dynamical-systems perspective, this regularization is what turns the estimation loop into a dissipative mechanism: without it, the critic coordinate could grow without bound, and the system would not have a compact absorbing set.

Hypothesis (Critic coercivity). Throughout this chapter we use the following uniform coercivity hypothesis: there exists Code Test such that for every Code Test and every Code Test,

Code Test

The structural input from Chapter 2 is the bound Code Test in Definition 2.4 (the critic coefficients, where the regularized matrix Code Test is defined); that bound is what makes the symmetric part of Code Test uniformly positive definite, with a constant that does not depend on Code Test. Proposition 4.3 below verifies the displayed inequality from this structural input.

We will use the bounded reward constant Code Test and the bounded feature constant Code Test, both finite because Code Test and Code Test are finite. The product Code Test will serve as the forcing bound.

We first establish the coercivity bound and the forcing bound, then derive the energy estimate.

Proposition 4.3 (Coercivity of the critic matrix). For every Code Test and every Code Test,

Code Test

Moreover, the forcing vector satisfies

Code Test

where Code Test is the forcing bound introduced above.

Proof. By definition of Code Test,

Code Test Code Test

Each term Code Test is nonnegative because the occupancy Code Test and the square is nonnegative. Therefore

Code Test

For the forcing bound, recall that Code Test is a probability weight on Code Test when Code Test (the occupancy entries are nonnegative and sum to one). Therefore

Code Test

The proof is complete. Code Test

Two immediate consequences follow. First, Code Test is positive definite (and therefore invertible) for every Code Test. Second, the frozen critic equilibrium Code Test exists and satisfies

Code Test

because Code Test.

We now derive the energy estimate, which is the main tool for controlling the critic norm.

Proposition 4.4 (Energy estimate for the critic). Let Code Test be a local solution of system (L1) on Code Test. Then for all Code Test,

Code Test

In particular, Code Test for all Code Test.

The proof has three steps: differentiate Code Test, apply the coercivity and forcing bounds, and solve the resulting scalar differential inequality.

Proof. Step 1 (Differentiate the energy). Compute

Code Test

Step 2 (Apply the bounds). By Proposition 4.3,

Code Test

and

Code Test

Combining gives the raw energy inequality:

Code Test

The right-hand side of Code Test is a quadratic in Code Test that is negative whenever Code Test. This already shows that the critic norm cannot grow past Code Test from below, but we want an explicit decay estimate. To obtain one, we absorb the Code Test term using the elementary inequality Code Test with Code Test and Code Test:

Code Test

Substituting:

Code Test

Step 3 (Solve the differential inequality). Set Code Test. Then

Code Test

Therefore

Code Test

The function Code Test is nonincreasing. In particular, Code Test for all Code Test, which gives

Code Test

Unfolding the definition of Code Test:

Code Test

Rearranging:

Code Test

For the “in particular” bound, note that the right-hand side is a convex combination of Code Test and Code Test (with coefficients Code Test and Code Test), hence it is bounded by Code Test. Taking square roots gives

Code Test

The proof is complete. Code Test

The energy estimate tells us two things. First, the critic norm can never exceed its initial value or the threshold Code Test, whichever is larger. This immediately prevents finite-time blow-up of the critic. Second, regardless of how large Code Test is, the critic norm eventually falls below Code Test for any Code Test — the exponential decay of the first term pulls Code Test toward Code Test from above. This decay is the absorption mechanism that we will use in Section 4.4.

Verification in the Chapter 0 example. In Chapter 0, the critic equation is

Code Test

with Code Test (a scalar) and Code Test.

Coercivity. The coercivity constant is Code Test, because Code Test for all Code Test. (The extra term Code Test only increases the coercivity.) Therefore Code Test.

Forcing bound. The forcing is Code Test, with Code Test for all Code Test. Therefore Code Test.

Asymptotic critic level. The frozen equilibrium is Code Test, which satisfies Code Test. The level toward which the critic norm decays is therefore Code Test. The absorbing radius fixed in Chapter 2 is strictly larger: Code Test, the value used in Chapter 0. The strict gap between the level and the radius is what makes absorption work in finite time — see Section 4.4.

Energy estimate. The energy estimate becomes

Code Test

For Code Test, we have Code Test. At Code Test, this gives Code Test; as Code Test, it gives Code Test. The critic relaxes exponentially toward the ball of radius Code Test.

We can also solve the Chapter 0 critic equation directly. For frozen Code Test, the equation Code Test has the explicit solution

Code Test

Since Code Test, the decay rate is at least Code Test, consistent with the general energy estimate.

Takeaway. The critic is controlled by the coercivity constant Code Test: the energy Code Test decays exponentially toward the level Code Test, with rate at least Code Test. This prevents the critic from blowing up and identifies the level Code Test toward which the critic norm decays. The absorbing radius Code Test is then chosen strictly above that level — Chapter 2 fixes Code Test — as Section 4.4 explains.

4.4 The Compact Absorbing Set

Propositions 4.1, 4.2, and 4.4 together confine the three groups of variables: the actor stays in Code Test, the distribution stays in Code Test, and the critic norm decays toward Code Test. We now combine these results to build a single compact absorbing set for the entire system. In the Chapter 0 example, this set was Code Test; we now construct its general counterpart.

Recall the definitions from Chapter 1. A set Code Test is forward invariant if Code Test for every Code Test: trajectories starting in Code Test stay in Code Test. A set Code Test absorbs a subset Code Test if there exists a time Code Test such that Code Test for all Code Test: every trajectory from Code Test eventually enters Code Test and never leaves. A compact absorbing set is one that is compact, forward invariant, and absorbs every bounded subset of Code Test.

Choosing the absorbing radius. The energy estimate (Proposition 4.4) shows that Code Test decays toward Code Test. For the absorbing set to work, we need a radius Code Test that is strictly larger than Code Test, so that there is a gap between the ultimate critic bound and the boundary of the ball. This gap is what makes absorption work in finite time: trajectories that start with large Code Test need time to decay into the ball, and the strict inequality ensures they eventually get inside.

We use the radius fixed in Chapter 2:

Code Test

The definition gives both Code Test and Code Test, so the gap satisfies

Code Test

The lower guard Code Test in the maximum is not decoration. The model permits Code Test — for instance, when all rewards vanish — and in that case the unguarded candidate Code Test would close the gap entirely: the ball Code Test is forward invariant, but the energy Code Test only decays toward zero and never reaches it, so no bounded set would be absorbed in finite time. The guard keeps the gap at least Code Test no matter how small Code Test is.

With this radius, define

Code Test

In the statement and proof below, Code Test denotes the solution map, used for all Code Test in anticipation of Proposition 4.6: the a priori bounds of Propositions 4.1, 4.2, and 4.4 hold on every interval of existence, and Proposition 4.6 uses only those bounds — not Proposition 4.5 — to show that every solution is global, so there is no circularity.

Proposition 4.5 (Compact forward invariant absorbing set). The set Code Test is compact and forward invariant under the semiflow. Moreover, Code Test absorbs every bounded subset of Code Test: for every bounded set Code Test, there exists Code Test such that Code Test for all Code Test.

Proof. The proof has three parts: compactness, forward invariance, and absorption.

Compactness. The actor box Code Test is compact. The closed ball Code Test is compact (closed and bounded in finite dimensions). The simplex Code Test is compact (closed and bounded). The product of finitely many compact sets is compact, so Code Test is compact.

Forward invariance. Let Code Test, and let Code Test be the solution from this initial condition. By Proposition 4.1, Code Test for all Code Test. By Proposition 4.2, Code Test for all Code Test. By Proposition 4.4,

Code Test

Since Code Test and Code Test, we have Code Test and Code Test, so

Code Test

Therefore Code Test for all Code Test, and Code Test. Since this holds for every initial condition in Code Test, the set Code Test is forward invariant.

Absorption. Let Code Test be bounded, and define Code Test. We need to find Code Test such that Code Test for all Code Test and all initial conditions in Code Test. (The actor and distribution coordinates are already confined to Code Test and Code Test by Propositions 4.1 and 4.2, so the only issue is the critic.)

By the energy estimate,

Code Test

We want this to be at most Code Test. Since Code Test, we need

Code Test

This holds for all Code Test, where

Code Test

where the maximum is taken before the logarithm. (If Code Test, then Code Test and Code Test is already inside the absorbing ball.) For Code Test, every trajectory from Code Test satisfies Code Test, and therefore Code Test. Code Test

Verification in the Chapter 0 example. In Chapter 0 the three invariance results combine into a single absorbing set; we now check the gap and the absorption time for an exterior trajectory. With Code Test and Code Test, the radius is Code Test, and the absorbing set is

Code Test

The gap is Code Test.

For a trajectory starting at Code Test, the absorption time is

Code Test

After time Code Test, the energy estimate guarantees Code Test, so Code Test. The trajectory has entered the absorbing set.

For a trajectory starting at Code Test, we have Code Test, so Code Test: the trajectory is inside the absorbing ball from the start.

Takeaway. The compact absorbing set Code Test combines the three confinement mechanisms: actor damping, simplex convexity, and critic coercivity. Every bounded orbit eventually enters Code Test and stays there. The entry time depends only on the initial critic norm and the gap Code Test.

4.5 Global Existence and the Semiflow

With the absorbing set in hand, we can close the argument that Chapter 3 left open: the maximal existence time is infinite for every initial condition in Code Test, and the solution map defines a continuous semiflow.

Proposition 4.6 (Global well-posedness). For every initial datum Code Test, system (L1) has a unique global solution

Code Test

with values in Code Test. The solution map

Code Test

defines a continuous semiflow in the sense of Definition 1.1.

Proof. Fix an initial datum Code Test. By the Picard-Lindelöf theorem (Proposition 3.6 and its blow-up alternative), the system has a unique maximal solution on Code Test, and if Code Test, the solution leaves every compact set.

By Propositions 4.1 and 4.2, the actor and distribution remain in Code Test and Code Test for all Code Test. By the “in particular” bound in Proposition 4.4, the critic satisfies

Code Test

Therefore the entire trajectory remains in the compact set

Code Test

The blow-up alternative from Picard-Lindelöf (Proposition 3.6) states: if Code Test, the solution must leave every compact subset of the ambient space as Code Test. But the trajectory stays in the compact set Code Test, which is a contradiction. Therefore Code Test.

The semiflow properties — Code Test, Code Test, and continuous dependence on initial data — follow from the uniqueness part of the Picard-Lindelöf theorem and the global existence we have just established. The semigroup property Code Test holds because the system is autonomous: the vector field does not depend on time, so restarting from Code Test and running for time Code Test gives the same result as running from Code Test for time Code Test. Continuous dependence on initial data is part of the Picard-Lindelöf theorem and extends to all Code Test because the solution remains in a compact set. Code Test

This completes the construction that Chapters 1 and 3 set up. System (L1) generates a continuous semiflow Code Test, with the compact absorbing set Code Test from Proposition 4.5. We now have every ingredient that Definition 1.3 required for an absorbing set: Code Test is compact, forward invariant, and absorbs every bounded subset of Code Test.

The semiflow and its absorbing set are the starting point for Chapter 5, where we will extract the global attractor — the smallest compact set that captures the long-time behavior of every trajectory.

4.6 Summary and Bridge Forward

This chapter has established the a priori estimates that make system (L1) globally well-posed and dissipative. The main results are:

  • Actor-box invariance (Proposition 4.1). The damping matrix Code Test vanishes at the boundary of Code Test, and the arctanh barrier argument shows that no interior trajectory can reach the boundary in finite time. Boundary trajectories stay on the boundary forever. The actor parameter is confined to Code Test for all time.

  • Simplex invariance (Proposition 4.2). The variation-of-constants solution of the law equation expresses Code Test as a convex combination of simplex elements with nonnegative coefficients summing to one. The distribution stays in Code Test for all time.

  • Critic coercivity (Propositions 4.3 and 4.4). The coercivity constant Code Test gives a uniform lower bound on the symmetric part of the critic matrix. The raw energy inequality Code Test from Proposition 4.4 exposes the quadratic structure Code Test; after Young’s inequality the resulting energy estimate shows that Code Test decays exponentially toward Code Test, with rate at least Code Test.

  • Compact absorbing set (Proposition 4.5). The set Code Test is compact, forward invariant, and absorbs every bounded subset of Code Test, with an explicit absorption time that depends on the initial critic norm.

  • Global well-posedness (Proposition 4.6). The a priori bounds prevent blow-up, extending the local semiflow of Chapter 3 to all positive time. The solution map Code Test is a continuous semiflow.

In the Chapter 0 example, these results recover the absorbing set Code Test with Code Test, Code Test, and Code Test.

The system now has everything needed for the next step: a continuous semiflow on a metric phase space with a compact absorbing set. What we do not yet have is the global attractor — the smallest compact invariant set that attracts every bounded subset. Extracting the attractor from the absorbing set requires one more ingredient (asymptotic compactness or, in finite dimensions, the simpler fact that a continuous map on a compact set has a compact omega-limit set). That construction is the subject of Chapter 5.

Exercises

Exercise 4.1 (Scalar barrier argument at the boundary). In the Chapter 0 model, carry the scalar barrier argument for the actor at Code Test. Specifically:

(a) Write the actor ODE at the boundary: show that Code Test and that the right-hand side is zero when Code Test.

(b) Define Code Test. Show that Code Test.

(c) Conclude that if Code Test, then Code Test for all Code Test.

Exercise 4.2 (Direct simplex check). In the Chapter 0 model, verify directly (without using the variation-of-constants formula) that the law equation preserves total mass.

(a) Write the full two-component law equation: Code Test and Code Test.

(b) Show that Code Test, so that Code Test is constant.

(c) Show that if Code Test, then the variation-of-constants formula gives Code Test for all Code Test.

Exercise 4.3 (Coercivity constants). In the Chapter 0 model:

(a) Verify that the critic matrix is Code Test and that Code Test.

(b) Verify that the forcing is Code Test and that Code Test.

(c) Solve the energy inequality Code Test explicitly. Verify that the solution is Code Test.

(d) For Code Test, compute the smallest time Code Test such that Code Test.

Exercise 4.4 (Absorbing-set entry time). In the Chapter 0 model with Code Test:

(a) Compute the gap Code Test.

(b) For a trajectory starting at Code Test, compute the absorption time Code Test.

(c) Verify numerically that the energy estimate gives Code Test.

Exercise 4.5 (What happens without coercivity). Set Code Test in the critic matrix, so that Code Test.

(a) Give an example of critic features Code Test in Code Test for which the resulting matrix Code Test is not invertible. (Hint: choose all features to point in the same direction.)

(b) Explain why the energy estimate breaks down when Code Test. What specific step in the proof of Proposition 4.4 fails?

(c) Describe qualitatively what could happen to the critic trajectory Code Test without the coercivity bound.

Exercise 4.6 (Removing the damping). Replace the damping function Code Test with Code Test (constant damping, equivalent to no damping).

(a) Is the resulting vector field still locally Lipschitz?

(b) Does local existence still hold?

(c) Explain why actor-box invariance fails. Construct a specific scenario in the Chapter 0 model where Code Test escapes Code Test in finite time. (Hint: if the raw drift Code Test has a definite sign near the boundary, there is nothing to stop Code Test from crossing it.)

Exercise 4.7 (Absorbing set under parameter changes). The absorbing set Code Test depends on the data through Code Test, Code Test, and Code Test.

(a) If we shrink the actor-box radius Code Test (keeping all other data fixed), does the absorbing radius Code Test change? Why or why not?

(b) If we increase Code Test (stronger regularization), what happens to Code Test? Note what happens once Code Test drops below Code Test.

(c) Explain why increasing Code Test makes the system “more dissipative” and leads to faster absorption.

Exercise 4.8 (Nonlinear critic). Suppose the critic equation were nonlinear: Code Test, where Code Test is a smooth map satisfying Code Test for some Code Test and all Code Test large enough.

(a) Can you still derive an energy estimate of the form Code Test for large Code Test?

(b) Does the absorbing-set construction still work? What is the main difference from the linear case?

(c) Explain why the linear structure of the critic in system (L1) gives a cleaner estimate than the nonlinear alternative.