Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Euclidean balls are bounded C-one domains with radial outward normal

Statement

Assume Countable Choice. In this item use one-based labels ej:=ej−1can for 1≤j≤n. Let n≥2, a∈Rn and R>0. The open ball BR(a)={x∈Rn:∣x−a∣<R} is a bounded C1 domain in the sense of Bounded C1 domains and their outward normals, and for every boundary point y∈∂BR(a)=SR(a) its outward unit normal is the radial vector ν(y)=(y−a)/R.

Facts & Assumptions

Given: an integer n≥2, a centre a∈Rn and a radius R>0; write Ω:=BR(a).

[A1]

Countable Choice is assumed, as in the published surface-integration convention used in [F1] (The Axiom of Countable Choice (ACω)).

[F1]

A bounded C1 domain is a nonempty bounded open set whose boundary is locally, after a rigid change of coordinates with orthogonal part Q, the graph t=h(y) of a C1 function h on an open ball B⊆Rn−1, with the domain locally exactly the subgraph t<h(y); the outward normal in these coordinates is (−Dh(y),1)/1+∣Dh(y)∣2, transported by the orthogonal coordinate map (Bounded C1 domains and their outward normals).

[F2]

For c∈Rn and r>0, B‾2(c,r)={x:∣x−c∣≤r} and S2(c,r)={x:∣x−c∣=r} are the Euclidean closed ball and the Euclidean sphere (Euclidean spheres and closed balls as subspaces of Rn).

[F3]

For every subspace W of a finite-dimensional inner product space V, dim⁡W+dim⁡W⊥=dim⁡V (In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V).

[F4]

Every finite-dimensional real or complex inner product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[F5]

If (e0,…,er−1) is an orthonormal basis of an inner product space, then v=∑i<r⟨v,ei⟩ei and ∥v∥2=∑i<r∣⟨v,ei⟩∣2 for every vector v (Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis).

[F6]

For α∈R the function x↦xα is continuous and differentiable on (0,∞) with derivative αxα−1 (Continuity and derivatives of positive-base real powers).

[F7]

D(g∘f)(p)=Dg(f(p))∘Df(p) when f is totally differentiable at p and g is totally differentiable at f(p) (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

technique · direct
1.1givenF2F3F4F5algebra

Fix a boundary point y∈SR(a) and put u:=(y−a)/R, so that ∣u∣=1 and y=a+Ru. By [F3] applied to W=span⁡(u) we have dim⁡u⊥=n−1, so [F4] supplies an orthonormal basis (v1,…,vn−1) of u⊥; then (v1,…,vn−1,u) is an orthonormal basis of Rn, because every ξ equals (ξ−⟨ξ,u⟩u)+⟨ξ,u⟩u with ξ−⟨ξ,u⟩u∈u⊥. Define the linear map T(ξ):=∑i=1n−1⟨ξ,vi⟩ei+⟨ξ,u⟩en; by [F5], ∣T(ξ)∣2=∑i<n∣⟨ξ,vi⟩∣2+∣⟨ξ,u⟩∣2=∣ξ∣2 for all ξ, so T is orthogonal, and orthonormality gives T(u)=en and T(vi)=ei.

2.1givenstep 1.1

Define the rigid motion Φ(p):=T(p−a)−Ren (orthogonal part T, translation −T(a)−Ren), the open cylinder C:=BR/2(0)×(−R/2,R/2), the open set W:=Φ−1(C) and the open ball B:=BR/2(0)⊆Rn−1; also put h(w):=R2−∣w∣2−R for w∈B. The point y lies in W, because Φ(y)=T(Ru)−Ren=0∈C; so W is an open neighbourhood of y. Moreover T(Ω−a)=T(BR(0))=BR(0) by orthogonality, so Φ(Ω)=BR(−Ren).

3.1givenstep 2.1algebra

For z=(w,t)∈C we have Φ−1(z)=p and T(p−a)=z+Ren, so by orthogonality ∣p−a∣2=∣z+Ren∣2=∣w∣2+(t+R)2. Thus z∈Φ(Ω) exactly when ∣w∣2+t2+2Rt<0. For ∣w∣<R/2, put s(w):=R2−∣w∣2; then s(w)>3R/2, so the quadratic inequality is equivalent to −R−s(w)<t<−R+s(w)=h(w). Its lower root satisfies −R−s(w)<−R/2<t, so it is automatic throughout C. Also −R/2<(3/2−1)R<h(w)≤0<R/2, so the graph lies inside the vertical interval of C. Therefore the local set equations are Φ(Ω∩W)=Φ(Ω)∩C={(w,t)∈B×(−R/2,R/2):−R−s(w)<t<h(w)}={(w,t)∈C:t<h(w)}.

3.2givenstep 2.1F6F7algebra

The polynomial q(w):=R2−∣w∣2 is positive on B and C1 there; by [F6] with α=1/2 the map s↦s1/2 is differentiable on (0,∞) with derivative 12s−1/2; the chain rule [F7] applied to h=q1/2−R therefore gives Dh(w)=−w/R2−∣w∣2 on B, a continuous expression, so h∈C1(B).

4.1givenstep 2.1step 3.1step 3.2A1F1

By steps 2.1, 3.1 and 3.2 the arbitrary boundary point y∈SR(a) has a neighbourhood W and a rigid motion Φ for which Φ(Ω∩W)={(w,t)∈C:t<h(w)}, where C=B×(−R/2,R/2) and h∈C1(B); thus the boundary is locally a C1 graph and the domain is locally exactly its subgraph. The set Ω is nonempty, bounded and open in Rn with n≥2. Applying the bounded-domain convention [F1] under [A1], Ω=BR(a) is a bounded C1 domain.

5.1givenstep 1.1step 3.2step 4.1A1F1algebra∎

In the coordinates z=(w,t) of step 3.1 the definition [F1] prescribes the outward normal (−Dh(w),1)/1+∣Dh(w)∣2 on the graph t=h(w); by step 3.2 this equals (w/R2−∣w∣2,1)R2−∣w∣2/R=(w,h(w)+R)/R, which at the graph point z=(w,h(w)) is exactly (z+Ren)/R; transporting back by the orthogonal part T gives the vector TT(z+Ren)/R. At y=a+Ru we have Φ(y)=0 and z+Ren=T(y−a), so the transported normal is TTT(y−a)/R=(y−a)/R, a unit vector because ∣y−a∣=R. Thus the normal prescribed by [F1] under [A1] is ν(y)=(y−a)/R for every y∈SR(a).

Depends on

Used by

Dependency tree · two levels

37 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources