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.

Boost dependence of expansion variation and the MOTS gauge

Statement

Assume countable choice ACω. Let S and its canonical graph gauge be as in the linear-expansion variation lemma. Let u(t,p) be a jointly smooth admissible graph path on a common open parameter interval containing 0, with u(0,p)=0. A marginally outer trapped surface (MOTS) here means θL0=0 identically on S for the chosen outward future null ray. For any jointly smooth real f(t,p) with f(0,p)=0, replace the normals along Fu(t) by L^t=ef(t,p)Lu(t) and L‾^t=e−f(t,p)L‾u(t). If u˙(0)=ϕ, their pulled-back expansion obeys ∂tΘ^t∣0=Lϕ+f˙(0,⋅)θL0. Hence at a MOTS this variation is unchanged by every such smooth boost fixing the base normal. If the base scale changes by a smooth f0(p), the variation at a MOTS is instead multiplied by ef0; absolute equality is not asserted for different base scales. A smooth reparametrization of the graph by diffeomorphisms ηt:S→S with η0=id adds dθL0(η˙0), which is also zero at a MOTS.

Facts & Assumptions

[F1]

Canonical outward normals and null gauge on a graph fixes the base normal L0=n+ν and the graph gauge.

[F2]

Under the geometric and graph-domain hypotheses inherited in the Statement and countable choice in [F6], Linear and path-independent normal-graph variation of expansion supplies the canonical variation Lϕ for the stated jointly smooth admissible graph path with u(0,p)=0.

[F3]

Null normal pairs and screen geometry supplies the expansion trace and its boost scaling; The chain rule for differentials of smooth maps supplies differentiation of smooth composites.

[F4]

Affine connection on a smooth manifold supplies the connection product rule ∇X(aY)=X(a)Y+a∇XY. The along-surface derivative convention in [F3] permits applying this rule to local ambient extensions.

[F5]

Diffeomorphisms and local diffeomorphisms of manifolds defines the diffeomorphisms ηt:S→S used for reparametrization. The assumed smooth family means (t,p)↦ηt(p) is jointly smooth.

[F6]

Adopt countable choice ACω in the sense of The Axiom of Countable Choice (AC_ω). It meets the inherited graph-construction requirements of [F2] and the smooth tangent-bundle and time-orientation conventions of [F3]. No stronger choice principle is assumed.

Proof

Given: The geometric and graph-domain data of the Statement, countable choice in [F6], the jointly smooth admissible graph path with u(0,p)=0, and the smooth boost with specified base scale.

Goal: Establish the precise extent of gauge independence.

1.1F1F2F3F4F6givenalgebra

The path hypotheses and [F6] meet the requirements of [F2] and [F3]. For any graph-tangent X,Y, the product rule in [F4], applied through the along-surface convention in [F3], yields g(∇X(efL),Y)=efg(∇XL,Y)+efX(f)g(L,Y). The last term is zero because L is normal. Taking the surface trace gives Θ^=efΘ; reciprocal scaling of the other normal preserves the pairing −1. Differentiating and using [F2] gives ∂tΘ^∣0=ef0(Lϕ+f˙0θL0). Setting f0=0 gives the displayed formula; setting θL0=0 gives both base-scale assertions. Without the MOTS condition, the additional term generally remains.

2.1F2F3F5step 1.1algebra∎

Pullback by the smooth diffeomorphism family in [F5] replaces the scalar by Θt(ηt(p)). The chain rule differentiates this to ∂tΘt∣0+dθL0(η˙0). A function identically zero has zero differential, so the second term vanishes at a MOTS. These computations establish gauge and parameterization independence only with the stated base-scale and smoothness hypotheses.

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.