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.

Induced metric and graph normal inherit the required weighted regularity

Statement

Work in ZFC. Fix 0<α<1 and q>0. Let g be a smooth time-oriented Lorentzian metric of signature (−,+,+,+) on a stationary Cartesian end (tq,xq), with coefficients independent of tq, rq=∣xq∣>R0>0, and ∂tq future timelike sufficiently far out. Assume g00+1,gij−δij=O5(rq−1) and g0i=O5(rq−2). Here f=O5(rq−b) means ∣Djf∣≤Cjrq−b−j for 0≤j≤5 outside a common radius, with D denoting Cartesian spatial derivatives in xq. Spatial indices run from 1 to 3 and repeated spatial indices are summed.

Let tq=u(xq) be a supplied smooth spacelike maximal graph, so its mean curvature vanishes, and assume ∣Dju∣≤Crq−3/4−j for 0≤j≤4. Write ui=∂xqiu. No existence of this graph is asserted.

The induced metric, in the graph coordinates xq, is hij=gij+g0iuj+g0jui+g00uiuj. On a sufficiently far-out end, hij−δij∈C−13,α and its inverse satisfies hij−δij∈C−13,α. The future unit normal has components n0−1∈C−14,α and ni∈C−7/44,α in (tq,xq). 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 x by xq=qx and put r=∣x∣, so rq=qr. If hx denotes the induced metric components in x, then q−2hijx−δij∈C−13,α 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 q∈[q−,q+] with 0<q−≤q+<∞, provided the normalized-chart estimates being compared have common constants and a common starting radius. No uniform estimate as q↓0 is asserted.

Facts & Assumptions

[F1]

For a supplied smooth stationary maximal graph with the stated order-zero through order-four decay and background bounds, the graph-height supplier gives u∈C−3/45,α on the end, under its ZFC hypothesis. The maximal equation upgrades pointwise order-four graph decay to weighted order five

[F2]

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

[F3]

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

[F4]

With Q=−g00+2g0iui−gijuiuj, the flux supplier gives the future normal n=−g−1d(tq−u)/Q when ∂tq 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

[F5]

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

[F6]

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

[F7]

For composable Euclidean maps totally differentiable at the relevant points, D(G∘F)=DG(F)∘DF. Here the maps being composed are smooth on open sets: coordinate dilations and scalar functions on the positive range of Q. The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)

[F8]

A matrix-valued map with Cr entries on an open Euclidean set has Cr 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 g and h 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

[A1]

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.

1.1givenF1F3F5F6A1algebra

The graph and metric hypotheses are exactly those of [F1], so under [A1] that supplier gives u∈C−3/45,α. Thus Du∈C−7/44,α. By [F3], the time and spatial metric errors belong to C−14,α and the mixed metric components to C−24,α 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 [ab]α≤∥a∥∞[b]α+∥b∥∞[a]α show that products add the decay exponents. These bounds use a common sufficiently large radius for the finitely many component arrays and derivative orders.

1.2givenF3F6F8algebra

Put η=diag⁡(−1,1,1,1) and B=g−1. By [F8], B is smooth. Since g→η, its determinant is bounded away from zero sufficiently far out, and the cofactor formula bounds B. The identity B−η=−B(g−η)η gives the zeroth-order error O(rq−1). Differentiating Bg=I using [F6] gives ∂kB=−B(∂kg)B. Repeated product differentiation through order five expresses every positive-order derivative of B as a finite sum of products of bounded inverse factors and positive-order derivatives of g, whose total derivative order is that of the derivative of B. Each such product contains at least one metric derivative, so the background bounds give Dj(B−η)=O(rq−1−j) for 0≤j≤5. Also g00 stays bounded away from zero; repeated differentiation of g00−1g00=1 bounds Dj(g00−1) by O(rq−j) through order five. From giμgμ0=0 follows gi0=−gijgj0/g00. Every differentiated term contains a derivative of gj0, with its stronger order rq−2; the other factors have order-j derivatives bounded by O(rq−j). Thus gi0=O5(rq−2). Applying [F3] at orders zero through four yields g00+1,gij−δij∈C−14,α and gi0∈C−24,α, including the lower-order Hölder bounds needed in products.

2.1F2F5F6F8step 1.1algebra

The graph tangent vectors are ei=∂xqi+ui∂tq. Evaluating g(ei,ej) gives the displayed formula for h. Its spatial background error has decay exponent −1, its mixed products have exponent −2−7/4=−15/4, and its slope-square term has exponent −7/2, all with at least the three differentiated Hölder orders claimed. Hence E=h−δ∈C−13,α and h is uniformly positive definite far out. By [F8], h−1 is smooth. The identity h−1−I=−h−1E and the cofactor formula bound the inverse and its zeroth-order error. Differentiating h−1h=I using [F6] gives Dh−1=−h−1(Dh)h−1; iterate through order three. Each differentiated error term has a differentiated E factor, while undifferentiated inverse factors remain bounded. Hölder increments of the inverse are controlled by h−1(x)−h−1(y)=h−1(x)(h(y)−h(x))h−1(y). The product inequality from step 1.1 therefore gives h−1−I∈C−13,α.

2.2F1F3F4F5F6F7step 1.1step 1.2algebra

The inverse estimates of step 1.2 together with step 1.1 give Q−1∈C−14,α, so Q is bounded away from zero far out. The square-root difference quotient gives (s1/2)′=1/(2s) for s>0. Iterating [F6] gives bounded derivatives of s−1 and s1/2 through order four on a fixed positive bounded interval, and [F7] differentiates their compositions with Q; their increments are controlled by a−1−b−1=(b−a)/(ab) and a−b=(a−b)/(a+b). The product inequality then gives Q−1/2−1∈C−14,α. The normal formula becomes n0=(−g00+g0juj)/Q and ni=(gijuj−gi0)/Q. Its time numerator differs from one by weighted order −1, and its spatial numerator has weighted order −7/4, since the mixed inverse term has the stronger order −2. These yield the stated normal estimates through four Hölder derivatives. The sign is future-directed because d(tq−u)(∂tq)=1>0.

3.1F2F5F7step 2.1step 2.2algebra∎

For the coordinate change defined in the Statement, ∂xi=q∂xqi along the graph, so hijx(x)=q2hij(qx) and q−2hx(x)−I=E(qx). Iterating [F7] for every multi-index I gives DxI(E(qx))=q∣I∣(DxqIE)(qx), and the corresponding Hölder seminorm gains q∣I∣+α. The annulus R<r<2R maps to qR<rq<2qR, so its weight-−1 scaled norm for E(q ⋅) is q−1 times the normalized-chart scaled norm at radius qR. This proves the fixed-chart metric assertion using step 2.1. The same calculation for any weight replaces q−1 by the corresponding fixed power of q; tensor-component transformations supply only further constant powers. All such factors are bounded above and away from zero on [q−,q+], and a common normalized starting radius R∗ is respected for r>R∗/q−. Thus all claimed exponent preservation and conditional coordinate uniformity follow.

Depends on

Used by · 4

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.