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.

The maximal equation upgrades pointwise order-four graph decay to weighted order five

Statement

Work in ZFC. Let a smooth stationary maximal graph have ∣Dju∣≤Cr−3/4−j for 0≤j≤4, in a background satisfying the preceding flux lemma. Then u∈C−3/45,α on the end for every fixed 0<α<1. The realized linear graph equation may be normalized as aijuij+bjuj=f with a−δ∈C−12,α, b∈C−22,α, and f∈C−32,α. In particular Δ0u∈C−32,α, where Δ0 is the Euclidean Laplacian.

Facts & Assumptions

[F1]

The stationary graph equation has a uniformly elliptic flux on fixed rescaled annuli. Stationary maximal graphs have an explicit uniformly spacelike flux

[F2]

The preliminary differentiated-flux bootstrap gives realized coefficient C2,α bounds. Uniform coefficient regularity before the final graph estimate

[F3]

The controlled realized linear equation has the interior C4,α estimate linear in height and forcing. Linear fourth derivative bound with controlled realized coefficients

[F4]

The linear interior Schauder estimate applies to derivatives once their coefficient Hölder bounds are established. Interior Schauder estimate for uniformly elliptic equations

[F5]

The end-weight convention measures derivatives and Hölder seminorms on fixed rescaled annuli. Weighted Hölder norms on a three-dimensional exterior

[A1]

Work in ZFC, including the Axiom of Choice required by [F2] and [F3]. It also supplies the Countable Choice required by [F4]: for a sequence of nonempty sets, apply Choice to its family of values and compose the choice function with the sequence. This assumption is used when invoking [F2] and [F3] in step 1.1 and [F4] in step 2.1. The Axiom of Choice

Proof

Given: The assumptions in the Statement.

Goal: Establish the stated conditional construction or estimate.

1.1F1F2F3F5A1given

Under [A1], put v(y)=u(Ry) and w=v/R. The height and slope assumptions bound w and keep Dw in a fixed spacelike ball. [F1] and [F2] first give the realized coefficient bounds, before applying [F3]. The forcing for v is −Rs(y,0)=O(R−1) in C2,α. Thus ∥v∥C4,α≤C(R−3/4+R−1)≤CR−3/4 on a smaller fixed annulus. The conclusion includes Hölder control of fourth derivatives, not just their pointwise bounds.

2.1step 1.1F1F4A1algebra

One further differentiation is legitimate because the original solution is smooth. The realized coefficients now have uniform C3,α bounds: differentiating Pp(y,Dw) three times uses at most fourth derivatives of w, and differentiating ∫01sp(y,tDw)dt three times uses background spatial derivatives through order four. All finite slope derivatives are controlled by [F1]. The rescaled forcing has C3,α norm O(R−1). Differentiate the realized equation three times and, using the Countable Choice supplied by [A1], apply [F4] to each D3v; every commutator contains coefficient derivatives through order three and solution derivatives through order four, already bounded by step 1.1. This bounds v in C5,α by CR−3/4 on a further smaller annulus.

3.1F1F5step 2.1algebra∎

The pointwise small slope and step 2.1 give, in the original coordinates, a−δ=OC2,α(r−1), b=OC2,α(r−2) and f=OC2,α(r−3) by the explicit flux and zero-slope formulas. Here the quadratic slope correction is O(r−7/2) and does not weaken the metric error. Hence Δ0u=f−(a−δ):D2u−b⋅Du has weighted order −3 through two Hölder derivatives. Rescale back and use the fixed finite annular covers for the global end assertion.

Depends on

Used by · 5

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.