Ported for Lean Pool: imports relocated and code adapted to Lean/Mathlib v4.34.0.
Basic half-relaxed limit definitions and estimates #
This file contains the definitions of upper and lower half-relaxed limits and basic estimates derived from the limsup and liminf definitions.
The product filter used in the definition of half-relaxed limits.
Membership in this product filter means the following: a set of pairs contains
A × V for some A ∈ l and some V ∈ nhdsWithin x C. Thus the index is
restricted by the filter l, while the spatial variable is restricted to a
relative neighborhood of x in C.
Equations
- ViscositySolns.halfRelaxedFilter l C x = l ×ˢ nhdsWithin x C
Instances For
If uᵢ q.1 q.2 = vᵢ q.1 q.2 for all pairs q = (i, y) in some member of
halfRelaxedFilter l C x, then the two upper half-relaxed limits at x
are equal.
If uᵢ q.1 q.2 = vᵢ q.1 q.2 for all pairs q = (i, y) in some member of
halfRelaxedFilter l C x, then the two lower half-relaxed limits at x
are equal.
If the set of indices i for which uᵢ i and vᵢ i agree at every point
of C belongs to l, then the two upper half-relaxed limits at x are
equal.
If the set of indices i for which uᵢ i and vᵢ i agree at every point
of C belongs to l, then the two lower half-relaxed limits at x are
equal.
Assume the set of indices i such that
∀ y ∈ C, uᵢ i y <= vᵢ i y belongs to l. Under the boundedness hypotheses
needed to evaluate real-valued limsup, the upper half-relaxed limit of uᵢ
at x is at most the upper half-relaxed limit of vᵢ at x.
Assume the set of indices i such that
∀ y ∈ C, uᵢ i y <= vᵢ i y belongs to l. Under the boundedness hypotheses
needed to evaluate real-valued liminf, the lower half-relaxed limit of uᵢ
at x is at most the lower half-relaxed limit of vᵢ at x.
Events for the half-relaxed product filter at x remain events for the
half-relaxed product filter at all nearby points z ∈ C.
More explicitly: if S ∈ l ×ˢ nhdsWithin x C, then the set of points
z such that S ∈ l ×ˢ nhdsWithin z C belongs to nhdsWithin x C.
Upper semicontinuity of the upper half-relaxed limit, with the boundedness
hypotheses needed by real-valued limsup.
Lower semicontinuity of the lower half-relaxed limit, with the boundedness
hypotheses needed by real-valued liminf.
Compact upper bound from strict upper half-relaxed bounds.
Assume E is compact, E ⊆ C, and
upperHalfRelaxedLimit uᵢ l C x < a for every x ∈ E. Then for every
b > a, the set of indices i for which uᵢ i y < b for all y ∈ E
belongs to l.
Compact lower bound from strict lower half-relaxed bounds.
Assume E is compact, E ⊆ C, and
a < lowerHalfRelaxedLimit uᵢ l C x for every x ∈ E. Then for every
b < a, the set of indices i for which b < uᵢ i y for all y ∈ E
belongs to l.
If the upper half-relaxed limit satisfies
upperHalfRelaxedLimit uᵢ l C x - φ x < a, then the approximating values
uᵢ i y - φ y satisfy the following filter statement for every b > a:
the set of pairs (i, y) such that uᵢ i y - φ y < b belongs to
halfRelaxedFilter l C x.
If the lower half-relaxed limit satisfies
a < lowerHalfRelaxedLimit uᵢ l C x - φ x, then the approximating values
uᵢ i y - φ y satisfy the following filter statement for every b < a:
the set of pairs (i, y) such that b < uᵢ i y - φ y belongs to
halfRelaxedFilter l C x.
Compact upper bound for uᵢ - φ from strict upper half-relaxed test bounds.
Assume E is compact, E ⊆ C, and
upperHalfRelaxedLimit uᵢ l C x - φ x < a for every x ∈ E. If a < b,
then the set of indices i for which uᵢ i y - φ y < b for all y ∈ E
belongs to l.
Compact lower bound for uᵢ - φ from strict lower half-relaxed test bounds.
Assume E is compact, E ⊆ C, and
a < lowerHalfRelaxedLimit uᵢ l C x - φ x for every x ∈ E. If b < a,
then the set of indices i for which b < uᵢ i y - φ y for all y ∈ E
belongs to l.
If a < upperHalfRelaxedLimit uᵢ l C x, then every member of
halfRelaxedFilter l C x intersects the set of pairs (i, y) satisfying
a < uᵢ i y.
If lowerHalfRelaxedLimit uᵢ l C x < a, then every member of
halfRelaxedFilter l C x intersects the set of pairs (i, y) satisfying
uᵢ i y < a.
For every ε > 0, every set of indices A with A ∈ l, and every
V ∈ nhdsWithin x C, there exist i ∈ A and y ∈ V such that
upperHalfRelaxedLimit uᵢ l C x - ε < uᵢ i y.
For every ε > 0, every set of indices A with A ∈ l, and every
V ∈ nhdsWithin x C, there exist i ∈ A and y ∈ V such that
uᵢ i y < lowerHalfRelaxedLimit uᵢ l C x + ε.
After subtracting a continuous test function, the approximating family
has the following lower selection property: for every ε > 0, every member
of halfRelaxedFilter l C x intersects the set of pairs (i, y) satisfying
upperHalfRelaxedLimit uᵢ l C x - φ x - ε < uᵢ i y - φ y.
After subtracting a continuous test function, the approximating family
has the following upper selection property: for every ε > 0, every member
of halfRelaxedFilter l C x intersects the set of pairs (i, y) satisfying
uᵢ i y - φ y < lowerHalfRelaxedLimit uᵢ l C x - φ x + ε.
For every ε > 0, every set of indices A with A ∈ l, and every
V ∈ nhdsWithin x C, there exist i ∈ A and y ∈ V such that
upperHalfRelaxedLimit uᵢ l C x - φ x - ε < uᵢ i y - φ y.
For every ε > 0, every set of indices A with A ∈ l, and every
V ∈ nhdsWithin x C, there exist i ∈ A and y ∈ V such that
uᵢ i y - φ y < lowerHalfRelaxedLimit uᵢ l C x - φ x + ε.