Alphabeta Math
DefinitionDefinition: 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.

Lipschitz height functions, cut measure and Jacobians

Definition

On a smooth Riemannian three-region (Σ,k) a locally Lipschitz height u has almost-everywhere chart derivatives, equal to weak derivatives; its metric gradient is defined almost everywhere by k(∇u,⋅)=du. Cut area means normalized two-dimensional Hausdorff measure Hk2. The initial domain for an endpoint construction is a Borel subset A of a smooth Riemannian surface (C,h), not the possibly nonsmooth image D. For F:A→Σ with countably many local C1 extensions, J(F) means the nonnegative Gram Jacobian J2F, and N(F,A;y) counts the initial points arriving at y. The area formula is ∫AJ(F) dμC=∫F(A)N(F,A;y) dHk2(y); therefore surjectivity F(A)=D gives ∣D∣≤∫AJ(F) dμC. Coincident endpoints do not invalidate this inequality. The identity ∣D∣=∫AJ(F) dμC holds if N(F,A;y)=1 for Hk2-almost every y∈D. If ∫AJ(F) dμC<∞, this multiplicity-one condition is also necessary for equality. Equality with infinite common value need not imply multiplicity one. All measures use the same area normalization and the specified fixed metrics; J(F)≤1 is an additional geometric estimate, not part of the definition of Jacobian.

Facts & Assumptions

[A1]

Work in ZFC, including the Axiom of Choice. The Axiom of Choice

[F1]

Lipschitz differentiability, weak derivatives and graph calculus are supplied under Countable Choice by Lipschitz graph area and calculus under Countable Choice.

[F2]

The Riemannian metric convention is Riemannian metric and riemannian manifold. Measurable initial domains, Gram Jacobians and counting multiplicity are defined in Measurable domains on smooth initial surfaces, Tangential area Jacobian on a measurable surface domain and Counting multiplicity of an endpoint map.

[F3]

Transverse hitting regularity is Transverse hitting maps have local differentiable extensions; the area formula with multiplicity and its image-area bound are Area formula and endpoint bound with multiplicity.

[F4]

The Lorentzian metric and nonzero null-vector conventions are Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model, the positive-definite tangent metric of a spacelike hypersurface is Spacelike hypersurfaces, acausal sets, Cauchy sets, domains of dependence and Cauchy horizons, and the time-function convention is Chronology, causality, strong causality, global hyperbolicity and time functions, clause (d). These are mathematical definitions; no physical postulate is used.

[F5]

A nonempty regular fibre of a smooth scalar map is an embedded codimension-one submanifold. The proof supplies local projection coordinates for the map, hence identifies the tangent space of the fibre with the kernel of its differential. A regular level set is an embedded submanifold

Justification

Apply [F1] in coordinate charts to the height and use the smooth inverse metric to obtain its measurable weak gradient. The area and Jacobian conventions are exactly [F2], and the formula and inequality are [F3]. Multiplicity one almost everywhere suffices for equality by that formula. For necessity in the finite case, put I=∫AJ(F) dμC<∞ and suppose ∣D∣=I. The measurable set E={y∈D:N(F,A;y)≥2} satisfies I=∫DN(F,A;y) dHk2(y)≥∣D∣+Hk2(E). Subtracting the finite value ∣D∣=I gives Hk2(E)=0. This subtraction is unavailable for infinite common value. Indeed, take A=C=R2⊔R2 with its Euclidean component metrics and map each component isometrically onto the same plane D in Euclidean Σ=R3. This map is smooth on both components, J2F=1, N=2 everywhere on D, and both ∣D∣ and I are infinite.

For an endpoint family, [F3] supplies local extensions when the supplied C1 family meets a slice s=0 transversely at its unique hit. For null generators of a smooth Lorentzian metric meeting a spacelike slice Σ=s−1(0), use a smooth defining function s with 0 a regular value, as required by [F3]. At a hit p, the regular-level coordinates of [F5] give TpΣ=ker⁡dsp. If the nonzero null tangent γ˙ had dsp(γ˙)=0, it would belong to TpΣ. Positive definiteness on that space would give gp(γ˙,γ˙)>0, contradicting gp(γ˙,γ˙)=0. Thus dsp(γ˙)≠0, using precisely the conventions in [F4].

If the family is parametrized by a smooth chosen initial null normal and has smooth geodesic dependence on its open flow domain, it is such a supplied family; these are geometric inputs to be established by an application, not consequences of a Lipschitz height alone. When the defining function s is also a time function, [F4] makes it strictly increasing along each future-oriented generator, and strictly decreasing with the opposite orientation. Either strict monotonicity makes a prescribed time-level hit unique.

A closed A⊂C is Borel by [F2]. Thus an application must verify the smooth initial surface and chosen generator branch, open flow domain, unique transverse hits at a regular level, Borel domain and image coverage. It does not need to prove that D is a smooth or Lipschitz surface. Focal degeneracy at endpoints is allowed as rank loss of the derivative. No inference of the required endpoint-map regularity is made merely from the statement that D is a cut.

Depends on

Used by · 14

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.