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.
Scalar finite-element substructuring model
Definition
Fix a bounded, connected polygonal open set with a nonempty Dirichlet boundary segment. A finite subdomain partition is a family of connected polygonal open sets , , whose closures cover , whose interiors are disjoint, and for which () is a whole common side, a common vertex, or empty. The outer Dirichlet segment is a union of mesh boundary sides. The edge-adjacency graph of each triangulated subdomain is connected, and the subdomain adjacency graph is connected to the Dirichlet boundary. Each subdomain has a matching affine simplicial triangulation; the triangulations match on every shared side. The family has a fixed shape-regularity bound, quasiuniform mesh size , uniformly bounded polygon side count, corner angles bounded below, inradius comparable to , and a uniform interior-cone parameter. Write and .
Use continuous piecewise-affine () scalar functions on each triangulation. The reference-element and face-matching conventions are those of Reference finite elements and unisolvent degrees of freedom, Matching affine simplicial meshes and shape regularity, and Broken and conforming polynomial spaces on a matching mesh: local polynomials are affine, their nodal values determine them, and conforming functions have equal traces across a shared side. For each subdomain choose a coefficient , constant on but allowed to jump across interfaces. Its local energy is
The global finite-element space consists of the continuous piecewise-affine functions on the subdomain meshes that vanish on the outer Dirichlet boundary, with energy . Local interior degrees of freedom are the mesh vertices strictly inside ; local boundary degrees of freedom are its remaining vertices, with outer Dirichlet values fixed to zero. A floating local block means the same local energy before any outer-boundary values are fixed. A subdomain corner is a vertex of its polygonal boundary.
For uniform estimates, the fixed polygon-shape parameters include the scaled Lipschitz character: after rescaling each subdomain to diameter one, its boundary has a graph-chart cover with uniformly bounded chart count and Lipschitz constants and a uniformly positive neighborhood radius. The scaled mean-zero Poincaré constants are also included among these fixed shape parameters. A pointwise interior-cone bound alone is not a substitute for this uniform boundary-chart data. All constants in later two-dimensional estimates may depend on these polygon-shape, side-count, and mesh shape-regularity bounds, but not on , , the number of subdomains, or the positive numbers .
Depends on
Used by
- Discrete harmonic extension and interface Schur complement Definition
- Primal interface spaces and jump convention Definition
- A floating component without a constant-detecting primal constraint remains singular Example
- Two floating Poisson subdomains and primal anchoring Example
- Discrete Schur energy and the fractional trace norm Lemma
- Two-dimensional logarithmic edge cutoff estimates Lemma
- Two-dimensional scaled averaging energy bound Lemma
- Floating local kernels and positive interior blocks Theorem
- Static condensation is the exact interface problem Theorem
- The two-dimensional BDDC and FETI-DP polylogarithmic bound Theorem
Dependency tree · one level
3 results within one dependency step 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. 35–37, 83–89 (standard reference, not scraped)
- Oliver Rheinbach, Parallel Scalable Iterative Substructuring, Chapter 2, §§2.1–2.4 (standard reference, not scraped)