Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-11
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 C1 map uniformly close to the identity derivative sandwiches a cube between contracted and expanded cubes

Statement

Let n≥1, let C(a,r)={x:∥x−a∥∞≤r} with r>0, let W⊆Rn be convex and open with C(a,r)⊆W, and let F:W→Rn be C1. Assume F(a)=a and, for some 0≤q<1, ∥(DF(z)−I)v∥2≤qn∥v∥2 for every z∈W and v∈Rn. Then C(a,(1−q)r)⊆F(C(a,r))⊆C(a,(1+q)r). Moreover, F is injective on C(a,r).

Facts & Assumptions

Given: The cube, the C1 map, and the strict derivative error bound in the statement.

[L4]

The Euclidean and sup norms satisfy ∥w∥∞≤∥w∥2≤n∥w∥∞ (Each ∥⋅∥p is a norm on Rn, and the induced metrics are exactly d1, d2 and d∞ of the published metric-spaces page).

Proof

technique · fixed-point
1.1

Put R=F−I and use [L1] with the Euclidean--sup norm comparison [L4] to obtain the contraction estimate ∥R(x)−R(y)∥∞≤q∥x−y∥∞ on the cube. In particular ∥R(x)∥∞≤qr, so F(x)=x+R(x) lies in C(a,(1+q)r).

L1L4given
2.1

Fix z∈C(a,(1−q)r) and define Sz(x)=z−R(x). Step 1.1 gives Sz(C(a,r))⊆C(a,r) and makes Sz a q-contraction. The cube is a nonempty closed subset of complete Euclidean space, so [L2]--[L3] give x∈C(a,r) with Sz(x)=x, equivalently F(x)=z. This proves the inner containment.

L2L3step 1.1
3.1

If F(x)=F(y), then x−y=R(y)−R(x), so step 1.1 gives ∥x−y∥∞≤q∥x−y∥∞. Since q<1, x=y. The assumptions r>0 and q<1 are essential to the nondegenerate fixed-point argument.

step 1.1algebra∎

Depends on

Used by

Dependency tree · two levels

67 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources