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.
Discrete Schur energy and the fractional trace norm
Statement
Let be one of the shape-regular polygonal subdomains in Scalar finite-element substructuring model, with a matching quasiuniform mesh. For any continuous piecewise-linear boundary trace , let be the Schur complement of the floating local stiffness matrix, before outer Dirichlet values are fixed, formed by the same interior elimination as in Discrete harmonic extension and interface Schur complement. Define
This seminorm is taken modulo constants. The floating local Schur energy satisfies
where depend only on the fixed scaled polygon-shape parameters (including boundary-chart and mean-zero Poincaré bounds), mesh shape-regularity and quasiuniformity. The upper bound is realized by a boundary-preserving finite-element lifting; the minimum-energy lifting is the floating discrete harmonic extension. For an admissible trace , whose outer Dirichlet values are zero, for the Dirichlet-restricted Schur matrix of Discrete harmonic extension and interface Schur complement, so the same inequalities hold for that matrix on its domain.
Facts & Assumptions
Given: A fixed polygonal subdomain, a shape-regular quasiuniform matching affine triangulation, an arbitrary boundary trace , and the floating local stiffness matrix.
Scalar finite-element substructuring model: the local energy is , and all geometric constants are uniform over the specified family.
Discrete harmonic extension and interface Schur complement: the Schur complement is formed by eliminating the invertible interior block; on admissible traces its harmonic lift has energy .
Discrete harmonic extension minimizes energy: for an admissible trace , its harmonic extension minimizes energy among all local finite-element lifts of .
Proof
On the upper half-plane, Fourier transformation in the tangential variable gives, for a smooth lift with trace , Indeed, integrate and apply . Integration in proves the trace seminorm bound. Conversely, has gradient energy . In a bounded chart, multiply the half-plane extension by a fixed cutoff in the inward coordinate; the added gradient term is controlled by the localized boundary norm, hence by the full H1/2 norm after constants are removed. A finite collection of Lipschitz graph charts covers the polygon boundary, including its corners. Flattening each chart is bi-Lipschitz, so it changes the gradient and boundary Gagliardo seminorm by bounded factors. Applying a partition of unity and the half-plane trace inequality to arbitrary chart-localized lifts gives . Subtract the domain mean of and use scaled Poincar'e to replace the full norm by . In the other direction, apply a partition of unity to boundary data, use the half-plane extensions, and sum to obtain a right inverse of the trace. First subtract a boundary constant; the fractional Poincaré bound on the whole boundary controls the localized full norms: for the boundary mean , , by integrating . Add that constant back as a constant lift, which has zero gradient. The chart count, scaled radii, Lipschitz constants and mean-zero Poincaré bounds are precisely the fixed shape parameters in [F1]; a pointwise interior-cone condition alone would not justify this uniformity.
Construct an interpolant as follows. For each interior mesh vertex choose one incident triangle and set its coefficient to the average of on that triangle. For each boundary vertex choose one incident boundary edge and set its coefficient to the integral of the trace of against the -dual function to the endpoint nodal basis on that edge. These dual functionals reproduce every affine edge trace, so the trace of is exactly whenever the trace of is . All coefficients reproduce constants. For a triangle , the chosen elements and edges for its vertices lie in a connected patch of diameter at most containing a uniformly bounded number of triangles; these patches have bounded overlap. Let be the mean of on . Scaled Poincaré gives , and the scaled trace inequality gives on a selected boundary edge . Thus each interior average coefficient of is bounded by . A boundary dual function has norm at most , so its coefficient has the same bound. Since and the affine basis functions have uniformly bounded gradient norms in two dimensions, . Summing and using bounded overlap proves .
For any finite-element lift of , step 1.1 gives . For the floating matrix, put . Symmetry of the local Poisson form and its zero interior row give . The positive interior block from [F2] therefore makes the unique fixed-trace minimum, by the same identity as [F3]. Taking that minimum gives the lower Schur bound. For the upper bound, step 1.1 supplies a continuous lift with gradient energy at most , and step 1.2 gives a boundary-preserving finite-element lift with the same bound up to a uniform factor. The just-proved floating minimality bounds its energy by this lift. Multiplication by proves both inequalities. If is admissible, the fixed-trace feasible lifts already vanish on the outer Dirichlet portion; [F2]–[F3] identify the same minimum with .
Depends on
Used by
Dependency tree · two levels
10 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. 24–26 (standard reference, not scraped)
- Oliver Rheinbach, Parallel Scalable Iterative Substructuring, Chapter 1 §1.7 and Chapter 2 §2.4 (standard reference, not scraped)