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.
Ellipticity and zero-slope forcing of the stationary maximal flux
Statement
Fix , , a bounded annulus with , and . For , let be a smooth symmetric Lorentzian metric matrix of signature , independent of the time coordinate. Write for its inverse entries, , , , and , with spatial indices summed from to . Assume, uniformly in and on , that , , and have common zeroth-order bounds . Define . Then is symmetric, with for positive constants depending only on .
If, in addition, , then has common joint bounds in on this fixed product domain, depending only on .
For the zero-slope conclusion, assume has a common bound and . Then, with the derivatives taken at fixed , satisfies , where depends only on . The preceding uniform hypothesis on supplies the required bound on ; the zeroth-order hypotheses alone do not.
Facts & Assumptions
The Lorentzian and stationary flow-graph conventions are those of the graph definition; maximality means zero mean curvature. This lemma proves analytic properties of the specified flux. Identifying that flux with a particular graph equation is a separate application. Normal graphs and the nonlinear mean-curvature map
Coefficient norms are ordinary Euclidean Hölder norms, applied componentwise; joint norms differentiate in both and . The parameter is not a differentiation variable. Hölder spaces C^k,α, closure and interior scaled norms, and C^k,α domains
For composable totally differentiable Euclidean maps, . It applies to the smooth coefficient maps here, repeatedly through order four. The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
Scalar sums, products, quotients with nonzero denominator, compositions and positive integer powers have their usual derivative rules. Apply these rules on coordinate lines and iterate for partial derivatives. Sum, product, quotient, and chain rules from difference quotients
Matrix inversion preserves every finite class where the determinant is nonzero, and the determinant is a fixed finite polynomial in the matrix entries. Matrix inversion preserves Cᵏ regularity where the determinant is nonzero For every fixed finite size at least one, the determinant of a real square matrix is a polynomial in its matrix entries
A scalar function on an interval with bounded derivative is Lipschitz with that bound; it applies to restrictions along the piecewise smooth paths used below. If f is continuous on an interval I and |f'| ≤ M at every interior point, then |f(x) - f(y)| ≤ M|x-y| for all x,y ∈ I, so f is Lipschitz with constant M and uniformly continuous on I
For a square matrix over a commutative ring with invertible determinant, . Apply this to the real matrices , whose determinants are nonzero by the Lorentzian hypothesis. If det(A) is a unit, then A⁻¹=det(A)⁻¹adj(A)
Proof
Given: The hypotheses in the Statement, retaining the additional regularity hypotheses for the corresponding conclusions.
Goal: Prove uniform ellipticity, coefficient regularity and the differentiated zero-slope estimate.
Fix and put . Symmetry of gives . The scalar derivative rules and chain rule give . This is symmetric. For every , . The zeroth-order bounds and fixed slope ball bound above and in norm; also and . Thus this lower bound is uniform and positive, and the displayed formula gives a uniform upper bound.
Assume the additional bound on . By [F5], inversion is smooth on the invertible locus and determinant is polynomial. The identities and , together with [F4], give all higher derivatives of and for . Their derivatives of any fixed order are bounded when is bounded away from zero and above. The bound on gives . The cofactor-over-determinant formula in [F7] expresses every derivative of inversion in the matrix entries as a polynomial numerator divided by a power of the determinant. Bounded matrix entries and this determinant lower bound therefore give common bounds on these derivatives, also on a fixed neighborhood of the matrix values; polynomial increment estimates keep the determinant away from zero on that neighborhood. Repeated use of [F3] and [F4], and , expresses every mixed derivative of through order four as a finite sum of bounded coefficient functions times derivatives of of order at most four and bounded slope monomials. This proves the required derivative supremum bounds.
For scalar factors, gives . The same identity iterates over finite products. Lower-order derivatives of are uniformly Lipschitz on : two points can be joined by a radial segment and a shorter circular arc at the smaller radius, of total length at most times their Euclidean distance; use [F3] and [F6] on these path pieces with the next-derivative bound. On the product domain the slope points can additionally be joined by a straight segment. Thus these lower derivatives have common Hölder bounds on the bounded domain. The smooth coefficient functions from step 1.2 are uniformly Lipschitz as functions of the bounded matrix entries and slopes: their derivatives are bounded on a common neighborhood, so nearby pairs use a straight segment and [F6], while separated pairs use their supremum bounds. Applying the product inequality to the differentiated expressions in step 1.2, using the assumed Hölder bound on fourth derivatives of , proves the joint bound. The identical argument through order three at , where , bounds uniformly under the additional metric hypothesis.
For the zero-slope estimate use its explicit hypotheses on , whether supplied directly or obtained for in step 2.1. Since , one has . Differentiating this formula at most twice gives only finite products of derivatives of and of order at most three. The lower-order Hölder control and product inequality of step 2.1 yield . All constants are independent of . The graph terminology in [F1] imposes no additional equation in this analytic proof.
Depends on
- Normal graphs and the nonlinear mean-curvature map
- Hölder spaces C^k,α, closure and interior scaled norms, and C^k,α domains
- The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
- Sum, product, quotient, and chain rules from difference quotients
- Matrix inversion preserves Cᵏ regularity where the determinant is nonzero
- For every fixed finite size at least one, the determinant of a real square matrix is a polynomial in its matrix entries
- If f is continuous on an interval I and |f'| ≤ M at every interior point, then |f(x) - f(y)| ≤ M|x-y| for all x,y ∈ I, so f is Lipschitz with constant M and uniformly continuous on I
- If det(A) is a unit, then A⁻¹=det(A)⁻¹adj(A)
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.