Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge 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.

Eliminating F-points gives the exact coarse time operator

Statement

Use The all-at-once bidiagonal time operator and C/F points with N=Jm, m≥2, and its F/C partition. Both At and AFF are invertible. Eliminating the F unknowns from Atv=b gives the coarse system with Schur complement S=ACC−ACFAFF−1AFC. On coarse interval j, its recurrence is ujm−(ΦjmΦjm−1⋯Φ(j−1)m+1)u(j−1)m=gˉj, where gˉj=∑s=1m(ΦjmΦjm−1⋯Φ(j−1)m+s+1)g(j−1)m+s, with an empty product defined to be the identity. If Φi=Φ for every fine step, the exact coarse propagator is Φm.

Facts & Assumptions

Given: The finite fine recurrence, its all-at-once block matrix, and the C/F partition.

[F1]

The all-at-once bidiagonal time operator and C/F points: the fine equations are ui−Φiui−1=gi with identity diagonal blocks, and C={m,2m,…,N}.

Proof

1.1givenF1constructinduction

For any right-hand side, solve the fine equations in increasing index: the first unknown is determined by its identity diagonal block, and each later unknown is uniquely ui=ri+Φiui−1. This proves At is invertible. Holding all C-values fixed, the F-equations in each interval between consecutive C-points have the same forward-substitution form with identity diagonal blocks, so they uniquely determine the F-values; hence AFF is invertible.

2.1givenF1step 1.1algebra

In the reordered block system, the F rows give uF=AFF−1(bF−AFCuC). Substituting this expression in the C rows gives (ACC−ACFAFF−1AFC)uC=bC−ACFAFF−1bF. Conversely, any solution uC of this coarse system, together with the displayed formula for uF, satisfies both the F and C rows. Thus elimination preserves exactly the solution set.

3.1F1step 2.1inductionalgebra∎

Repeated substitution in ui=Φiui−1+gi, for i=(j−1)m+1,…,jm, gives ujm=(Φjm⋯Φ(j−1)m+1)u(j−1)m+∑s=1m(Φjm⋯Φ(j−1)m+s+1)g(j−1)m+s. For s=m the product is empty and equals I. This is exactly the coarse recurrence in the Statement; the coefficient product reduces to Φm when every Φi=Φ.

Depends on

Used by

Dependency tree · two levels

2 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