Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Weak solvability of the positive scalar conductivity equation

Statement

Assume the Axiom of Choice and Countable Choice. Let (M,g) be a compact connected smooth Riemannian domain with nonempty smooth boundary and no orientability assumption, and let γ∈C∞(M,R) satisfy γ>0. There is a constant CP>0 such that ∥w∥L2(M)≤CP∥∇gw∥L2(M) for every w∈H01(M). For every h∈L2(M) and f∈H1/2(∂M) there is a unique v∈H1(M) with trace f satisfying ∫Mγ g(∇gv,∇gz‾) dVg=−∫Mhz‾ dVg for every z∈H01(M). If h and f are smooth, this weak solution is smooth up to the boundary.

Facts & Assumptions

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function; this is assumed by the Rellich, trace-right-inverse, higher-order regularity, and Sobolev embedding suppliers.

[A2]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; this is assumed by the Lax--Milgram, partition, and collar suppliers.

Given: AC and Countable Choice; the compact connected smooth Riemannian domain and positive smooth conductivity in the statement; and f∈H1/2(∂M).

[F1]

Sobolev spaces on a compact Riemannian domain with boundary: H1(M) is defined by finitely many chartwise W1,2 norms, and H01(M) is the H1 closure of Cc∞(M∘).

[F2]

Compactness of W01,p(Ω)↪Lp(Ω) on bounded open sets: on a bounded Euclidean open set, W01,2 is compactly embedded in L2.

[F3]

The Lax--Milgram theorem: a bounded coercive sesquilinear form on a Hilbert space has a unique weak solution.

[F4]

The Lp trace operator on a bounded C1 domain: on a bounded C1 Euclidean domain, the trace is a bounded operator from H1 to L2 and agrees with restriction for smooth functions; therefore every class in the closure H01 has zero trace.

[F5]

A bounded right inverse of the trace, supported in a prescribed collar: on a bounded smooth Euclidean domain, every H1/2 boundary datum has an H1 extension; after localization this supplies boundary-chart extensions on M.

[F6]

Higher-order boundary regularity for Dirichlet problems: a zero-trace weak solution of a smooth uniformly elliptic divergence-form equation on a bounded smooth Euclidean domain gains two Sobolev derivatives when its right-hand side has the corresponding Sobolev regularity.

[F7]

Higher-order Sobolev embedding: membership in every chartwise integer Sobolev space gives a smooth representative up to the boundary.

[F8]

Collar neighborhood theorem: smooth boundary data extend smoothly into a collar by constant normal extension and a cutoff.

[F9]

The sharp trace theorem: boundedness and range in the fractional space: in each bounded smooth boundary chart, the Euclidean H1 trace is bounded into the local H1/2 space. Applying these local traces to the fixed-atlas partition defines a bounded global trace TM:H1(M)→H1/2(∂M) that agrees with restriction on smooth functions.

[F10]

The kernel of the trace is the closure of the test functions and The trace commutes with smooth cutoffs and is chart local: localizing a zero-trace H1 function by the fixed partition gives zero-trace Euclidean chart representatives; the Euclidean trace-kernel theorem and finite patching imply ker⁡TM=H01(M).

Proof

Given: the data in the statement, including h∈L2(M).

1.1A1F1F2F4F9givencontradiction

In dimension one, endpoint evaluation is bounded on H1 by the fundamental theorem of calculus and Cauchy--Schwarz. Any endpoint data have a smooth collar lift. Its kernel is H01: for a zero-endpoint function, ∣u(t)∣2≤t∫0t∣u′(r)∣2dr makes the derivative error of a cutoff on [0,2δ] tend to zero in L2 as δ→0; cut off at both endpoints and mollify. Thus the trace, lift and kernel conclusions of [F5], [F9] and [F10] hold also in this dimension, without invoking their higher-dimensional Euclidean suppliers. There is a constant CP such that ∥w∥L2(M)≤CP∥∇w∥L2(M) for w∈H01(M). Otherwise choose wj∈H01(M) with ∥wj∥L2=1 and ∥∇wj∥L2→0. A finite chart partition and [F2] give an L2-convergent subsequence. On compact M, the fixed finite chartwise H1 norm is equivalent to ∥⋅∥L2+∥∇g⋅∥L2 by bounded metric coefficients, so this subsequence is Cauchy in H1 and converges to some w∈H01(M) with ∥w∥L2=1 and weak gradient zero. Local convolution shows that a function with zero weak gradient is constant on each connected coordinate ball; overlapping balls and connectedness make w constant on M∘. Its trace is zero because w∈H01(M), while [F9] makes the trace of a nonzero constant equal that same nonzero boundary value. This contradiction proves the inequality.

2.1A2F1F3step 1.1given

Compactness of M and positivity of γ give γ∗:=min⁡Mγ>0. Thus aγ(w,z)=∫Mγ g(∇w,∇zˉ) dVg is bounded on H01(M) and aγ(w,w)≥c∥w∥H1(M)2 by step 1.1 and γ∗. By [F3], for any bounded conjugate-linear functional G on H01(M) there is a unique w∈H01(M) with aγ(w,z)=G(z) for all z.

3.1A1A2F1F3F4F5F10step 1.1step 2.1algebra

Flatten each boundary chart, apply the local half-space trace lift, and patch the finitely many chart lifts with a smooth partition. The resulting Ef∈H1(M) has trace f and norm bounded by C∥f∥H1/2(∂M) by [F5]. For h∈L2(M) take G(z)=−∫Mhz‾ dVg−aγ(Ef,z) in step 2.1 and set v=Ef+w. Then v has trace f and satisfies the weak equation. If v1,v2 are two such solutions, their difference has zero global trace, hence lies in H01(M) by [F10]. Its energy is zero; since γ≥γ∗>0, its gradient vanishes, and step 1.1 gives v1=v2.

4.1A1A2F1F6F7F8F10step 3.1inductionalgebra∎

Suppose h and f are smooth. By [F8], extend f smoothly from the boundary into a collar and multiply by a cutoff to obtain a smooth extension Ef on M. Then w=v−Ef has zero trace, so w∈H01(M) by [F10], and solves div⁡g(γ∇gw)=h−div⁡g(γ∇gEf), whose right-hand side is smooth. For dimension one, the coordinate equation (aw′)′=H with smooth a>0 and smooth H first gives aw′∈H1 and then, by iteration, w∈Hm for every m; the one-dimensional fundamental theorem gives smoothness up to the endpoints. For dimension at least two, in each boundary chart, flatten the boundary and write the principal matrix as ∣g∣1/2γgij; it is smooth and uniformly elliptic because g is positive definite and γ has a positive minimum. For the base case, localize w by a cutoff; its equation has an L2 right-hand side since w∈H1, so [F6] gives local H2 regularity. If w∈Hm+1, each cutoff commutator contains derivatives of w of order at most m+1 with smooth bounded coefficients, hence lies in Hm; the localized right-hand side is therefore in Hm, and [F6] gives Hm+2 regularity. Induction over m and a finite chart cover give w∈Hm(M) for every integer m. By [F7], w and hence v=Ef+w are smooth up to the boundary.

Depends on

Used by

Dependency tree · two levels

106 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