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 . Let and its canonical graph gauge be as in the linear-expansion variation lemma. Let be a jointly smooth admissible graph path on a common open parameter interval containing , with . A marginally outer trapped surface (MOTS) here means identically on for the chosen outward future null ray. For any jointly smooth real with , replace the normals along by and . If , their pulled-back expansion obeys 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 , the variation at a MOTS is instead multiplied by ; absolute equality is not asserted for different base scales. A smooth reparametrization of the graph by diffeomorphisms with adds , which is also zero at a MOTS.
Facts & Assumptions
Canonical outward normals and null gauge on a graph fixes the base normal and the graph gauge.
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 for the stated jointly smooth admissible graph path with .
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.
Affine connection on a smooth manifold supplies the connection product rule . The along-surface derivative convention in [F3] permits applying this rule to local ambient extensions.
Diffeomorphisms and local diffeomorphisms of manifolds defines the diffeomorphisms used for reparametrization. The assumed smooth family means is jointly smooth.
Adopt countable choice 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 , and the smooth boost with specified base scale.
Goal: Establish the precise extent of gauge independence.
The path hypotheses and [F6] meet the requirements of [F2] and [F3]. For any graph-tangent , the product rule in [F4], applied through the along-surface convention in [F3], yields . The last term is zero because is normal. Taking the surface trace gives ; reciprocal scaling of the other normal preserves the pairing . Differentiating and using [F2] gives . Setting gives the displayed formula; setting gives both base-scale assertions. Without the MOTS condition, the additional term generally remains.
Pullback by the smooth diffeomorphism family in [F5] replaces the scalar by . The chain rule differentiates this to . 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
- Canonical outward normals and null gauge on a graph
- Linear and path-independent normal-graph variation of expansion
- Null normal pairs and screen geometry
- The chain rule for differentials of smooth maps
- Affine connection on a smooth manifold
- Diffeomorphisms and local diffeomorphisms of manifolds
- The Axiom of Countable Choice (AC_ω)
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.