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 comparison expression is a norm

Statement

In the Poisson setting of The Crouzeix–Raviart method for the homogeneous Poisson problem, ∥⋅∥♯,h is a norm on Xh=H01(Ω)+VhCR,0. Its restriction to H01(Ω) is the gradient norm, equivalent to the H1 norm, and its restriction to VhCR,0 is a norm.

Facts & Assumptions

Given: A finite matching mesh of a bounded connected Lipschitz polyhedral domain, Xh and ∥⋅∥♯,h from The Crouzeix–Raviart method for the homogeneous Poisson problem, and Countable Choice.

[F1]

The expression is the sum of squared broken-gradient and scaled facet-jump terms; on H01(Ω) all jumps vanish. (The Crouzeix–Raviart method for the homogeneous Poisson problem, Fractional face traces and cellwise Green identity on a simplex)

[F2]

A zero-gradient W1,2 function on a simplex is constant by its Poincare–Wirtinger inequality; shape-regular affine scaling transfers the inequality from the reference simplex. (Poincare–Wirtinger inequality on a reference simplex, Shape regularity controls affine simplex geometry)

[F3]

Interior points of a connected open domain can be joined by a polygonal path in the domain. (Every connected component of an open subset of Rn is open and polygonally connected)

[F4]

The gradient norm is equivalent to the H1 norm on H01(Ω). (A Poincare bound on a slab-bounded domain)

[F5]

Every nonempty Euclidean ball has positive Lebesgue measure. (Euclidean balls have positive finite Lebesgue measure)

[F6]

A finite union of measurable null sets is null by finite subadditivity. (Finite and countable subadditivity of measures)

[F7]

Cauchy--Schwarz in a real inner-product space gives ∣⟨x,y⟩∣≤∥x∥∥y∥, and expansion of ∥x+y∥2 then gives the triangle inequality for its induced norm. (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors)

Proof

1.1F2F3F5F6givenalgebra

Let z∈Xh and suppose ∥z∥♯,h=0. Each nonnegative term in the finite sum is zero, so ∇(z∣K)=0 on every cell and every interior and boundary facet jump vanishes. By [F2], each restriction z∣K is a constant cK almost everywhere. To see that the cell-adjacency graph is connected, choose interior points in any two cells and join them by a polygonal path in Ω using [F3]. Its compact image has positive distance from ∂Ω. Subdivide its segments if necessary to obtain at least one intermediate vertex; perturb each intermediate vertex in a small open ball so all joining segments stay in Ω. For a fixed endpoint a off a mesh face S of codimension at least two, candidate points in a bounded perturbation ball whose segment from a meets S lie in a truncated cone {a+t(s−a):s∈S,1≤t≤L}; L<∞ because a is a positive distance from the compact face and the candidate ball is bounded. If S has dimension k≤d−2, cover the bounded parameter set S×[1,L] by O(δ−(k+1)) cubes of side δ. The cone map is Lipschitz, so their images fit in d-cubes of side Cδ with total volume O(δd−k−1)→0. Bounded portions of facet hyperplanes are also null by the same covering count with k=d−1. Thus all forbidden sets are measurable null sets, and [F6] makes each finite union null. By [F5], a perturbation ball has positive measure and so contains a point outside that union. Choose the intermediate vertices successively outside the finitely many cones from the previous vertex and facet hyperplanes; for the last vertex also avoid the cones from the fixed endpoint at the end of the path. No segment meets the codimension-at-least-two skeleton or lies in a facet hyperplane, so cell transitions occur only through relative interiors of whole facets. When d=1, the mesh faces are endpoints and each crossing is itself a whole facet. The crossings give a cell-adjacency chain. Zero interior jumps therefore make all constants cK equal, while a zero boundary-facet jump makes the constant zero. Every cell is connected to that boundary cell, so z=0 in L2(Ω). Thus the kernel is trivial.

2.1F1F4F7step 1.1algebra∎

Map z∈Xh to the finite direct sum Y=⨁KL2(K;Rd)⊕⨁FL2(F) by Jz=((∇z∣K)K,(hF−1/2[z]F)F). The sum of the component integral pairings is an inner product on Y, and its induced norm satisfies ∥Jz∥Y=∥z∥♯,h. Cauchy--Schwarz [F7] and expansion of the squared norm give the triangle inequality; step 1.1 shows J is injective, proving positive definiteness on Xh. If z=u∈H01(Ω), its interior and boundary jumps vanish by the local trace theorem, so the expression equals ∥∇u∥L2(Ω), equivalent to the H1 norm by [F4]. Finally, on the finite-dimensional space VhCR,0 the restriction is an inner-product norm; in its explicit face basis its Gram matrix is positive definite, so that norm is equivalent to the Euclidean coefficient norm and is complete. Thus VhCR,0 is Hilbert in the comparison norm.

Depends on

Used by

Dependency tree · two levels

58 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