Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Multiplicative Schwarz projection sweeps contract with explicit overlap constants

Statement

Use the exact data of Finite-dimensional Schwarz subspace-correction data, with one coarse space V0 and m≥1 local spaces V1,…,Vm. Assume the stable-decomposition and synthesis hypotheses of Additive Schwarz condition bound from stable decomposition and synthesis hold with constants C0,C1. Suppose a symmetric matrix G=(ϵij)i,j=1m has nonnegative entries and ∣a(vi,vj)∣≤ϵij∥vi∥A∥vj∥A(vi∈Vi, vj∈Vj). For a real matrix M, write ∥M∥2=sup⁡y≠0∥My∥2/∥y∥2 for its induced Euclidean operator norm. Set ρ=∥G∥2 and K=1+2C1+2(1+ρ)2. For the coarse-first exact multiplicative sweep Emult=(I−Πm)⋯(I−Π1)(I−Π0), ∥Emult∥A2≤1−1C0K<1. The ordered factors need not commute. Here ∥S∥A=sup⁡x≠0∥Sx∥A/∥x∥A is the induced operator norm.

Facts & Assumptions

Given: The local spaces, exact projections, constants C0,C1, and pairwise overlap bounds ϵij in the statement.

[F1]

The error map is the ordered product of the exact local corrections, with the coarse correction applied first (Finite-dimensional Schwarz subspace-correction data).

[F2]

Each Πi is an A-orthogonal projection and ∥x∥A2=∥Πix∥A2+∥(I−Πi)x∥A2 (Exact Schwarz local corrections are energy-orthogonal projections).

[F3]

The additive projection sum T=∑i=0mΠi satisfies a(Tx,x)≥C0−1∥x∥A2 and a(Tx,x)≤C1∥x∥A2 (Additive Schwarz condition bound from stable decomposition and synthesis).

[F4]

In the real energy inner product, ∣a(u,v)∣≤∥u∥A∥v∥A (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A1]

Stable decomposition: every x has x=∑i=0mRizi with ∑iziTAizi≤C0∥x∥A2.

[A2]

Pairwise local overlap: the stated ϵij inequalities hold, and G is symmetric with nonnegative entries.

Proof

1.1F1F2givenconstruct

For an arbitrary initial error x, set e−1=x, d0=Π0x, and e0=x−d0. For i=1,…,m, set di=Πiei−1 and ei=ei−1−di. By [F2], each correction is orthogonal to its updated error, so telescoping gives D:=∑i=0m∥di∥A2=∥x∥A2−∥em∥A2. Also ei−1=x−d0−∑j=1i−1dj.

2.1F2F4A2step 1.1algebra

Fix a local index i≥1 and set bi=∥Πix∥A, ci=∥di∥A, and qi=∥Πid0∥A. Since x=ei−1+d0+∑j<idj and Πi is an orthogonal projection, a(Πix,ei−1)=a(Πix,Πiei−1)=a(Πix,di) and a(Πix,d0)=a(Πix,Πid0). Thus bi2=a(Πix,di)+a(Πix,Πid0)+∑j<ia(Πix,dj). The first term has absolute value at most bici and the second at most biqi by [F4]; the remaining terms are at most bi∑j<iϵijcj by [A2]. If bi=0 the resulting bound is immediate; otherwise divide by bi to obtain bi≤ci+qi+∑j<iϵijcj.

3.1A2F2F3step 2.1algebra

Let L be the strict lower-triangular part of G, and let b,c,q∈Rm have entries bi,ci,qi. They are nonnegative and 0≤Lc≤Gc entrywise. Hence ∥Lc∥2≤∥Gc∥2≤ρ∥c∥2, and step 2.1 yields ∥b∥2≤(1+ρ)∥c∥2+∥q∥2. Furthermore, by [F2], ∥q∥22=∑i=1ma(Πid0,d0)=a(∑i=1mΠid0,d0)≤a(Td0,d0)≤C1∥d0∥A2. The first inequality uses that Π0 is positive semidefinite; the last is [F3].

4.1F3step 1.1step 3.1algebra

By (r+s)2≤2r2+2s2, steps 1.1 and 3.1 give ∑i=0m∥Πix∥A2=∥d0∥A2+∥b∥22≤(1+2C1)∥d0∥A2+2(1+ρ)2∑i=1m∥di∥A2≤KD. The left side is a(Tx,x), which [F3] bounds below by C0−1∥x∥A2. Thus D≥(C0K)−1∥x∥A2. Since D≤∥x∥A2 by step 1.1, C0K≥1.

5.1F1step 1.1step 4.1algebra∎

Step 1.1 now gives ∥Emultx∥A2=∥em∥A2=∥x∥A2−D≤(1−1C0K)∥x∥A2. Taking the supremum over nonzero x proves the operator-norm bound; finiteness of C0,K makes the contraction factor strictly less than one.

Depends on

Used by

Dependency tree · two levels

18 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