Alphabeta Math
LemmaStatement: 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.

The broken gradient is a norm on the homogeneous Crouzeix–Raviart space

Statement

For a finite matching mesh of a bounded connected polyhedral domain, vh↦∥∇hvh∥L2(Ω) is a norm on VhCR,0 of The global homogeneous Crouzeix–Raviart space.

Facts & Assumptions

Given: A finite matching affine simplicial mesh of a bounded connected domain and vh∈VhCR,0.

[F1]

A connected open subset of Euclidean space is polygonally connected. (Every connected component of an open subset of Rn is open and polygonally connected)

[F2]

Interior face averages of vh agree, and boundary face averages vanish. (The global homogeneous Crouzeix–Raviart space)

[F3]

Holder's inequality gives the L2 Cauchy--Schwarz bound ∣∫fg∣≤∥f∥2∥g∥2. (Holder's inequality for integrals, including the endpoint cases)

Proof

1.1givenF2algebra

Suppose ∥∇hvh∥L2=0. Then the affine restriction vK has zero gradient on every cell and is constant cK. If two cells share an interior facet, [F2] gives ∣F∣cK=∣F∣cK′, hence cK=cK′.

2.1F1F2givenstep 1.1

The cell-adjacency graph is connected. Join interior points of any two cells by a polygonal path in Ω using [F1]. Its compact image has positive distance from ∂Ω. Subdivide the path if necessary to have intermediate vertices and perturb them in small open balls so every segment remains in Ω. For a fixed endpoint a and a mesh face S of codimension at least two, every endpoint b for which [a,b] meets S lies in the proper affine subspace aff⁡({a}∪S), of dimension at most d−1. Also avoid each facet hyperplane so no perturbed segment lies in one. A finite union of proper affine subspaces cannot cover an open ball: each has empty interior, so successively choose a smaller nonempty open ball disjoint from each one. Choose intermediate vertices successively outside the finitely many forbidden subspaces from the previous vertex; for the last vertex also avoid those from the fixed endpoint at the end of the path. Thus no segment meets the codimension-at-least-two skeleton or lies in a facet hyperplane, so every cell transition is through a relative interior of a whole facet. When d=1 mesh faces are endpoints and each crossing is itself a whole facet. This gives an adjacency chain, so all cell constants in step 1.1 agree. Since the bounded mesh has a boundary facet and its face mean is zero by [F2], the common constant is zero.

3.1F3step 2.1algebra∎

The broken gradient is linear, and its L2 norm is nonnegative and absolutely homogeneous. For the triangle inequality, expand ∥∇h(vh+wh)∥22 using the L2 inner product; [F3] bounds the cross term by ∥∇hvh∥2∥∇hwh∥2, so the square is at most (∥∇hvh∥2+∥∇hwh∥2)2. Taking nonnegative square roots gives the triangle inequality. Step 2.1 proves that its kernel is {0}; hence it is a norm.

Depends on

Used by

Dependency tree · two levels

21 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