Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-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.

A weakly divergence-free mini velocity need not be pointwise divergence-free

Statement

Assume Countable Choice. On a square split into two triangles, the mini-element weak divergence kernel contains a nonzero velocity whose divergence is not zero almost everywhere. Thus the weak discrete kernel Zh can strictly contain the exact kernel Zh0.

Facts & Assumptions

Given: Countable Choice; the unit square divided by one diagonal into two shape-regular triangles, the mini-element spaces, and the weak/exact kernel definitions.

[A1]

Countable Choice is the hypothesis of the mini-space and dimension suppliers. (The Axiom of Countable Choice (ACω))

[F1]

On a connected mesh with Nv vertices, Nv,0 interior vertices and NK cells, dim⁡Vh=dNv,0+dNK and dim⁡Qh=Nv−1. (Local and global dimensions of the mini element)

[F2]

Mini velocities consist of zero-boundary continuous P1 fields plus cell-supported vector bubbles; pressures are continuous P1 with zero mean. (The conforming P1-bubble/P1 mini element)

[F3]

Zh={vh:b(vh,qh)=0 ∀qh∈Qh} and Zh0={vh:div⁡vh=0 a.e.}. (Weak and pointwise divergence-free discrete velocities)

[F4]

For a linear map with finite-dimensional domain, domain dimension equals kernel dimension plus image dimension. (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T)

Example

Rank-nullity provides a nonzero weak-kernel velocity on the stated two-triangle mesh.

Verification

technique · rank-nullity and a local polynomial check
1.1A1F1F4chooseconstruct

This mesh has four vertices, no interior vertices, and two cells. [F1] gives dim⁡Vh=2⋅0+2⋅2=4 and dim⁡Qh=4−1=3. The linear constraint map from Vh to Qh′ therefore has nonzero kernel by rank-nullity, so choose 0≠vh∈Zh.

2.1A1F1F2step 1.1

Since all square vertices lie on the boundary, the zero-boundary P1 velocity part is zero. By [F2], vh consists only of vector bubbles, one supported on each triangle. At least one cell has a nonzero bubble coefficient a∈R2.

3.1A1F2F1step 2.1

On that cell, div⁡(bKa)=a⋅∇bK. If this polynomial vanished identically, bK would be constant along every line segment parallel to a inside K. The line through the barycenter parallel to a meets ∂K at two endpoints where bK=0, so constancy would force bK to vanish at the barycenter, contradicting bK>0 there. Thus this polynomial is nonzero at some point of the cell interior. By continuity it remains nonzero on a small open ball, which has positive measure; hence div⁡vh≠0 on a positive-measure subset of that cell.

4.1A1F1F3discharge-constructstep 3.1∎

By [F3], the selected vh lies in Zh but not Zh0. For any exactly divergence-free velocity, b(vh,qh)=0 follows immediately from [F3]'s pairing, so Zh0⊆Zh; the inclusion is strict on this mesh.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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