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.
Primal constraints remove local floating kernels
Statement
Assume the hypotheses of Primal interface spaces and jump convention and the energy setting of Floating local kernels and positive interior blocks. If each floating local component has at least one primal vertex value fixed in its dual subproblem, its local dual stiffness is positive definite. If all subdomain vertices are primal and the global Dirichlet boundary is nonempty, the partially assembled interface energy is positive definite; hence the BDDC and FETI-DP exact local and coarse solves are well-defined.
Facts & Assumptions
Given: A conforming finite partition with connected subdomain adjacency, a nonempty global Dirichlet boundary, and primal constraints containing every subdomain vertex for the PE26 branch.
Floating local kernels and positive interior blocks: each connected floating local energy has kernel exactly the constants.
Primal interface spaces and jump convention: shares primal corner values and is the fully continuous trace space.
Discrete harmonic extension and interface Schur complement: and ; restricts to . The interior inverse includes the empty-space convention established there.
Proof
From [F3], block multiplication gives and therefore . Thus a zero local Schur energy is precisely zero energy of its harmonic lift. In a local dual subproblem the primal values are prescribed, so a zero-energy local vector, or the harmonic lift of a zero-energy dual trace, is constant by [F1]. A primal corner value is among its prescribed values; because the dual correction has zero primal values, that constant is zero. The local dual quadratic form therefore has trivial kernel and, being symmetric positive semidefinite, is positive definite.
For , [F3] and step 1.1 give . Each summand is a nonnegative local energy. If the partially assembled energy is zero, every summand is zero, so [F1] makes each local harmonic extension constant on its subdomain. Neighboring local constants agree at their shared primal corner. The adjacency graph is connected, so all constants agree; the global Dirichlet boundary makes the common value zero. Thus the partially assembled trace is zero, and its assembled energy matrix is positive definite.
The BDDC local dual solves use the positive local restrictions from step 1.1 and its coarse solve uses the positive partially assembled energy from step 2.1. The FETI-DP operator uses the same invertible partially assembled energy and the jump quotient of [F2]. Hence the exact local, coarse and dual systems named in the Statement are well-defined.
Depends on
Used by
- Coefficient-scaled averaging and BDDC Definition
- FETI-DP dual system and preconditioner Definition
- A floating component without a constant-detecting primal constraint remains singular Example
- Two floating Poisson subdomains and primal anchoring Example
- BDDC is the constrained partial-energy minimizer Proposition
- FETI-DP is the exact dual Schur system Proposition
Dependency tree · two levels
6 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
- Olof B. Widlund, Introduction to the Design and Theory of Domain Decomposition Algorithms, DD20 Tutorial, pp. 83–86 (standard reference, not scraped)
- Oliver Rheinbach, Parallel Scalable Iterative Substructuring, Chapter 2, §§2.1–2.3 (standard reference, not scraped)