Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Exact reflected-mode error from a finite Dirichlet-terminated PML

Statement

For q>0, A≠0, and a finite layer 0≤x≤L with S(L)>0, let a one-dimensional mode be u(x)=AeiqX(x)+Be−iqX(x), with the PML stretch from Cartesian complex-stretch PML for a homogeneous Helmholtz mode. Imposing u(L)=0 gives the reflected amplitude at the interface BA=−e2iqX(L),∣BA∣=e−2qS(L). This is the exact continuous one-mode error for a Dirichlet termination.

Facts & Assumptions

Given: A propagating mode q>0 and finite stretch data [F1].

[F1]

Cartesian complex-stretch PML for a homogeneous Helmholtz mode: X(L)=L+iS(L); the positive and negative normal modes in the stretched coordinate are eiqX and e−iqX.

[F2]

Perfect matching and attenuation for non-grazing propagating modes: the outgoing mode is matched at the interface and attenuated by e−qS in one pass.

Proof

Given: q>0, S(L)>0, and [F1]–[F2].

1.1givenF1algebra

The condition u(L)=0 reads AeiqX(L)+Be−iqX(L)=0. Since exponentials never vanish, if A≠0 division gives B/A=−e2iqX(L).

2.1F1F2step 1.1algebra∎

With X(L)=L+iS(L), ∣e2iqX(L)∣=∣e2iqL−2qS(L)∣=e−2qS(L). The result measures the reflected-to-incident coefficient at x=0, where X(0)=0; it is the two-way attenuation through the continuous layer.

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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