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

The RT0/P1 least-squares family is conforming

Statement

Assume Countable Choice. The finite-mesh family RT0(Th)×(P1(Th)∩H01(Ω)) from First-order least-squares formulation of the Dirichlet Poisson problem is a finite-dimensional subspace of H(div;Ω)×H01(Ω).

Facts & Assumptions

Given: A finite conforming triangular mesh.

[A1]

Countable Choice is inherited by Sobolev interfaces. (The Axiom of Countable Choice (ACω))

[F1]

The RT0/P1 trial factors and boundary condition are fixed by the definition. (First-order least-squares formulation of the Dirichlet Poisson problem)

[F2]

Matching RT0 facet fluxes imply global H(div) conformity. (RT0 facet-flux unisolvence and global H(div) conformity)

[F3]

Global H1 traces agree across interior facets. (H1 traces agree across interior mesh facets)

Proof

1.1A1F1F2algebra

Local RT0 fields and their divergences are polynomials; shared normal flux degrees of freedom agree by [F2]. Their global distributional divergence is therefore the piecewise L2 divergence, so the flux factor lies in H(div).

2.1F1F3step 1.1algebra∎

The scalar factor is globally continuous piecewise affine and has H1_0 boundary condition; [F3] gives the interior trace convention. The finite mesh has finitely many polynomial coefficients, so the product space is finite dimensional.

Depends on

Used by

Dependency tree · two levels

31 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