Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The Crouzeix–Raviart method for the homogeneous Poisson problem

Definition

Assume Countable Choice. Let Ω and T be as in The global homogeneous Crouzeix–Raviart space, let V:=H01(Ω), let Vh:=VhCR,0, and let f∈L2(Ω). The exact Poisson form and load are a(u,v):=∫Ω∇u⋅∇v dx,F(v):=∫Ωfv dx(u,v∈V). An exact solution is a u∈V satisfying a(u,v)=F(v) for every v∈V. For vh,wh∈Vh, define the broken form and discrete load by ah(vh,wh):=∑K∈T∫K∇vh⋅∇wh dx,Fh(wh):=∫Ωfwh dx. The discrete problem is to find uh∈Vh such that ah(uh,wh)=Fh(wh) for every wh∈Vh.

Put Xh:=V+Vh. For each cell facet F⊂∂K, let γF,K denote the trace supplied by Fractional face traces and cellwise Green identity on a simplex. For z∈Xh and wh∈Vh, define the comparison-space extension a~h(z,wh):=∑K∈T∫K∇(z∣K)⋅∇wh dx. Each restriction z∣K belongs to H1(K), and this extension agrees with ah when z∈Vh.

On an interior facet F=K+∩K− choose either ordering and define [z]F:=γF,K+z−γF,K−z; on a boundary facet of K set [z]F:=γF,Kz. The mesh-dependent comparison expression is ∥z∥♯,h2:=∑K∈T∥∇(z∣K)∥L2(K)2+∑F∈F∘∪F∂hF−1∥[z]F∥L2(F)2,z∈Xh. The next items prove the required definiteness, stability, and consistency properties; this definition makes no assertion that Vh⊂V.

Depends on

Used by

Dependency tree · two levels

42 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