Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Unit-speed confinement before an artificial outer boundary

Statement

Assume Countable Choice and Dependent Choice. Let d≥2, 0≤T<∞, and let Ω⊂Rd be an open set with smooth one-sided boundary charts. For any time-parametrized unit-speed generalized ray with spatial projection x:[0,T]→Ω‾, one has ∣x(t)−x(s)∣≤∣t−s∣ for all s,t∈[0,T]. Thus, for R>0, ∣x(0)∣≤R implies ∣x(t)∣≤R+t.

For the truncation conclusion, suppose additionally that Θ is a smooth compact obstacle, meaning the closure of a nonempty bounded open set with smooth one-sided boundary, that Ω=Rd∖Θ, and that Θ⊂BR(0), where Br(0)={y∈Rd:∣y∣<r}. If ∣x(0)∣≤R and L>R+T, the same segment, with its compressed covectors, is a generalized ray of the smooth bounded open truncation D=BL(0)∖Θ and never touches its artificial sphere ∂BL(0). Neither non-trapping nor uniqueness at infinite-order contact is required.

Facts & Assumptions

[F1]

The local ray rules and the continuous compressed projection are those of Independent generalized reflected-ray and GCC convention. Away from isolated reflection parameters the curve follows the interior or glancing Hamilton rule. At a reflection its two interior one-sided phase limits have a common base point. Time normalization gives unit spatial speed in each rule.

[F2]

Smooth one-sided boundary charts use Bounded Ck domains and boundary charts for every finite k. This is its local graph convention; the unbounded Ω is not asserted to be a bounded domain. Euclidean balls and spheres use Open ball, closed ball and sphere in a metric space.

[F3]

Scalar absolute continuity is the finite disjoint-interval condition of Absolute continuity on a compact interval. The integral representation and almost-everywhere derivative for an absolutely continuous scalar function are supplied by Fundamental theorem of calculus for absolutely continuous functions, under The Axiom of Countable Choice (AC_ω) and The axiom of dependent choice: a relation in which every element is related to something admits an ℕ-indexed chain. These choice assumptions are retained precisely for that theorem; no necessity claim is made.

[F4]

A continuous real function on a closed interval attains a minimum, by Continuous functions on a closed interval attain their extrema.

Proof

Given: A prescribed unit-speed generalized ray on [0,T], and, for truncation, the additional obstacle geometry. Goal: The distance estimate, radial confinement, and identification of the segment on D.

1.1givenF1

The base projection x is continuous by the compressed-ray convention. At a nonreflection time, the time-normalized Hamilton rule gives a spatial derivative of norm one: in the interior this is the Euclidean velocity, and at glancing the characteristic covector is tangent and its tangential Hamilton velocity has norm one. This also applies at infinite-order glancing. At an isolated reflection time, the ray is interior on each adjacent interval; its one-sided phase limits give one-sided unit spatial velocities. Consequently, for each unit vector e∈Rd, the continuous real function fe(t)=e⋅x(t) has a right derivative at every t<T, with ∣(fe)+′(t)∣≤1. The endpoint right derivative uses the same local rule.

1.2givenF2

Under the additional obstacle hypotheses, D=BL(0)∖Θ is open and bounded because Θ is closed. Its boundary is ∂Θ∪∂BL(0): near ∂Θ it agrees with the exterior since Θ⊂BR(0) and R<L, while near ∂BL(0) the obstacle is absent. At a point on neither of these boundaries, a sufficiently small neighborhood lies entirely on a fixed side of each set, so no further boundary points occur. The two boundary components are disjoint and smooth; the obstacle charts are the original one-sided charts with the exterior side chosen, and the sphere has smooth one-sided graph charts. Thus D has the required smooth boundary.

2.1F3F4step 1.1

First obtain absolute continuity without assuming that a compact time interval has only finitely many reflections. Fix 0≤a<b≤T and put f=fe. If f(b)−f(a)>2(b−a), then the continuous function g(u)=f(u)−2u satisfies g(b)>g(a). Its attained minimum on [a,b] therefore occurs at some c<b. All sufficiently small positive right difference quotients of g at c are nonnegative, whereas g+′(c)=f+′(c)−2≤−1, a contradiction. Apply the same argument to −f to obtain ∣f(b)−f(a)∣≤2(b−a). For any finite family of intervals with disjoint interiors, ∑j∣f(vj)−f(uj)∣≤2∑j(vj−uj); choosing δ=ε/2 proves scalar absolute continuity. On a singleton interval the increments vanish.

3.1givenF3step 1.1step 2.1

Apply the absolute-continuity fundamental theorem to fe on [s,t] when s<t. Wherever its ordinary derivative exists, it equals its right derivative, so ∣fe′∣≤1 almost everywhere. Hence ∣e⋅(x(t)−x(s))∣≤∫st∣fe′(r)∣ dr≤t−s. If x(t)≠x(s) choose e=(x(t)−x(s))/∣x(t)−x(s)∣ to obtain ∣x(t)−x(s)∣≤t−s; otherwise the inequality is immediate. Interchanging the endpoints handles t<s. The triangle inequality now gives ∣x(t)∣≤∣x(0)∣+t≤R+t.

4.1givenF1F2step 3.1step 1.2∎

By step 3.1, ∣x(t)∣≤R+t≤R+T<L. At every point visited by the segment, choose a neighborhood lying inside BL(0); on this neighborhood D and Ω agree. The Euclidean wave symbol, the local compression map, and all interior, reflected and glancing rules are therefore identical in these two domains. Keep the original compressed curve in these identical local charts. It satisfies the generalized-ray rules in D on the entire segment and cannot meet ∂BL(0). This is an identification of a prescribed curve, so neither a global continuation theorem nor uniqueness is used.

Depends on

Used by · 2

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.