How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A ray trapped between two convex obstacles
PDF p. 3: Figure 1(c) and caption; PDF p. 22: §5.2(E)
Example
Let and let be disjoint nonempty compact strictly convex bodies with smooth boundaries. A convex body is a compact convex set with nonempty interior; strict convexity means that the open segment between distinct points of the body lies in its interior. Put and , and suppose is connected. Choose with and let . In the reflected-ray convention of Independent generalized reflected-ray and GCC convention, there is a complete periodic ray between the obstacles that stays in . Consequently fails the geometric control condition for every , and fails the non-trapping condition of Non-trapping obstacle.
Facts & Assumptions
The geometric convention of Exterior and truncated obstacle domains supplies the exterior, smooth boundary and enclosing-ball terminology. The sets in the example are compact and disjoint, and their exterior is assumed connected.
By Independent generalized reflected-ray and GCC convention, a ray follows a straight unit-speed characteristic in the Euclidean interior and, at a hyperbolic reflection, its tangential covector is preserved while its normal covector reverses. The same supplier defines the geometric control condition as every ray meeting the observation region within the specified time.
By Non-trapping obstacle, non-trapping requires every complete generalized ray to leave each compact subset of Euclidean space in finite forward time.
For nonempty compact disjoint subsets of a metric space, the second assertion of The distance from a point to a nonempty compact set is attained at a point of that set, and two disjoint compact sets are at positive distance gives a point with . Its first assertion then gives a point with . Both assertions apply to the Euclidean metric and require no choice principle.
Convexity has the meaning of A convex subset of ℝᵐ contains every line segment between two of its points: a subset contains whenever and . This is the convex-set convention in the definition of a convex body in the Example.
Assertion 2 of Every convex subset of ℝⁿ, in particular every ball and ℝⁿ itself, is path-connected and hence connected states that every ball for the Euclidean norm is convex. It applies to because and ; no path-connectedness conclusion is needed here.
By A constrained local extremum annihilates every velocity of a differentiable parametrization, if a differentiable scalar function and a curve differentiable at satisfy and has a local extremum at , then . The two-sided parameter interval makes an interior point.
The chain rule of The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a) applies to the smooth graph functions in [F1] and differentiable curves in their open coordinate domains. In particular it differentiates and the inverse rigid motion used below.
Assertion 1 of Heine-Borel in ℝⁿ: with the Euclidean metric a subset of ℝⁿ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line makes every closed bounded coordinate box in Euclidean , , compact, without a choice principle. Apply it below to with .
Verification
Given: The two bodies, exterior and observation region in the example.
Goal: Construct a bounded periodic reflected ray and establish the stated failures.
Equip with the Euclidean metric . Apply the second assertion in [F4] to the nonempty compact disjoint sets to obtain with . Apply its first assertion to the point and the nonempty compact set to obtain with . Thus the pair minimizes the distance between the bodies, and . Both points lie on their respective boundaries: otherwise moving an interior point a short distance toward the other point would decrease the distance. The open segment from to meets neither body, since any point of it in either body would give a strictly shorter distance to the other endpoint.
For each of the two endpoint pairs and , use a smooth boundary chart from [F1], writing its rigid motion as with orthogonal and . For the curve lies in that boundary for all sufficiently small , since the chart domains are open. It has and velocity by [F8]. These velocities give exactly the boundary tangent hyperplane: any differentiable boundary curve through has chart coordinates , whose derivative has this form by [F8], and each such vector is realized by . For , the identity gives . By step 1.1, has a minimum at the interior parameter . Thus [F7] gives for every . Consequently is perpendicular to both boundary tangent hyperplanes.
Put and . For every integer , define on and on . These formulas agree at their endpoints and define a continuous -periodic path on all of . On the open segments use temporal covector and spatial covector or , respectively. Incidence at each endpoint is normal and nonzero, so [F2] reverses the normal covector and preserves the zero tangential covector. Compression identifies the incoming and outgoing endpoints. The reflection times form a discrete subset of ; away from them the characteristic is a straight unit-speed segment. Thus this is a complete admissible periodic ray in exactly the supplier convention, with image . Both endpoints lie in ; by [F6] this ball is convex, and by [F5] the whole segment therefore lies there. The box is compact by [F9] and contains , since for every coordinate of . Hence the whole ray lies in . The ray never meets , so GCC fails for every by [F2]; it never leaves that compact set, so non-trapping fails by [F3].
Source notes
Figure 1(c) of the article attributes the obstruction to a ray bouncing between two strictly convex obstacles. Its introduction and §5.2(E) separately report linear outer-boundary controllability with a loss of derivatives for certain trapping configurations under additional geometric assumptions, citing Burq and Burq–Zworski. That reported comparison is not used in the verification above, and is not asserted here for every pair of obstacles.
Depends on
- Exterior and truncated obstacle domains
- Non-trapping obstacle
- Independent generalized reflected-ray and GCC convention
- The distance from a point to a nonempty compact set is attained at a point of that set, and two disjoint compact sets are at positive distance
- A convex subset of ℝᵐ contains every line segment between two of its points
- Every convex subset of ℝⁿ, in particular every ball and ℝⁿ itself, is path-connected and hence connected
- A constrained local extremum annihilates every velocity of a differentiable parametrization
- The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
- Heine-Borel in ℝⁿ: with the Euclidean metric a subset of ℝⁿ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.
Sources
- Nonlinear Schrödinger equation in an exterior domain, v2 · PDF page 3, Figure 1(c) and caption; page 2, section 1.2, first paragraph; page 22, section 5.2(E)