Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Lipschitz polyhedral boundary, orientation, and trace spaces

Definition

Assume Countable Choice.

Let Ω− be a nonempty bounded connected open subset of R3 whose boundary Γ=∂Ω− is a compact connected orientable Lipschitz surface. A Lipschitz graph chart is a rigid coordinate change in which Γ is the graph x3=ψ(x1,x2) of a Lipschitz function on an open subset of R2, with Ω− on one side of that graph. A polyhedral boundary is such a boundary made from finitely many planar polygonal faces meeting along edges and vertices; all surface-discretization claims below use this polyhedral subclass. Put Ω+=R3∖Ω−‾ and assume Ω+ is connected. For the fixed-atlas space conventions below, the boundary data include a compatible Borel surface measure dS and an almost-everywhere unit outward normal n, with the following graph realizations and bounded positive graph area densities on every chosen chart. These compatible realizations are supplied data for the Countable-Choice space assertions, not conclusions from bare Lipschitzness under Countable Choice. Under the Axiom of Choice, Sobolev pullback and Green identity on Lipschitz graphs constructs them for every compact Lipschitz boundary and proves their compatibility; the general analytical trace and layer theorems state that axiom. On polyhedral charts the data are directly the finite face areas and face normals. The normal points from Ω− into Ω+. In a rigid chart with Ω− above the graph x3=ψ(x1,x2) it is n=(∂1ψ,∂2ψ,−1)/1+∣∇ψ∣2 almost everywhere; reverse the sign when the domain is below the graph. Rigid coordinates transform this vector to physical coordinates. The graph surface measure is dS=1+∣∇ψ∣2 dx1dx2. Compatibility on overlaps is part of the fixed boundary data; the cited AC graph theorem proves it for arbitrary Lipschitz charts. On a polyhedron these are the face-area measure and outward face normals.

Fix a finite Lipschitz graph atlas {(Uj,ψj)}j=1J, with surface parametrizations Φj(z)=(z,ψj(z)) in the rigid chart coordinates, and a subordinate finite Lipschitz partition of unity {χj}j=1J whose chartwise supports have positive distance from the chart edges. On R2, use the real subspace of the real-order Bessel-potential completion in Real-order Bessel-potential completion H^s. Its published norm uses the weight (1+∣ξ∣2)1/2. Fix here the equivalent Hilbert norm q(g)2=∫R2(1+4π2∣ξ∣2)1/2∣g^(ξ)∣2dξ. The inequalities (1+∣ξ∣2)1/2≤(1+4π2∣ξ∣2)1/2≤2π(1+∣ξ∣2)1/2 identify the same completion and classes under the negative-sign 2π Fourier convention of Real-order H^s as weighted Fourier distributions. Define the real space H1/2(Γ) by requiring every localized chart pullback gj=(χjg)∘Φj, extended by zero outside its chart, to belong to that Euclidean space, and fix the square-sum chart norm ∥g∥H1/2(Γ)2=∑j=1Jq(gj)2. Its inner product is the sum of the real weighted Fourier inner products. The following fixed-data norm and completeness assertions use only Countable Choice and the supplied compatible measure with bounded positive chart densities; they make no geometry-existence or atlas-compatibility assertion under that weaker axiom. This Hilbert norm is equivalent to the finite sum of chart norms: (∑jq(gj)2)1/2≤∑jq(gj)≤J(∑jq(gj)2)1/2. It controls L2(Γ), because graph surface Jacobians are bounded above and below and g=∑jχjg. It is complete: a chart-norm Cauchy sequence has a global L2 limit by that bound; its localized pullbacks converge in L2 to the pullbacks of this limit, while completeness of each Euclidean weighted space gives convergence in each q norm. The two limits agree, so the limit belongs to the defined chart space and convergence holds in the finite square sum.

Let real H−1/2(Γ) be the continuous real dual, with its operator norm and pairing ⟨⋅,⋅⟩Γ; the dual of this real Hilbert space is Hilbert by Riesz representation for Hilbert spaces. The interior and exterior traces of an H1 function are denoted γ−u and γ+u; their common chartwise trace space is H1/2(Γ) once the applicable trace theorem is proved. This fixed-atlas chart-space convention applies to the stated Lipschitz geometry, including its polyhedral and C2 subclasses. It defines the Hilbert and dual norms; no boundary trace or lifting theorem is assumed by that convention.

The complex space is the Hilbert complexification of the real space: ∥g1+ig2∥2=∥g1∥2+∥g2∥2. Its H−1/2 is the continuous conjugate dual, with pairing linear in the density and conjugate-linear in the trace, extending the real pairing. A complex density is a distribution via the bilinear test action Tλ(v)=⟨λ,v‾⟩Γ. For either scalar field the continuous realization H1/2(Γ)⊂L2(Γ)⊂H−1/2(Γ) uses ⟨f,g⟩Γ=∫Γfg‾ dS in the complex case and ∫Γfg dS in the real case. These inclusions follow from the just-proved H1/2→L2 bound and Cauchy–Schwarz.

No smoothness at edges or vertices is included in this definition. The normal is only used almost everywhere. On every Lipschitz boundary use the intrinsic graph surface measure just specified, with the chart partition; on a polyhedral boundary it equals the sum of planar face-area measures. The general Lipschitz class and its C2 subclass therefore use the same measure and orientation conventions.

Depends on

Used by

Dependency tree · two levels

60 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