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.

✓ 4 results · all verified · 3 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Nonlinear full-approximation multigrid — Examples

1 · Prerequisites

2 · Summary

These examples compute the tau correction for a nonlinear reaction-diffusion discretization, show a fine-root failure when tau is omitted, verify the exact linear correction reduction on a two-dimensional matrix, and track the certified local contraction radius through a pitchfork bifurcation. Each calculation is finite-dimensional and uses the hypotheses stated on the companion A page. None asserts an arbitrary-start nonlinear FAS convergence result.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The tau term recovers the restricted root in reaction Poisson

Statement

For the finite-difference semilinear reaction operator Fh(u)=Au+(u13,u23) with A=(2−1−12), take P=(1,1)T, Iu=(u1+u2)/2, R=PT, and the Galerkin coarse operator FH(v)=PTFh(Pv)=2v+2v3. For the manufactured fine root u∗=(1,0) and fh=Fh(u∗), the tau correction is −3/4 and the exact coarse branch returns Iu∗=1/2, so the corrected fine iterate is still u∗.

Facts & Assumptions

Given: The two residual maps, the transfers, u∗=(1,0), and fh=Fh(u∗).

[F1]

Finite-budget nonlinear FAS two-grid cycle: the coarse target is FH(Iu)+R(fh−Fh(u))=Rfh+τ(u), where τ(u)=FH(Iu)−RFh(u), and the fine correction is u+P(v−Iu).

[F2]

An exact fine root is fixed by the FAS V/W cycle: if the smoother fixes the fine root and the exact coarse solver selects its restriction at zero defect, FAS leaves the root fixed.

Example

Given: Exact real arithmetic and the direct coarse root v=1/2 on the selected branch.

Verification

1.1givenalgebra

Direct multiplication gives Au∗=(2,−1) and (u∗,13,u∗,23)=(1,0), so fh=Fh(u∗)=(3,−1). The restricted iterate is Iu∗=1/2, while Rfh=3−1=2.

2.1F1step 1.1algebra

The Galerkin coarse value at the restricted iterate is FH(1/2)=1+1/4=5/4. Thus [F1] gives τ(u∗)=FH(Iu∗)−RFh(u∗)=5/4−2=−3/4 and the tau-corrected coarse right side is Rfh+τ(u∗)=2−3/4=5/4.

3.1givenF2step 1.1step 2.1algebra∎

Since FH(1/2)=5/4, the exact selected coarse solution is v=Iu∗=1/2. Therefore P(v−Iu∗)=0 and the fine correction leaves u∗ unchanged; the pre/post residual smoothers also leave it fixed because Fh(u∗)=fh. This is the instance of [F2] with the actual tau value verified above.

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

Omitting tau can move an exact fine root

Statement refuted

The claim that replacing the tau-corrected coarse right side by the restricted fine right side Rfh always preserves an exact fine-grid root is false.

Facts & Assumptions

Given: The two-dimensional fine residual Fh(u)=Au with A=(2−1−12), right side fh=A(1,0)T, prolongation P=(1,1)T, iterate restriction Iu=(u1+u2)/2, residual restriction R=PT, and rediscretized coarse residual FH(v)=3v.

[F1]

Finite-budget nonlinear FAS two-grid cycle: the FAS coarse right side includes FH(Iu)+R(fh−Fh(u)) and the prolongated update is u+P(v−Iu).

[F2]

An exact fine root is fixed by the FAS V/W cycle: with the tau-corrected right side and the selected zero-defect coarse root, an exact fine root is fixed.

Counterexample

1.1givenalgebra

Set u∗=(1,0)T. Then fh=Au∗=(2,−1)T, so u∗ is an exact fine root. Its restriction is Iu∗=1/2 and the restricted right side is Rfh=2−1=1.

2.1F1step 1.1algebra

With tau omitted, the coarse equation is 3v=Rfh=1, whose exact solution is v=1/3. The fine correction is u∗+P(v−Iu∗)=(1,0)T+(1,1)T(1/3−1/2)=(5/6,−1/6)T, which is not u∗. Thus the false claim fails for this SPD fine system and this specified rediscretized coarse operator.

3.1F1F2step 1.1algebra∎

For the same inputs, the correct tau is FH(Iu∗)−Rfh=3/2−1=1/2, so the tau-corrected coarse right side is 3/2 and its selected root is v=1/2=Iu∗. The resulting correction is zero, in accord with [F2].

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

The certified FAS contraction radius shrinks at a pitchfork

Statement

For Fμ(x,y)=(μx+x3,y) with zero right side, use the coarse space spanned by (0,1)T, iterate and residual restriction I(x,y)=R(x,y)=y, coarse residual FH(v)=v, and one pre- and one post-sweep Sμ(x,y)=(x−12(μx+x3),y/2). The exact-branch FAS cycle has root (0,0) and derivative norm qμ=(1−μ/2)2(0<μ≤1). For each such μ, the local theorem certifies radius rμ=μ/100, which tends to zero as the pitchfork parameter approaches 0.

Facts & Assumptions

Given: 0<μ≤1, the two-dimensional fine residual, zero right side, the stated transfers and coarse residual, one pre/post smoother, exact coarse solve, and exact arithmetic.

[F1]

Finite-budget nonlinear FAS two-grid cycle: the coarse target is FH(Iu)+R(−Fμ(u)) and the correction is u+P(v−Iu).

[F2]

A smooth FAS cycle converges locally under its actual derivative bounds: if the actual exact-branch cycle has root derivative norm q, derivative-Lipschitz constant L on a radius-r ball, and q+Lr/2<1, then its iterates converge to the root from that ball.

[F4]

Second derivative formula for a composed cycle map: applying the second-derivative composition formula with identity middle map gives (sμ∘sμ)′′=sμ′′(sμ)(sμ′)2+sμ′(sμ)sμ′′.

Example

Given: The scalar function sμ(x)=(1−μ/2)x−x3/2, the radius rμ=μ/100, and the exact coarse branch.

Verification

1.1F1givenalgebra

Let P(v)=(0,v)T. For any pre-smoothed (x,y), [F1] gives gH=FH(y)+R(−Fμ(x,y))=y−y=0. The exact coarse solution is v=0, so prolonging v−I(x,y)=−y sets the second fine coordinate to zero. The following post-sweep leaves it zero. Hence the actual cycle map is Eμ(x,y)=(sμ(sμ(x)),0).

1.2givenF3F4algebra

Write a=1−μ/2 and r=rμ≤0.1. For ∣x∣≤r, ∣sμ(x)∣≤r+12r3≤1.005r,∣sμ′(x)∣≤1.015,∣sμ′(sμ(x))∣≤1.02, and ∣sμ′′(x)∣≤3r, ∣sμ′′(sμ(x))∣≤3.015r. By [F4], (sμ∘sμ)′′=sμ′′(sμ)(sμ′)2+sμ′(sμ)sμ′′, so these bounds give ∣(sμ∘sμ)′′(x)∣<7r. The derivative matrix of Eμ is diag⁡((sμ∘sμ)′(x),0), so [F3] gives ∥DEμ(z)−DEμ(z′)∥op≤7r∥z−z′∥2 on the ball.

2.1givenstep 1.1algebra

Since Fμ(x,y)=0 implies y=0 and x(μ+x2)=0, for μ>0 the unique fine root is (0,0). Also sμ′(0)=1−μ/2, so differentiating the two sweeps gives DEμ(0,0)=((1−μ/2)2000),qμ=(1−μ/2)2.

3.1F2step 2.1step 1.2algebra∎

With r2=μ/100, qμ+(7r)r2=(1−μ/2)2+7μ200=1−193200μ+14μ2≤1−143200μ<1. Thus [F2] applies on this ball. Its certified radius rμ=μ/100 tends to zero as μ↓0; at μ=0, q0=1 and the strict derivative hypothesis fails. For μ<0, the scalar equation μx+x3=0 has the additional roots x=±−μ, which is the pitchfork bifurcation.

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

A one-level linear FAS correction is the Galerkin correction

Statement

Take A=(2−1−12), P=(1,1)T, Iu=(u1+u2)/2, R=PT, and the Galerkin coarse matrix AH=PTAP=2. For any fine iterate u and right side f, the coarse FAS difference v−Iu is exactly AH−1R(f−Au), and the prolongated update is the ordinary Galerkin coarse correction.

Facts & Assumptions

Given: The two-dimensional linear system, the specified transfers, exact coarse solution, and exact real arithmetic.

[F1]

Finite-budget nonlinear FAS two-grid cycle: FAS solves the tau-corrected coarse equation and corrects by u+P(v−Iu).

[F2]

Linear FAS exactly reduces to a Galerkin correction V/W cycle: for a linear Galerkin hierarchy with R=PT, the full recursive FAS cycle is the same as the linear correction V/W cycle.

Example

Given: The matrix A, prolongation P, restriction I, and residual restriction R in the Statement.

Verification

1.1givenF1algebra

Direct multiplication gives AP=(1,1)T and AH=PTAP=2. Write m=Iu and r=f−Au. The FAS coarse target is AHm+Rr=2m+r1+r2. The exact coarse solution is therefore v=m+(r1+r2)/2.

2.1F1F2step 1.1algebra∎

Since AH−1Rr=(r1+r2)/2, the coarse difference is v−Iu=AH−1R(f−Au) and the fine update is u+P(v−Iu)=u+PAH−1PT(f−Au), the standard Galerkin correction. With matching residual-correction smoothers, [F2] identifies the full V/W iterate as well.