Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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