Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
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.

Temporal normal angle and compact positive-height portions

Definition

Work in ZFC on a smooth time-oriented Lorentzian four-manifold of signature (−,+,+,+). Let g be its metric and Σ a smooth embedded spacelike maximal hypersurface, smooth up to its actual boundary ∂Σ, with future unit normal n. Maximal means its induced mean curvature vanishes.

Fix a compact ambient set Q, allowed to be empty, and let τ be a smooth real function on an open neighborhood of Σ∪Q. A compact positive-height portion is the entire set P=Σ∩{τ≥0}, assumed compact and contained in Q; it is not a clipping of Σ by Q. Require the metric gradient of τ to be past-directed timelike on an open neighborhood of P. On that temporal neighborhood put α=−g−1(dτ,dτ)>0 and V=−α−1grad⁡gτ, where grad⁡gτ is characterized by g(grad⁡gτ,Y)=dτ(Y) for every ambient tangent vector Y. Along the hypersurface in that neighborhood put v=−g(n,V). Thus V is future unit timelike and v is the temporal normal angle.

Write h=g∣TΣ. For a real function f smooth on an open subset of Σ, smooth up to any actual boundary there, write ∇Σf=grad⁡hf and ΔΣf=div⁡h(∇Σf) for the positive-trace Laplacian. If f is an ambient function, these operators act on its restriction to Σ. At actual boundary points use the smooth one-sided extensions of these local operators.

Fix an arbitrary real exponent μ>0. For nonempty Q set T=max⁡q∈Qmax⁡{τ(q),0}, and for empty Q set T=0. Set B=sup⁡∂Σ∩{τ>0}τμv, with the supremum zero for an empty set. At positive height only the actual hypersurface boundary contributes a boundary term.

Justification

The normal and induced metric are those of the spacelike hypersurface interface; the temporal orientation is that of the causal interface. The inverse metric and metric dual of dτ have the musical-isomorphism convention. Dividing a past timelike gradient by its positive Lorentzian norm and reversing its sign gives a future unit timelike V. In a Lorentz-orthonormal frame with time axis V, the unit equation for the future n gives v=1+∣nspace∣2≥1.

The Riemannian gradient and divergence suppliers define the two intrinsic operators. The Laplace–Beltrami supplier identifies their composition with the positive metric trace of the Hessian and supplies the stated one-sided boundary convention. The gradient's inverse-metric formula also extends smoothly in boundary half-charts, since h stays positive definite and f is smooth up to the boundary; its values there are determined by its values in the interior.

For nonempty Q, the continuous function q↦max⁡{τ(q),0} attains a finite maximum by the compactness supplier's extreme-value assertion. If Q is empty, so is P, and the explicit convention defines T. On nonempty compact P, smoothness up to the actual boundary makes v continuous and bounded for each individual hypersurface, again by that extreme-value assertion. Since μ>0, the weight τμ is continuous on P, with value zero at zero height, and 0≤τ≤T there. Thus the actual boundary supremum is finite, and its empty-set convention covers empty P as well. No uniform bound along a sequence is assumed.

Depends on

Used by · 5

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.