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.
Induced metric and graph normal inherit the required weighted regularity
Statement
Work in ZFC. Fix and . Let be a smooth time-oriented Lorentzian metric of signature on a stationary Cartesian end , with coefficients independent of , , and future timelike sufficiently far out. Assume and . Here means for outside a common radius, with denoting Cartesian spatial derivatives in . Spatial indices run from to and repeated spatial indices are summed.
Let be a supplied smooth spacelike maximal graph, so its mean curvature vanishes, and assume for . Write . No existence of this graph is asserted.
The induced metric, in the graph coordinates , is . On a sufficiently far-out end, and its inverse satisfies . The future unit normal has components and in . Weighted spaces here are measured componentwise on the end by the scaled-annulus convention; a smooth restriction to any fixed inner annulus contributes a finite compact-core norm.
Define fixed spatial coordinates by and put , so . If denotes the induced metric components in , then in the fixed chart. Constant coordinate scaling preserves the displayed weighted exponents, with the appropriate constant tensor-component factors. The coordinate-comparison constants are uniform for with , provided the normalized-chart estimates being compared have common constants and a common starting radius. No uniform estimate as is asserted.
Statement references
The maximal equation upgrades pointwise order-four graph decay to weighted order five
Spacelike sections, maximality and lapse–shift data
One extra pointwise derivative supplies scaled Hölder control
Stationary maximal graphs have an explicit uniformly spacelike flux
Weighted Hölder norms on a three-dimensional exterior
Sum, product, quotient, and chain rules from difference quotients
The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
Matrix inversion preserves Cᵏ regularity where the determinant is nonzero
Facts & Assumptions
For a supplied smooth stationary maximal graph with the stated order-zero through order-four decay and background bounds, the graph-height supplier gives on the end, under its ZFC hypothesis. The maximal equation upgrades pointwise order-four graph decay to weighted order five
A spacelike hypersurface has its induced positive-definite metric and smooth future unit normal; maximality means vanishing mean curvature with the stated convention. Spacelike sections, maximality and lapse–shift data
One extra pointwise derivative gives the corresponding eventual scaled Hölder bound, componentwise. In particular the stated stationary background errors have weighted order-four Hölder bounds; the same implication applies at every lower derivative order. One extra pointwise derivative supplies scaled Hölder control
With , the flux supplier gives the future normal when is future timelike. The differentiated inverse estimates in its Proof 1.2 are derived locally below from the background bounds. Stationary maximal graphs have an explicit uniformly spacelike flux
Weighted Hölder norms are measured by rescaling fixed annuli, with Cartesian derivative weights and the top-derivative Hölder seminorm, and apply componentwise to finite arrays. Weighted Hölder norms on a three-dimensional exterior
For differentiable real functions, sums, products and quotients with nonzero denominator obey the usual derivative rules. Apply these rules to component functions on coordinate lines and iterate for higher spatial derivatives. Sum, product, quotient, and chain rules from difference quotients
For composable Euclidean maps totally differentiable at the relevant points, . Here the maps being composed are smooth on open sets: coordinate dilations and scalar functions on the positive range of . The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
A matrix-valued map with entries on an open Euclidean set has inverse entries wherever its determinant never vanishes. Its cofactor-over-determinant formula bounds the inverse when the entries are bounded and the determinant stays away from zero. Apply this to the smooth invertible matrices and on the exterior; quantitative weighted derivative and Hölder bounds are proved below, rather than imported from this regularity statement. Matrix inversion preserves Cᵏ regularity where the determinant is nonzero
ZFC includes the Axiom of Choice. It is carried here when invoking the graph-height supplier in step 1.1, whose analytic suppliers require it; the finite tensor and coordinate computations add no choice assumption. The Axiom of Choice
Proof
Given: The metric, graph, decay, parameter and ZFC hypotheses in the Statement.
Goal: Prove the induced-metric, inverse, normal and coordinate-comparison assertions.
The graph and metric hypotheses are exactly those of [F1], so under [A1] that supplier gives . Thus . By [F3], the time and spatial metric errors belong to and the mixed metric components to on a sufficiently far-out end. Apply [F3] also at lower derivative orders when lower Hölder seminorms are needed. On each fixed rescaled annulus, the Leibniz rule from [F6] and show that products add the decay exponents. These bounds use a common sufficiently large radius for the finitely many component arrays and derivative orders.
Put and . By [F8], is smooth. Since , its determinant is bounded away from zero sufficiently far out, and the cofactor formula bounds . The identity gives the zeroth-order error . Differentiating using [F6] gives . Repeated product differentiation through order five expresses every positive-order derivative of as a finite sum of products of bounded inverse factors and positive-order derivatives of , whose total derivative order is that of the derivative of . Each such product contains at least one metric derivative, so the background bounds give for . Also stays bounded away from zero; repeated differentiation of bounds by through order five. From follows . Every differentiated term contains a derivative of , with its stronger order ; the other factors have order- derivatives bounded by . Thus . Applying [F3] at orders zero through four yields and , including the lower-order Hölder bounds needed in products.
The graph tangent vectors are . Evaluating gives the displayed formula for . Its spatial background error has decay exponent , its mixed products have exponent , and its slope-square term has exponent , all with at least the three differentiated Hölder orders claimed. Hence and is uniformly positive definite far out. By [F8], is smooth. The identity and the cofactor formula bound the inverse and its zeroth-order error. Differentiating using [F6] gives ; iterate through order three. Each differentiated error term has a differentiated factor, while undifferentiated inverse factors remain bounded. Hölder increments of the inverse are controlled by . The product inequality from step 1.1 therefore gives .
The inverse estimates of step 1.2 together with step 1.1 give , so is bounded away from zero far out. The square-root difference quotient gives for . Iterating [F6] gives bounded derivatives of and through order four on a fixed positive bounded interval, and [F7] differentiates their compositions with ; their increments are controlled by and . The product inequality then gives . The normal formula becomes and . Its time numerator differs from one by weighted order , and its spatial numerator has weighted order , since the mixed inverse term has the stronger order . These yield the stated normal estimates through four Hölder derivatives. The sign is future-directed because .
For the coordinate change defined in the Statement, along the graph, so and . Iterating [F7] for every multi-index gives , and the corresponding Hölder seminorm gains . The annulus maps to , so its weight- scaled norm for is times the normalized-chart scaled norm at radius . This proves the fixed-chart metric assertion using step 2.1. The same calculation for any weight replaces by the corresponding fixed power of ; tensor-component transformations supply only further constant powers. All such factors are bounded above and away from zero on , and a common normalized starting radius is respected for . Thus all claimed exponent preservation and conditional coordinate uniformity follow.
Depends on
- The maximal equation upgrades pointwise order-four graph decay to weighted order five
- Spacelike sections, maximality and lapse–shift data
- One extra pointwise derivative supplies scaled Hölder control
- Stationary maximal graphs have an explicit uniformly spacelike flux
- Weighted Hölder norms on a three-dimensional exterior
- The Axiom of Choice
- Sum, product, quotient, and chain rules from difference quotients
- The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
- Matrix inversion preserves Cᵏ regularity where the determinant is nonzero
Used by · 4
- Mean-curvature linearization, weighted regularity and fixed-boundary graph map
- The graph second form and electrovacuum Jacobi potential have weighted order four
- The transverse lapse is a positive weighted Dirichlet multiplier
- A timelike transverse field gives a fixed-boundary admissible graph neighborhood
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.