Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 harmonic extension and interface Schur complement

Definition

Use the interior/interface ordering of Scalar finite-element substructuring model. The boundary-trace spaces Wi, W=∏iWi, the conforming space W^, the partially assembled space W~, and the inclusion R:W^→W are those of Primal interface spaces and jump convention. In particular, R identifies the copies of a conforming interface trace. In subdomain i, write its stiffness matrix as

Ki=(KII(i)KIΓ(i)KΓI(i)KΓΓ(i)).

By Floating local kernels and positive interior blocks, KII(i) is positive definite when nonempty; on the zero-dimensional interior space its unique endomorphism is invertible. For admissible boundary trace gi, the discrete harmonic extension is

Higi:=(−(KII(i))−1KIΓ(i)gigi).

The local interface Schur complement is

Si:=KΓΓ(i)−KΓI(i)(KII(i))−1KIΓ(i).

This is the Schur complement in Block LU factorisation and the associated Schur complement. The local Schur form on a trace is giTSigi. The block identity and the associated block LU factorization use An invertible leading block yields block LU through its Schur complement with leading block KII(i). Assembling local Schur forms on W^ gives S^=RT(diag⁡iSi)R; restricting the same block-diagonal form to W~ gives the partially assembled operator S~.

Depends on

Used by

Dependency tree · two levels

12 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