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.

Adapted norm balls are ordinary Euclidean neighbourhoods

Statement

Let m be a nonnegative integer, let p∈Rm, let N be any norm on Rm, and let ρ>0. Write ∣⋅∣2 for the Euclidean norm and d2(y,z)=∣y−z∣2 for its metric. The set BN(0,ρ)={y∈Rm:N(y)<ρ} is an open Euclidean neighbourhood of zero. Its translate p+BN(0,ρ)={p+y:y∈BN(0,ρ)} is an open Euclidean neighbourhood of p.

The following specifies the shrinking assertion for orbit trapping. Let B be either of these two neighbourhoods, let B′⊆B, let X be a set, let Φn:X→Rm be maps for every integer n≥0, and let W⊆X. If, for every x∈X, the condition Φn(x)∈B for every n≥0 implies x∈W, then the condition Φn(x)∈B′ for every n≥0 also implies x∈W. In particular, B may be replaced by any smaller open neighbourhood of its centre in such an implication.

Facts & Assumptions

[F1]

For m≥1, norm equivalence gives constants c,C>0 with c∣y∣2≤N(y)≤C∣y∣2 for every y∈Rm For n ≥ 1 all norms on ℝⁿ are equivalent.

[F2]

The norm axioms give N(0)=0 and the induced metric dN(y,z)=N(y−z) A norm on a real vector space, the induced metric, and the dictionary with the metric axioms. The reverse triangle inequality gives ∣N(y)−N(z)∣≤N(y−z) The reverse triangle inequality in a normed space.

[F3]

The Euclidean norm is ∣y∣2=(∑k<myk2)1/2, also when m=0, in which case its value is zero The p-norms ‖ x‖ₚ for rational p ≥ 1, and ‖ x‖_∞. It is a norm for every m≥0; for m≥1 its induced metric is the usual Euclidean metric Each ‖·‖ₚ is a norm on ℝⁿ, and the induced metrics are exactly d₁, d₂ and d_∞ of the published metric-spaces page.

[F4]

A metric ball is Bd(a,r)={z:d(a,z)<r} for r>0 Open ball, closed ball and sphere in a metric space. A set is open when every point has a positive-radius metric ball inside it; an open neighbourhood of a is an open set containing a The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement.

Proof

Given: The dimension, norm, radius, point, sets and family of maps specified in the Statement.

Goal: Prove both neighbourhood assertions and the quantified shrinking implication.

1.1givenF1F2F3F4

Suppose m≥1. By the reverse triangle inequality and the upper estimate in [F1], ∣N(y)−N(z)∣≤N(y−z)≤C∣y−z∣2. For each y∈BN(0,ρ) set ε=(ρ−N(y))/C>0. If d2(z,y)<ε, then N(z)≤N(y)+C∣z−y∣2<ρ. Thus Bd2(y,ε)⊆BN(0,ρ), proving openness by [F4]. Also N(0)=0<ρ, and ∣z∣2<ρ/C implies N(z)<ρ, so this is an open neighbourhood of zero containing Bd2(0,ρ/C).

2.1givenF2F3F4step 1.1

For m≥1, translation satisfies d2(p+z,p+y)=∣(p+z)−(p+y)∣2=∣z−y∣2=d2(z,y). Hence the ball about y constructed in step 1.1 translates to a Euclidean ball about p+y inside p+BN(0,ρ); that set is open and contains p. For m=0, R0={0}, p=0, and N(0)=0<ρ, so both sets are the whole singleton space, which is open: each positive-radius metric ball about its only point is the singleton. Both neighbourhood assertions therefore also hold in dimension zero.

3.1given∎

Fix x∈X such that Φn(x)∈B′ for every integer n≥0. For each such n, the inclusion B′⊆B gives Φn(x)∈B. The assumed implication for B therefore gives x∈W. This holds for every x∈X and every subset B′⊆B, including every smaller open neighbourhood of the centre. For an orbit-trapping application, take Φn(x) to be the nth forward iterate on a set X where all these iterates are defined.

Depends on

Used by · 1

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.