Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 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.

Hilbert-valued extension with a concave modulus

Statement

Assume the Axiom of Choice. Let H1,H2 be real Hilbert spaces, let A⊆H1, and let g:A→H2. If a continuous, nondecreasing, concave function ω⋆:[0,∞)→[0,∞) satisfies ω⋆(0)=0 and ∥g(x)−g(y)∥H2≤ω⋆(∥x−y∥H1)(x,y∈A), then the Hilbert-valued same-modulus extension theorem asserts that there is g~:H1→H2 extending g and satisfying the same inequality for every x,y∈H1.

For the EIT inverse map, take the kernel input space to be L2(∂Ω×∂Ω;C) viewed as a real Hilbert space with its usual complex L2 norm. If IP-45 gives ∥γ−γ0∥2≤C0[log⁡(1/min⁡{δ,t0})]−ρ for δ=∥Λ˙γ−Λ˙γ0∥, and the NTD kernel estimate transfers δ≤C1∥κγ−κγ0∥21/2, then after decreasing t0 and, if necessary, enlarging C0 the concave modulus ω⋆(0)=0,ω⋆(s)=C0[log⁡ ⁣(1min⁡{C1s,t0})]−ρ(s>0) is an admissible modulus for that inverse map and can be extended by the Hilbert same-modulus theorem to the whole underlying real Hilbert space of complex-valued kernels.

Facts & Assumptions

Given: the real Hilbert spaces, subset, map and modulus in the Statement, and the EIT class data when applying the second paragraph.

[F1]

IP-45 states ∥γ−γ0∥2≤C0ω(∥Λ˙γ−Λ˙γ0∥) with a saturated logarithmic modulus and ω(0)=0. (Logarithmic L2 stability for Calderón conductivity classes)

[F2]

For any concave nondecreasing modulus ω vanishing continuously at zero, source points xi and target points yi satisfying ∥yi−yj∥≤ω(∥xi−xj∥) have ⋂iB‾(yi,ω(∥xi−x∥))≠∅ for every additional source point x. This includes arbitrary index sets and zero-radius balls. (Concave-modulus intersection of Hilbert balls)

[F3]

The actual kernel comparison is δ≤C1s1/2, where s is the L2 kernel distance. (NtD smoothing and Hilbert–Schmidt kernel bounds)

[F4]

Under the Axiom of Choice, a nonempty poset whose every chain has an upper bound has a maximal element. (Zorn's lemma)

[A1]

The Axiom of Choice supplies Zorn's lemma and implies the Countable Choice used by the Hilbert-ball and EIT interfaces. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: the data in the Statement.

1.1A1F4givenconstructchoose

Consider the set of pairs (B,h) where A⊆B⊆H1 and h:B→H2 extends g and satisfies ∥h(u)−h(v)∥≤ω⋆(∥u−v∥) for all u,v∈B. Order it by graph inclusion. It is nonempty, since (A,g) is in it. Every nonempty chain has as upper bound the union of its graphs: every two of its domain points occur together in one member of the chain, so the same modulus inequality holds for their union. The empty chain has (A,g) as an upper bound. By [F4] and [A1] there is a maximal pair (B,h).

1.2F1givenalgebra

For the EIT application first arrange t0≤e−(ρ+1). If the original IP-45 constants have a larger cutoff, decrease it and enlarge C0 if needed: the uniform class diameter is at most 2M∣Ω∣1/2, so taking C0≥2M∣Ω∣1/2[log⁡(1/t0)]ρ covers all DN distances above the new cutoff, while increasing C0 preserves the old small-distance estimate. For 0<s<(t0/C1)2, put L(s)=log⁡(1/(C1s)) and φ(s)=C0L(s)−ρ. Then φ′(s)=C0ρ/(2sL(s)ρ+1)>0 and φ′′(s)=C0ρ[ρ+1−2L(s)]/(4s2L(s)ρ+2)≤0. At the cutoff it joins continuously to a constant and its derivative drops to zero; at zero it tends to zero. Thus the displayed ω⋆ is continuous, nondecreasing and concave on the entire nonnegative half-line.

2.1F2step 1.1givenchoosealgebra

If B≠H1, fix x∈H1∖B. Apply [F2] to the source family (u)u∈B and target family (h(u))u∈B. It gives a point y∈H2 satisfying ∥y−h(u)∥≤ω⋆(∥x−u∥) for every u∈B. Adding h(x)=y gives a strictly larger admissible graph, contradicting maximality. This also covers B=∅, since [F2]'s empty intersection is H2, which contains zero. Thus B=H1 and g~=h proves the full same-modulus extension theorem for arbitrary real Hilbert spaces and arbitrary subsets.

3.1F1F3step 2.1step 1.2givenalgebra∎

For an exact conductivity pair put s=∥κγ−κγ0∥L2(M×M;C). By [F1], [F3] and monotonicity, ∥γ−γ0∥2≤C0[log⁡(1/min⁡{C1s,t0})]−ρ=ω⋆(s) when s>0; if s=0, [F3] gives zero DN distance and [F1] gives equal conductivities. The operators Rγ and CMrd/2 in the smoothed observation commute with complex conjugation: the weak Neumann problem has real coefficients and unique mean-zero representatives, while the real boundary Laplacian has conjugation-invariant eigenspaces and the spectral multiplier is real and constant on each eigenspace. Thus A~γ commutes with conjugation. Let κγ be its unique complex L2 kernel from the Hilbert–Schmidt kernel theorem. The kernel κγ‾ also represents A~γ, since its integral operator sends f to A~γf‾‾=A~γf. Uniqueness of the kernel gives κγ‾=κγ almost everywhere. In particular, the exact kernel image lies in the real-valued subspace, while it is still regarded as a subset of the underlying real Hilbert space of complex-valued kernels. Therefore the exact-data inverse is well-defined and has this modulus on that real Hilbert space. Step 2.1 applies there and in the real conductivity L2 Hilbert space, with concavity verified in step 1.2, to give its whole-space extension with exactly the same modulus.

Depends on

Used by

Dependency tree · two levels

29 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