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.

Inversion is uniformly stable on compact chart families

Statement

Let Kj be finitely many compact subsets of coordinate domains and let Gj(x) be continuous invertible real 4×4 matrix fields there. Given η>0, there is δ>0 such that any matrix fields G~j satisfying max⁡a,b∣G~j,ab(x)−Gj,ab(x)∣<δ on all Kj are invertible there and satisfy max⁡a,b∣(G~j−1)ab(x)−(Gj−1)ab(x)∣<η. No derivatives of the perturbation enter this assertion.

Statement references

Facts & Assumptions

[F1]

If U⊆R16 is open and every matrix in U has nonzero determinant, apply the matrix-inversion regularity lemma with m=16, n=4, r=1 to the identity matrix-valued map on U. Its entry functions have constant first partial derivatives, so inversion on U is C1, in particular continuous. Matrix inversion preserves Cᵏ regularity where the determinant is nonzero

[F3]

A coordinate domain is open in its manifold; its chart image is open in Euclidean space. Continuity means that the inverse image of a neighborhood is a neighborhood, equivalently that each open target neighborhood contains the image of some open source neighborhood. Apply this definition to the matrix fields on their coordinate domains with the usual topology on their sixteen real entries. Manifold charts, coordinate domains, and coordinate functions Continuity of a map of topological spaces at a point and globally

[F4]

For fixed finite size the determinant is a finite sum of signed products of entries, and a real square matrix is invertible exactly when its 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 finite square real matrix is invertible if and only if its determinant is nonzero

Proof

Given: The hypotheses in the Statement.

Goal: Establish the conclusions in the Statement.

1.1F3F4F5algebra

Identify M4(R) with R16 and write d∞(A,B)=max⁡a,b∣Aab−Bab∣. The inequalities d∞(A,B)≤∥A−B∥2≤4d∞(A,B) show that maximum-entry and Euclidean neighborhoods give the same topology. Each entry projection is continuous since its change is at most d∞(A,B). Thus [F4] and [F5] make determinant continuous. At a matrix A with nonzero determinant, continuity gives a neighborhood where ∣det⁡B−det⁡A∣<∣det⁡A∣/2, so the determinant stays nonzero. By [F4], GL4(R) is therefore open, independently of inversion.

2.1F1F3step 1.1

Apply [F1] to the open set GL4(R) from step 1.1. Inversion is continuous there, also for d∞. Consequently, for every invertible center matrix A and the given η>0, some r>0 has the following property: d∞(B,A)<2r implies that B is invertible and d∞(B−1,A−1)<η/2. Indeed, intersect an open neighborhood of A contained in GL4(R) with the inverse image under inversion of the radius-η/2 ball about A−1, and take a sufficiently small ball in that intersection.

3.1givenF3step 2.1

For each coordinate domain Uj, use all pairs (x,r) with x∈Kj and r>0 satisfying step 2.1 for A=Gj(x). The sets Vj,x,r={y∈Uj:d∞(Gj(y),Gj(x))<r} are open in Uj by continuity of Gj and cover Kj. This uses neighborhoods in the coordinate domain, without identifying that domain itself with a Euclidean open set. Using all admissible pairs requires no selection of a radius at every point.

4.1givenF2step 2.1step 3.1algebra∎

If every Kj is empty, take δ=1. Otherwise, [F2] gives a finite indexed subcover of each nonempty Kj from step 3.1. Set δ>0 to the minimum of the associated finitely many positive radii over the finitely many j. For y∈Kj choose a selected Vj,x,r containing it. Then d∞(Gj(y),Gj(x))<r and d∞(G~j(y),Gj(x))<δ+r≤2r. Step 2.1 makes both matrices invertible and puts both inverses within η/2 of Gj(x)−1. The triangle inequality gives d∞(G~j(y)−1,Gj(y)−1)<η. Empty sets impose no restriction, and no continuity or derivatives of the perturbation were used.

Depends on

Used by · 3

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.