Alphabeta Math
ExampleConstruction: 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.

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.

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