Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A partial-data configuration outside the full-data theorem

Example

Let Ω=B(0,1)⊂R3 and let Γ={x∈∂Ω:x3>1/2}, a proper nonempty open boundary cap. A measurement protocol that knows only Λγf∣Γ for inputs f∈Cc∞(Γ) is a partial-data protocol. It is outside the full-data conductivity uniqueness theorem, whose hypothesis is equality of the DN operators on every boundary input; this example asserts no nonuniqueness for the partial-data protocol.

Facts & Assumptions

Given: the unit ball, the open cap Γ, and the partial input/output restriction in the statement.

[F1]

Scalar conductivity and Schrödinger Dirichlet-to-Neumann maps: full-data equality is equality of the operators on all of H1/2(∂Ω).

[F2]

Conductivity uniqueness on a Euclidean CTA domain with simple transversal: the full-data theorem's hypothesis is equality of the scalar DN maps on every boundary datum.

Proof

Given: the data in the statement.

1.1givenconstructalgebra

The set Γ is nonempty because it contains the north pole and is open in the sphere because it is the inverse image of (1/2,∞) under the continuous coordinate x↦x3. It is proper because the south pole is not in it. A nonzero smooth bump supported in a small lower cap defines boundary data outside Cc∞(Γ), so the allowed inputs form a proper subset of the full boundary-data space.

2.1F1F2step 1.1∎

By [F1] and [F2], the full-data theorem requires the map on every H1/2(∂Ω) input and the corresponding full boundary output. The stated protocol restricts both input and output to Γ, so it does not satisfy that hypothesis. This classifies the configuration as outside the theorem's scope and asserts no uniqueness or nonuniqueness conclusion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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