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.
Complementary primal and dual projections share nonunit spectrum
Statement
Let be finite-dimensional real vector spaces, let be symmetric positive definite, and let , satisfy for and . Then the operators
have the same eigenvalues, with the same multiplicities, except possibly at the eigenvalue .
Facts & Assumptions
Given: Finite-dimensional spaces, symmetric positive definite, and the four displayed left-inverse and complementary-projection identities.
Proof
The products and act on and , respectively. Set and . By the given hypotheses, , , and . Expanding the products gives and . In detail, ; also .
If satisfies with , then , so . The identity gives , hence . For , the reverse map is ; the same identities show it is the inverse on the -eigenspaces. Thus these eigenspaces are isomorphic.
Choose bases of the finite-dimensional spaces and their dual bases. Both operators are diagonalizable: and are positive definite, so, writing , is similar to the symmetric positive definite product ; likewise is similar to , where . The left-inverse identities make injective and surjective, proving each factor is positive definite. Therefore equal eigenspace dimensions from step 2.1 give equal algebraic multiplicities for every .
Remarks
Coefficient-scaled averaging and BDDC: for BDDC, , , and .
FETI-DP dual system and preconditioner: for FETI-DP, , , , and .
Depends on
Used by
Dependency tree · two levels
5 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
- Jan Mandel and Bedřich Sousedík, BDDC and FETI-DP under Minimalist Assumptions, §4, Lemmas 4.1–4.2 (standard reference, not scraped)
- Olof B. Widlund, Introduction to the Design and Theory of Domain Decomposition Algorithms, DD20 Tutorial, pp. 90–93 (standard reference, not scraped)