Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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 great sphere is totally geodesic

Statement

Assume ACω. Let n≥1 and 0≤k≤n, set V=Rk+1×{0}⊆Rn+1, and regard

Sk=Sn∩V

as an equatorial subsphere with the induced round metric. Then Sk⊆Sn is totally geodesic. The countable-choice assumption is inherited exactly through the general induced-connection, normal-projection, and shape-operator interfaces.

Facts & Assumptions

Given: ACω, n≥1, 0≤k≤n, and the standard equatorial inclusion of unit round spheres.

[F1]

Countable choice permits a choice from every sequence of nonempty sets. The Axiom of Countable Choice (ACω).

[F2]

A regular level set is an embedded submanifold whose tangent space is the kernel of the defining differential. A regular level set is an embedded submanifold, The tangent space of a regular level set is the kernel.

[F3]

The Christoffel formula and the connection Leibniz rule compute the Euclidean Levi–Civita connection in Cartesian coordinates. Christoffel formula for the levi civita connection, Connection laws in directional form.

[F4]

For an embedded Riemannian submanifold, its intrinsic Levi–Civita connection is the tangential projection of the ambient one. The induced connection is Levi–Civita.

[F5]

The Weingarten identity is ⟨SνX,Y⟩=⟨II(X,Y),ν⟩. Weingarten equation and adjointness of the shape operator.

[F6]

An embedded Riemannian submanifold is totally geodesic exactly when its second fundamental form vanishes. Totally geodesic submanifold.

Verification

technique · compute the shape operators in constant normal directions
1.1F2givenalgebra

On Rr+1 the function q(z)=⟨z,z⟩ has differential dqz(w)=2⟨z,w⟩, which is nonzero on q−1(1). Thus [F2] makes each Sr an embedded boundaryless hypersurface with TxSr=x⊥. Consequently at x∈Sk one has TxSk=V∩x⊥⊆TxSn, the equatorial inclusion is embedded with the usual induced round metric, and its normal space inside TxSn is exactly V⊥: this subspace lies in x⊥, is orthogonal to V∩x⊥, and has the required dimension n−k.

2.1F3F4step 1.1algebra

For each standard basis vector a∈{ek+2,…,en+1}⊆V⊥, define the smooth tangent field A(y)=a−⟨a,y⟩y on Sn. Along Sk one has ⟨a,x⟩=0, so A(x)=a and this restriction is a normal field to Sk inside Sn by step 1.1. For X∈TxSk⊆V, Cartesian differentiation gives DXA=−⟨a,X⟩x−⟨a,x⟩X=0. By [F3]–[F4], ∇‾XSnA=(DXA)⊤=0. Hence the shape operator for Sk⊆Sn is SaX=−(∇‾XSnA)⊤=0.

3.1F5F6step 1.1step 2.1algebra

For tangent vectors X,Y, [F5] and step 2.1 give ⟨II(X,Y),a⟩=⟨SaX,Y⟩=0 for every displayed basis vector a of V⊥. By step 1.1 the vector II(X,Y) itself lies in V⊥, so it is zero. Thus II=0, and [F6] proves that Sk is totally geodesic in Sn.

4.1F1F2F3F4F5F6step 1.1step 2.1step 3.1∎

Every admitted sphere is nonempty. For k=0, its tangent bundle is zero and the calculation makes II the zero bilinear form. For k=n, the displayed normal basis is empty and the normal bundle has rank zero, so II=0 automatically. The proof includes k=1 and all other intermediate dimensions; the round metrics are positive definite and both manifolds are boundaryless. Only the finite, explicitly displayed normal basis is used. The stated ACω is inherited through [F2], [F4]–[F6], and the calculation adds no choice. There is no interval, endpoint, or biconditional claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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