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.

Stationary transport of vanishing from a section

Statement

Use the IK AF package, with exterior E and section Σ0, and let Φ:R×E→E be the complete stationary flow. Let S be a smooth tensor field on E of any fixed type (r,s), where r,s are nonnegative integers, with real or complex values. Use the diffeomorphism pullback specified below, extended to complex values by applying it to the real and imaginary parts. If Φt∗S=S for every real t and S=0 on Σ0∩E, then S=0 on E.

For application to the Mars–Simon tensor, additionally establish or import E⊆N={1−σ≠0}, where σ is the supplied Ernst potential, and establish or import flow invariance of that tensor. Its definition supplies a complex covariant four-tensor only on N. Neither domain inclusion nor preservation follows merely from vanishing on the section.

Facts & Assumptions

[F1]

Every stationary orbit through E is complete and meets the section. The flow in the Statement is on E, so its section intersection lies in Σ0∩E. Exact asymptotic and orbit package for the IK criterion

[F2]

Each time-t map of a smooth maximal flow is a diffeomorphism between its open domains, with inverse the time-(−t) map. Applied to the complete flow on E, these domains are both E. Time-t flow maps are diffeomorphisms between open domains

[F3]

A smooth type-(r,s) tensor field is a smooth section of its tensor bundle; each real fiber tensor is a multilinear map on r cotangent and s tangent arguments. Complex values mean a pair of real tensors, with all constructions applied componentwise. A smooth tensor field A type (r,s) tensor on a finite-dimensional vector space

[F4]

For covariant fields, (f∗S)q(v1,…,vs)=Sf(q)(dfqv1,…,dfqvs). If f is a diffeomorphism, this pullback has inverse (f−1)∗. The pullback of a covariant tensor field A diffeomorphism pulls back tensor fields and forms isomorphically

[F5]

For a diffeomorphism f the differential A=dfq is a linear isomorphism. The mixed-tensor pullback convention used here is (f∗S)q(α1,…,αr,v1,…,vs)=Sf(q)(α1∘A−1,…,αr∘A−1,Av1,…,Avs), where αi∈Tq∗E and vj∈TqE. This defines a multilinear tensor and agrees with the covariant construction when r=0. The differential of a diffeomorphism is an isomorphism A type (r,s) tensor on a finite-dimensional vector space

[F6]

The Mars–Simon tensor formula defines a smooth complex covariant four-tensor on the open set N={1−σ≠0}; its restriction to all of E therefore requires E⊆N. Ernst sublevels and the Mars–Simon tensor interface

Proof

Given: The flow-invariant real or complex type-(r,s) tensor on E and its vanishing on Σ0∩E.

Goal: Show Sp=0 for every p∈E.

1.1givenF2F5

Each Φt:E→E is a diffeomorphism with inverse Φ−t. In particular dΦt∣q:TqE→TΦt(q)E is a linear isomorphism at every q∈E.

1.2givenF1choose

Fix p∈E. By the orbit-section assumption, choose q∈Σ0∩E and t∈R such that p=Φt(q). Invariance and section vanishing give (Φt∗S)q=Sq=0.

2.1F3F4F5step 1.1step 1.2algebra∎

Set A=dΦt∣q. For arbitrary βi∈Tp∗E and wj∈TpE, insert αi=βi∘A and vj=A−1wj into the mixed-pullback formula. It gives Sp(β1,…,βr,w1,…,ws)=(Φt∗S)q(β1∘A,…,βr∘A,A−1w1,…,A−1ws)=0. Thus every evaluation is zero, so Sp=0. This also covers r=0 with the covariant pullback and its inverse, and r=s=0 with empty argument lists. Applying the same argument to the real and imaginary parts proves the complex case. Since p was arbitrary, S=0 on E.

Depends on

Used by · 2

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.