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.
A timelike transverse field gives a fixed-boundary admissible graph neighborhood
Statement
Work in ZFC. Fix and . Let be smooth stationary Lorentzian data and let be a supplied smooth embedded spacelike hypersurface with compact smooth boundary . Give the fixed exterior and compact-chart data defining and . Fix a compact core containing .
Here a stationary graph end means the following supplied data, rather than a consequence of the Killing condition. There is a diffeomorphism onto an open set, with for a fixed , and for a smooth function . The spatial chart agrees with the fixed exterior chart on this tail, whose complement in is compact. The metric coefficients are independent of , is future timelike, and there are finite and such that , , , and All norms and this quadratic-form inequality use the Euclidean spatial coordinates. The stationary Cartesian metric and maximal-graph hypotheses of the induced-metric-and-normal-decay supplier give one sufficient instance of these bounds after increasing ; the construction itself only needs the displayed bounds and the supplied product.
There is a smooth ambient future timelike field on a neighborhood of , equal along to its future unit normal on a neighborhood of the chosen compact core and equal to on a sufficiently distant product tail. For some , every with defines an embedded spacelike flow graph , with . For functions of this regularity, “flow graph” here extends the smooth graph definition by that same formula, with embedding and spacelikeness in class ; no smoothness of is asserted. On the product tail it is exactly . This is an open neighborhood of zero in the Banach space , and does not identify these graphs with -graphs on the compact core.
The same fixed , its flow domain and a single such ball work for a family after shrinking an interval about , under this precise uniformity contract. The metrics and time orientations are jointly smooth on a common ambient neighborhood of , with reference metric . On the same product tail they are -independent, is future timelike, and the preceding bounds on all ambient components, and hold with the same . On compact ambient subsets the parameter topology is convergence of coefficients in fixed charts; joint smoothness supplies this convergence and bounded first derivatives on compact parameter intervals. The tail bounds are additional uniform data, not inferred from compact convergence. For example, common asymptotic bounds , , , with bounded above and away from zero, and , imply this contract on a common sufficiently distant tail.
Facts & Assumptions
ZFC includes Choice, in particular the countable instance used by the partition theorem. It is used to invoke that theorem in the normal extension and cutoff construction. The Axiom of Choice
Smooth subordinate partitions of unity exist on smooth manifolds with boundary under countable Choice. Smooth partitions of unity exist on manifolds with boundary
The smooth flow-graph formula and the induced-metric, future-normal and mean-curvature conventions are fixed by the graph definition. Its smoothness restriction is extended locally here by the explicit construction and proof. Normal graphs and the nonlinear mean-curvature map
Under its stationary Cartesian metric and supplied maximal-graph hypotheses, the induced-metric supplier gives and hence a uniform positive lower bound on a distant tail. Its hypotheses also give bounded ambient coefficients and bounded . No product, completeness or uniform family statement is inferred from this supplier alone. Induced metric and graph normal inherit the required weighted regularity
For fixed exterior chart data the weighted spaces and their zero-trace subspaces are Banach. Weighted Hölder spaces and their Dirichlet kernels are Banach
Stationary Lorentzian data specify the smooth metric, time orientation, future-directed convention and Killing field, without asserting a product end or complete flow. Stationary Lorentzian data and tensor conventions
A smooth vector field has its unique smooth local flow on an open time-space domain, with the flow law and inverse time maps wherever defined. The fundamental theorem on flows
An invertible differential gives a local smooth inverse. Near this is applied in an ambient chart after locally extending the embedded hypersurface across its boundary. The smooth inverse function theorem on manifolds
The weighted norm is the sum of the fixed compact-chart derivative and Hölder norms and the supremum of the scaled annular norms, with order- factor . Boundary values are continuous extensions. Weighted exterior elliptic domains and admissible weights
Differentiable Euclidean maps obey the total-derivative chain rule. Iterating it in coordinate charts gives the finite derivative expansions used for coordinate changes and flow composition. The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
A real function continuous on a closed interval and differentiable inside has increment bounded by interval length times its derivative supremum. It is applied to smooth coefficient functions on closed time intervals or coordinate segments; boundary formulas follow by continuity. The mean value theorem, as the case g(x) = x of Cauchy's: for f continuous on [a,b] with a < b and differentiable on (a,b) there is c ∈ (a,b) with f(b) - f(a) = f'(c)(b-a)
Proof
Given: The supplied slice, product-end data, bounds, chart choices and, when applicable, parameter hypotheses in the Statement.
Goal: Construct the timelike field and an open fixed-boundary admissible graph ball, with the stated uniformity.
The smooth future normal in [F2] can be extended off in embedded hypersurface charts, including boundary charts by local extension across the boundary. Shrinking their ambient neighborhoods preserves timelikeness. Use [F1] under [A1] to patch these extensions near any compact truncation containing the chosen core. On the slice every extension equals the same normal, so the patched field equals it there. The future timelike cone is convex: in a time-oriented orthonormal frame it is , and positive sums satisfy that inequality by the triangle inequality. Thus the patch remains future timelike. Choose the truncation and a smooth cutoff so its transition to lies inside the supplied product end; there both fields are future timelike. Their cutoff combination is a smooth future timelike , equal to the normal along a neighborhood of the core and equal to on a whole distant product tail. The normal extensions and cutoff use only a compact region, while the prescribed supplies the rest.
A timelike vector cannot be tangent to a spacelike hyperplane, so is transverse to . By [F6], is smooth near . Its differential there sends to and is invertible. Apply [F7] to obtain local flow coordinates, using local extensions across before restriction. Compactness gives a common small flow interval over every fixed compact truncation. On the tail where , uniqueness in [F6] identifies the flow with for every ; the full product ensures existence, and the spatial coordinate is unchanged. Thus there is one interval on all of .
Shrink to obtain global injectivity, including the overlap. If no such shrinking worked, there would be distinct pairs with and equal images. If both base points lie on the translation tail, equality of spatial coordinates and then of times forces the pairs to coincide. Otherwise a subsequence of one base sequence lies in a compact truncation, say . The inverse flow gives in . Since is embedded and , this is convergence in as well. Both pairs then lie in a single local flow chart from step 2.1, contradicting its injectivity. The flow law applies near on a uniform time interval, so this reasoning does not assume any bounded-coordinate behavior of a distant base sequence.
On the translation tail the exact graph formula gives [step 2.1] Consequently, for Euclidean spatial , . Choose with . Then implies on the whole tail. There is no height term here because the coefficients are stationary. For the sufficient single-metric instance in [F3], its hypotheses bound the components and slopes and its conclusion supplies far out. For the family example in the Statement, the exact formula for gives uniformly, since and all coefficient bounds are common. Increasing gives , where ; the time coefficient is negative there by the analogous bound. The remaining common component bounds follow from their displayed asymptotics.
The injective flow map also gives a topological embedding on a smaller slab, including at . To check the only extra boundary issue, choose nested compact truncations , with containing the whole nontranslation region. By embeddedness and compactness there is an ambient open neighborhood of with . Shrink the time interval so all flow displacements of points of by times of absolute value at most four times that interval stay in . If slab images approach an image based in , pass to a convergent subsequence of their bounded time coordinates. The inverse flow then places their base points eventually in , hence in . Compactness and injectivity identify their only possible base/time limit with the target pair. This proves inverse continuity there. At base points outside and away from , local flow coordinates are open ambient coordinates, so injectivity gives inverse continuity directly. Restricting to a still smaller open slab leaves room for the preceding time closures. Thus its graph restrictions have the subspace topology required for embeddings.
A small graph is spacelike on the compact part, with an explicit uniform estimate. In finitely many flow charts write . On a compact parameter interval and a closed smaller flow slab all its components and their derivatives are bounded, since is smooth and the metrics are jointly smooth. At its spatial restriction is positive definite; compactness and parameter continuity give a common lower eigenvalue for after shrinking the interval. Evaluation on the graph tangent vector gives . The mean value estimate in and the component bounds therefore give , with one for the finite cover. Choose these suprema small enough that the right side is at most . For a single metric use the same argument without the parameter.
Derive the required norm control from [F8], rather than attributing it to completeness. If is on the end with , choose , so and . For , each order- coordinate derivative satisfies . Since and , these coefficients are bounded on all such annuli. On the fixed compact core the derivative suprema through order one occur in . Any enlarged compact truncation in the proof is controlled in its finite charts by those fixed core charts and finitely many bounded-radius end annuli: the chain rule introduces only bounded first derivatives of fixed coordinate transitions on compact overlaps. Hence the global function supremum and all the needed compact-chart and end first-derivative suprema are bounded by for a finite constant depending only on the fixed data. Choosing small makes the height lie in the slab of step 4.1 and satisfies both steps 5.1 and 3.2.
For every such , the map is a embedding into the slab: its differential is injective and projection to is its continuous inverse. Composition with the smooth embedded slab map proves that is a embedding. In local charts, the chain rule through order four and the inequality give this composition regularity; the smooth flow derivatives are bounded on each compact coordinate image. On smaller convex coordinate patches the mean value estimate bounds smooth coefficient increments by their bounded first derivatives times the input increment. Steps 5.1 and 3.2 give spacelikeness. The induced-metric, normal and second-fundamental-form formulas of [F2] thus remain meaningful with local regularities , and respectively, by their algebraic formulas and one derivative of the normal. The identity fixes because . By [F4] the zero-trace domain is Banach, and its norm ball is open. In the family case remains future timelike on the compact slab after parameter shrinking by strict timelikeness and joint continuity; on the tail it is the supplied future timelike . The flow is fixed, hence its domain, injectivity and transversality are independent of the metric parameter, while steps 5.1 and 3.2 gave common positive lower metric bounds. This proves the full uniform graph claim.
Depends on
- Smooth partitions of unity exist on manifolds with boundary
- Normal graphs and the nonlinear mean-curvature map
- Induced metric and graph normal inherit the required weighted regularity
- Weighted Hölder spaces and their Dirichlet kernels are Banach
- Stationary Lorentzian data and tensor conventions
- The fundamental theorem on flows
- The smooth inverse function theorem on manifolds
- Weighted exterior elliptic domains and admissible weights
- The Axiom of Choice
- The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
- The mean value theorem, as the case g(x) = x of Cauchy's: for f continuous on [a,b] with a < b and differentiable on (a,b) there is c ∈ (a,b) with f(b) - f(a) = f'(c)(b-a)
Used by · 6
- Mean-curvature linearization, weighted regularity and fixed-boundary graph map
- Proper stationary projection for continued slices
- The mean-curvature graph map is a smooth finite-jet expression
- Stationary parameter families have a decaying reference-slice residual
- Stationarity supplies the weighted end differentiability estimates
- The global Dirichlet mean-curvature map is continuously differentiable
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.