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.

Quantifiers and parameter gap in the ADM smallness hypothesis

Statement

In mass-one Radu ADM data with J<1, for any supplied positive threshold function j(A), the quantitative application predicate at fixed A is A‾ADM≤A and J<j(A). A theorem asserting existence of a suitable threshold uses the order: first fix A, then choose a positive threshold uniformly for data with that bound. The geometric bound implies A≥1 and J≤1−A−1. Hence it is a simultaneous geometric and angular-momentum condition, not the statement that a universal numerical angular tolerance works for every geometry. These algebraic consequences do not prove a Kerr conclusion. Any Kerr rigidity implication would require a separately supplied theorem under its complete hypotheses, including GR/SBS and maximality; no rigidity theorem is an input to this lemma.

For these comparisons, the horizon scalar is H=sup⁡p∈S0∣gp(Tp,Tp)∣ on the supplied bifurcation sphere. When its own defining Ernst/curvature data are supplied, W denotes the smooth weighted Mars–Simon tensor. A Kerr conclusion means an isometry of the exterior to the subextremal Kerr exterior with parameters M=1 and a=J, using the target definition's stated countable-choice convention. No bound for H or W is asserted here.

Facts & Assumptions

[F1]

Radu small-ADM global and bifurcation package specifies GR/SBS, including g,T,S0, The ADM-source mass and angular-momentum parameters defines the nonnegative mass-one J, and Maximality and smooth boundary in the ADM theorem specifies the separate maximality condition.

[F2]

The actual geometric constant in the small-ADM theorem puts (1−J)−1 among the entries of A‾ADM.

[F3]

Subextremal Kerr exterior in length coordinates defines the subextremal Kerr target under its stated countable-choice convention. Mars–Simon tensor and its smooth weighted extension defines W on its supplied smooth potential/tensor domain, including points where the unweighted formula would divide by zero. These are formulation inputs for the comparisons only; supplying ADM data does not silently supply the additional Ernst/curvature data.

Proof

Given: Mass one, 0≤J<1 and the finite geometric bound in the Statement.

Goal: Identify its scalar consequences and the order of its quantitative choices.

1.1givenF1F2algebra

Since 0<1−J≤1, its inverse is at least one. From [F2], 1≤(1−J)−1≤A‾ADM≤A, giving A≥1. Multiplying the positive inequality (1−J)−1≤A by 1−J and then dividing by positive A gives J≤1−A−1.

2.1givenF1F2F3step 1.1algebra∎

Suppose a theorem is supplied with quantifier order ∀A>0 ∃jA>0 ∀d, followed by the implication that A‾ADM(d)≤A and J(d)<jA give a specified conclusion C(d), where d ranges over mass-one data satisfying all its other hypotheses. This order fixes A before selecting the threshold, which is then uniform over those data at that bound; it does not assert one positive threshold uniform over all A. For each application both inequalities must still be checked. In particular fixing one geometry with A‾ADM≤A does not delete that hypothesis from the implication. Step 1.1 supplies its scalar parameter gap. No existence of such a theorem or rigidity threshold is proved or assumed here. No estimate for either comparison object in [F3], and no Kerr rigidity implication, is part of this argument.

Depends on

Used by · 1

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.