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.

Backward Euler scalar A-stability does not imply matrix contractivity

Statement refuted

For every real matrix A whose characteristic polynomial has all roots in the closed left half-plane, the backward-Euler matrix step (I−A)−1 is contractive in the Euclidean norm.

Facts & Assumptions

Given: The real matrix A=(−1160−1) and a unit backward-Euler step h=1.

[F1]

Matrix-step contractivity and the logarithmic norm in a specified inner product: Euclidean contractivity requires the induced norm of the matrix step to be at most one; μ2(A)=sup⁡x≠0xTAx/∥x∥22.

[F2]

Backward Euler is A-stable and L-stable: the backward-Euler scalar stability function is RBE(z)=1/(1−z) and is A-stable.

Counterexample

1.1givenF2algebra

The characteristic polynomial of A is (ν+1)2, so its roots are both −1 and the scalar backward-Euler factor is RBE(−1)=1/2. Also AAT≠ATA, so A is nonnormal.

1.2givenF1algebra

Direct inversion gives (I−A)−1=(1/2401/2). For e2=(0,1)T, this step gives (4,1/2)T, whose Euclidean norm is 65/4>1=∥e2∥2. Thus the matrix step is not contractive.

2.1F1step 1.1algebra∎

For x=(x1,x2)T, 7∥x∥22−xTAx=8(x1−x2)2≥0, with equality at x1=x2≠0. Hence μ2(A)=7>0, which records the nonnormal growth hidden by the negative scalar test value. The claimed implication is false.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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