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.

Supplied CW logarithmic maximal ends have weak weighted initial data

Statement

Suppose a smooth stationary vacuum end has g00=−1+2M0/r+O6(r−2), g0i=O6(r−2), gij=δij+O6(r−1), and T=∂t. Supply an already existing smooth CW maximal end t=u(x) with its α=1 logarithmic graph bounds through at least four derivatives and the corresponding top Holder bound. The original O6 metric bounds supply the selected end's k=3, α=1 metric and weighted Holder requirements. The declared CW existence input may be used at k=3, α=1 provided every other end also meets those requirements for a common Holder exponent 0<λ<1, and all remaining class-(b) hypotheses and the exclusion condition hold. The graph and its bounds are supplied hypotheses here; end decay alone does not establish existence.

Here r=∣x∣ in the fixed spatial end chart. For a scalar or finite array of coordinate components f, write f=Om(r−b(log⁡r)p), with m a nonnegative integer, b∈R and p∈N0, when there are a radius R>1 and finite constants Cβ≥0 such that ∣∂βf(x)∣≤Cβr−b−∣β∣(log⁡r)p componentwise for every ∣β∣≤m and r≥R, uniformly in angular directions. Here ∂β denotes Cartesian multi-index differentiation. The case p=0 is the differentiated pure-power convention.

Set τ=t−u(x), so that the SAME maximal hypersurface is τ=0 and T=∂τ. Its stationary decomposition is g=−N2dτ2+hij(dxi+Xidτ)(dxj+Xjdτ). Then h−δ=O3(r−1)+O3(r−2log⁡2r), N→1, X=O3(r−1log⁡r), and k=O2(r−2log⁡r). In the weighted Sobolev convention ∥f∥Hηs2=∑∣I∣≤s∫r−2η−3+2∣I∣∣DIf∣2dx, these imply h−δ∈H−1/23 and k∈H−5/42. These are explicit weak maximal initial-data bounds with weight η=−1/2 and η/2−1=−5/4; no improved height or seventh derivative has been assumed. Matching a stationary-source theorem's remaining hypotheses is a separate obligation of its consumer.

Facts & Assumptions

[F1]

Assume the supplied smooth spacelike maximal end graph has the α=1 logarithmic differentiated bounds through four derivatives and the top Holder bound in the Statement. Invoking the declared CW existence input with k=3, α=1 requires its metric and weighted Holder hypotheses on every end for a common exponent 0<λ<1, together with all remaining class-(b) hypotheses and the exclusion condition. The selected end's bounds alone do not establish this global applicability. Stationary maximal hypersurface existence with a horizon boundary

[F2]

The stationary end has T equal to the original time vector, with fixed Lorentzian and Ricci conventions. Stationary Lorentzian data and tensor conventions

[F3]

The supplied slice is spacelike and maximal and has its future unit normal, induced metric and second form. Spacelike sections, maximality and lapse–shift data

[F4]

The local Sobolev convention uses weak derivatives and square integrability. Integer-order Sobolev spaces and their norms

[F5]

Differentiated end orders and weighted Holder bounds are measured in the fixed stationary spatial coordinates. Differentiated asymptotic bounds and parameter uniformity

[F6]

Work in ZFC, including the inherited analytic choice assumptions. The Axiom of Choice

Proof

Given: The actual end hypotheses in the Statement.

Goal: Prove the stated same-slice end consequence.

1.1F1F2F3F5givenalgebra

On the selected end, the original metric bounds give D4(g−η)=O(r−5). Integrating along the segment from x to y with ∣x−y∣≤r(x)/2 gives ∣D3g(x)−D3g(y)∣≤Cr(x)−5∣x−y∣≤Cλr(x)−4−λ∣x−y∣λ for 0<λ<1; stationarity removes the time difference. Thus the selected end meets the order-three weighted Holder requirement. The same metric bounds also give its differentiated decay through order three. This calculation does not upgrade any other end; the global invocation in [F1] remains conditional on the stated requirements on every end and all remaining hypotheses. The subsequent estimates use only the supplied graph bounds. The change to tau changes only the time coordinate, with the same stationary vector and the same supplied slice. Its induced metric is hij=gij+g0iuj+g0jui+g00uiuj. The CW bounds give Dju=O(r−jlog⁡r) for positive j through four. Product differentiation gives the displayed metric bound through three derivatives. Let A=−g−1(dτ,dτ). Spacelikeness gives A>0 and the metric and slope limits give A→1. Since dτ(T)=1 and T is future timelike on the end, the future unit normal vector is n=−A−1/2(dτ)♯. Hence n♭=−N dτ and N=−g(T,n)=A−1/2→1. The mixed components gτi=g0i+g00ui=hijXj, together with the inverse of h→δ, give X=O3(r−1log⁡r). The covariant second-form expression contains the graph Hessian plus metric first derivatives and lower slope products, giving the stated k bound through two derivatives.

2.1F1F2F3F4F5step 1.1algebra∎

For the metric bound, inserting each derivative order into the H3 norm at eta=-1/2 gives an integrable radial majorant proportional to r−2, with still faster log-weighted corrections. For k at eta=-5/4 the radial majorant is proportional to r−5/2log⁡2r, also integrable. Compact inner annuli cause no issue because all supplied fields are smooth there. These are properties of the already supplied maximal hypersurface, not a choice of a new maximal end. For the explicit initial-data weight η=−1/2, the second-form weight is η/2−1=−5/4, as stated. No source theorem is invoked for this integration calculation; matching a consumer's other hypotheses is left to that consumer.

Depends on

Used by · 3

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.