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.
The simple-fold complement restriction is an isomorphism
Statement
For the data and notation of Complement splitting and range projection for a simple fold, is a linear isomorphism. The map satisfies
Facts & Assumptions
Given: and their hypotheses in Complement splitting and range projection for a simple fold.
Rank-nullity: : for a map between finite-dimensional spaces, .
In finite dimension, and : in finite-dimensional inner-product spaces.
If and is a linear subspace of , then is finite-dimensional, , and if and only if : subspaces of equal finite dimension are equal; The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial: a linear map is injective exactly when its kernel is zero.
Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, and Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis: independence means a zero linear combination has only zero coefficients, a basis is an independent spanning set, and dimension is the size of a finite basis.
Rank and nullity of a linear map with finite-dimensional domain: rank of a map with finite-dimensional domain is the dimension of its image.
Proof
Given: The fold data in Complement splitting and range projection for a simple fold.
Since is unit it is nonzero. If , then , so ; thus is independent, and it spans by definition. It is therefore a basis and that span has dimension one by [F5]. The orthogonal-complement formula [F2] gives .
Since , the map is onto . Rank-nullity [F1] and [F4] give ; [F4] also gives .
Since , direct multiplication gives . Also , so , while for every ; hence . The equation is equivalent to , so .
From we have , and has rank by [F6]. Thus , so [F3] gives . Moreover, if , then and , so is injective by [F3]. Its image has dimension by [F1] and therefore equals by [F3]. This proves that is an isomorphism.
Finally , and by the definitions.
Depends on
- Complement splitting and range projection for a simple fold
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- Rank and nullity of a linear map with finite-dimensional domain
- In finite dimension, $W^{\perp\perp}=W$ and $\dim W+\dim W^\perp=\dim V$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
Used by
Dependency tree · two levels
49 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
- Eugene L. Allgower and Kurt Georg, Numerical Continuation Methods: An Introduction, Springer Series in Computational Mathematics 13 (1990) (standard reference, not scraped)
- K. A. Cliffe, A. Spence, and S. J. Tavener, The numerical analysis of bifurcation problems with application to fluid mechanics, Acta Numerica 9 (2000), 39–131 (standard reference, not scraped)