Alphabeta Math
Pipeline-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.

✓ 5 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 5 also cleared it.

Overlapping Schwarz and stable subspace decompositions — Examples

1 · Prerequisites

2 · Summary

The examples compute the exact condition number of one-level point-patch Schwarz on a uniform 1D Poisson mesh, show a two-level coarse correction with a uniform finite-dimensional bound, and distinguish deterioration of a sufficient overlap estimate from a claim about actual conditioning. The graph counterexample shows that a one-node coarse space can miss a high-conductance channel despite a fixed overlap graph. The inexact example computes how local spectral-equivalence constants enter the additive bound. The overlap-shrinking example assumes Countable Choice, matching the structured stable-decomposition theorem it uses.

\begin{tikzpicture}[x=1.15cm,y=1cm]
  \draw (0,0) circle (0.22);
  \draw (2,0) circle (0.22);
  \node at (0,0) {$u_1$};
  \node at (2,0) {$u_2$};
  \draw[thick] (0.22,0) -- node[above] {$\alpha$} (1.78,0);
  \draw (0,-0.22) -- (0,-0.65);
  \draw (-0.2,-0.65) -- (0.2,-0.65);
  \draw (2,-0.22) -- (2,-0.65);
  \draw (1.8,-0.65) -- (2.2,-0.65);
  \node[below] at (0,-0.72) {$1$};
  \node[below] at (2,-0.72) {$1$};
\end{tikzpicture}

The two grounding edges have conductance 1 and the connecting edge has conductance α, giving the matrix I2+α(1−1−11) in A one-node coarse space misses a high-conductance channel. The diagram records the graph used in the exact calculation; the counterexample proof is algebraic.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The stable-splitting guarantee worsens as overlap shrinks

Example

Assume Countable Choice. For any admissible overlap radius δ in the structured family of Stable two-level P1 decomposition for structured Poisson meshes, put r=H/δ. Substitution into the proved stable-decomposition guarantee gives C0≤CFE(1+r2). Along admissible families with δ/H→0, this upper-bound formula grows. This substitution does not assert that the actual stable constant or condition number must diverge.

Facts & Assumptions

Given: Countable Choice and a member of the structured P1 Poisson family of Stable two-level P1 decomposition for structured Poisson meshes and its admissible overlap radius δ.

[F1]

The theorem proves C0≤CFE(1+(H/δ)2), with CFE independent of h, H, and δ (Stable two-level P1 decomposition for structured Poisson meshes).

Verification

1.1F1givenalgebra

Put r=H/δ. Substituting into [F1] gives C0≤CFE(1+r2).

2.1step 1.1givenalgebra∎

To exhibit admissible radii with δ/H→0, fix M,d, put a=1/M, choose q0=⌈d⌉, and take δ=q0a/n as n→∞ with n≥q0. Then h=d a/n≤δ≤a, and r=H/δ=d n/q0→∞. The right side of the one-sided upper-bound formula grows; it supplies no lower estimate on the actual stable constant or condition number.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

One-level point-patch Schwarz loses uniformity on 1D Poisson

Example

For the uniform N-interval P1 discretization of the Dirichlet Poisson problem on (0,1), one-level exact point-patch additive Schwarz has κA(BA)=1+cos⁡(π/N)1−cos⁡(π/N). The patches are the supports of the interior nodal hats; they overlap with their neighbors and have bounded multiplicity. Nevertheless the condition number diverges with the number N−1 of local spaces.

Facts & Assumptions

Given: An integer N≥2, h=1/N, the fine-grid P1 basis ϕ1,…,ϕN−1 with x0=xN=0, and the explicitly defined Dirichlet matrix AN=h−1tridiag⁡(−1,2,−1), whose diagonal entries are 2/h and whose first off-diagonal entries are −1/h.

[F1]

Finite-dimensional Schwarz subspace-correction data: for injections Ri and SPD local matrices Ai, the exact one-level additive preconditioner is B=∑iRiAi−1RiT.

Verification

1.1F1givenalgebra

Direct expansion gives xTANx=h−1∑j=1N(xj−xj−1)2 with x0=xN=0. It is positive for every nonzero vector because vanishing of all successive differences and x0=0 forces every xj=0. For the point-patch injection Ri=ei, the local matrix is Ai=eiTANei=2/h. Thus [F1] gives BN=∑iei(h/2)eiT=(h/2)I. Each corresponding nodal hat is supported on two adjacent mesh intervals, so neighboring local supports overlap and at most three closed supports meet at a point.

2.1givenstep 1.1algebra

For k=1,…,N−1, set vj(k)=sin⁡(jkπ/N) for j=0,…,N. The endpoints vanish. With θ=kπ/N, the identity vj−1(k)+vj+1(k)=2cos⁡(θ)vj(k) gives ANv(k)=2h(1−cos⁡θ)v(k). These eigenvalues are distinct because cosine is strictly decreasing on (0,π). Since AN is symmetric, eigenvectors for distinct eigenvalues are orthogonal: for k≠l, (λk−λl)(v(k))Tv(l)=(ANv(k))Tv(l)−(v(k))TANv(l)=0. The vectors are nonzero, so the N−1 orthogonal vectors form a basis of RN−1. Multiplication by BN=(h/2)I gives eigenvalues 1−cos⁡(kπ/N) for BNAN.

3.1step 2.1algebra∎

The smallest and largest values occur at k=1 and k=N−1, respectively. Therefore κA(BNAN)=1−cos⁡((N−1)π/N)1−cos⁡(π/N)=1+cos⁡(π/N)1−cos⁡(π/N). As N→∞ the numerator tends to 2 and the positive denominator tends to 0, so the condition numbers diverge.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A one-node coarse space misses a high-conductance channel

Statement refuted

A bounded-size one-node coarse space, together with bounded-overlap exact local solves, guarantees an additive Schwarz condition number uniform in every positive diffusion contrast.

Facts & Assumptions

Given: A contrast parameter α>0, global space V=R2, a coarse space V0=span⁡{e1}, and one local space V1=span⁡{e2}.

[F1]

For full-column-rank prolongations, the exact additive preconditioner is B=∑iRiAi−1RiT with Ai=RiTARi (Finite-dimensional Schwarz subspace-correction data).

Counterexample

1.1F1givenalgebra

The grounded two-node graph with unit conductance from each node to ground and conductance α between the nodes has matrix Aα=I2+α(1−1−11). For x=(x1,x2), xTAαx=x12+x22+α(x1−x2)2, so Aα is SPD. The coarse and local injections are R0=e1 and R1=e2, hence A0=A1=1+α. The additive preconditioner from [F1] is therefore Bα=(1+α)−1I2. There is one local subspace, so its pairwise overlap matrix is the fixed 1×1 matrix [1], independent of α.

2.1step 1.1algebra∎

The vectors (1,1) and (1,−1) are eigenvectors of Aα with eigenvalues 1 and 1+2α. Thus BαAα has eigenvalues (1+α)−1 and (1+2α)/(1+α), so κA(BαAα)=1+2α→∞. The low-energy channel vector (1,1) is not in the one-node coarse space V0, and the growing condition number disproves the claim.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A uniform two-level 1D Poisson correction bound

Example

Let N=2M with M≥2 on the uniform fine P1 Dirichlet mesh of (0,1). Take the coarse P1 space on the even nodes and one local space span⁡{ϕ2k−1} for each odd node. The exact two-level additive Schwarz operator has C0≤2, C1≤2, and hence κA(BA)≤4, independently of M.

Facts & Assumptions

Given: The uniform mesh with step h=1/N, the fine stiffness energy a(u,u)=h−1∑j=1N(uj−uj−1)2 with u0=uN=0, the coarse space through the even nodes, and odd-node local spaces.

[F1]

The additive Schwarz condition theorem gives κA(BA)≤C0C1 for the stable and synthesis constants of the chosen subspaces (Additive Schwarz condition bound from stable decomposition and synthesis).

[F2]

Finite-dimensional Schwarz subspace-correction data: a subspace prolongation Ri has local energy matrix Ai=RiTARi and exact additive preconditioner B=∑iRiAi−1RiT.

Verification

1.1givenconstruct

Given a fine vector u, let uH be its coarse nodal interpolant: (uH)2k=u2k and (uH)2k−1=(u2k−2+u2k)/2. Define ηk=u2k−1−(u2k−2+u2k)/2 and uk=ηkϕ2k−1. Nodal values give u=uH+∑k=1Muk.

1.2givenalgebra

On each fine interval, at most one odd nodal hat has nonzero derivative. Thus only the coarse derivative and at most one local derivative can be nonzero there. The elementary inequality (s+t)2≤2(s2+t2), which follows from (s−t)2≥0, and integration give ∥v0+∑kvk∥A2≤2(∥v0∥A2+∑k∥vk∥A2). Hence C1≤2.

2.1givenstep 1.1algebra

On each pair of fine intervals set ak=u2k−1−u2k−2 and bk=u2k−u2k−1. The coarse energy on that coarse interval is (ak+bk)2/(2h)≤(ak2+bk2)/h, exactly its fine energy contribution. Summing over k gives ∥uH∥A2≤∥u∥A2.

2.2step 1.1algebra

Since ηk=(ak−bk)/2 and (ak−bk)2≤2(ak2+bk2), the local energy is ∥uk∥A2=2ηk2/h≤(ak2+bk2)/h. Summing gives ∑k∥uk∥A2≤∥u∥A2. The decomposition in step 1.1 therefore has total energy at most 2∥u∥A2, so C0≤2.

3.1F1F2step 2.2step 1.2algebra∎

Apply [F1] to the exact Schwarz data [F2] with C0≤2 and C1≤2 to obtain κA(BA)≤4. This finite one-dimensional split has a global coarse space; higher-dimensional overlap estimates are handled separately on the A page.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Inexact local solves enter through spectral-equivalence constants

Example

Take A=I2 and the two coordinate subspaces. Exact local matrices are A1=A2=1, so the exact preconditioner is B=I2 and its condition number is 1. Choose inexact local matrices A~1=4 and A~2=1/2. They satisfy 14Ai⪯A~i⪯4Ai, while B~=diag⁡(1/4,2) and κA(B~A)=8. The theorem's bound is (β/α)C0C1=16.

Facts & Assumptions

Given: A=I2, Vi=span⁡{ei} for i=1,2, and the inexact local matrices above.

[F1]

The additive Schwarz theorem gives κA(B~A)≤(β/α)C0C1 under αAi⪯A~i⪯βAi (Additive Schwarz condition bound from stable decomposition and synthesis).

[F2]

The Schwarz definition gives B=∑iRiAi−1RiT and B~=∑iRiA~i−1RiT (Finite-dimensional Schwarz subspace-correction data).

Verification

1.1F2givenalgebra

The coordinate decomposition is stable with C0=1, and its synthesis bound is C1=1 because ∥z1e1+z2e2∥22=z12+z22. Exact local matrices equal 1, so [F2] gives B=I2 and condition number 1.

1.2F2givenalgebra

The inexact local inverses are 1/4 and 2, so [F2] gives B~=diag⁡(1/4,2). Its eigenvalues are 1/4 and 2, hence κA(B~A)=8. The choices α=1/4 and β=4 satisfy the local order bounds.

2.1F1step 1.1step 1.2algebra∎

Substitution of C0=C1=1, α=1/4, and β=4 into [F1] gives the rigorous upper bound 16, which contains the directly computed value 8.

Sources