Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passverified 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 scalar diagonal sector of the positive matrix equation

Example

Let Ω⊆Rd be the nonempty bounded connected smooth Euclidean domain of the positive matrix boundary problem, with d≥1. For a smooth real-valued function u on Ω‾, define the Euclidean Laplacian by Δu:=∑a=1d∂a2u and call u harmonic on Ω when Δu=0 there. In matrix size n=2, define

Φu(x):=(eu(x)00e−u(x)).

Then Φu is a smooth map into the positive Hermitian determinant-one matrices, and it satisfies div⁡(Φu−1dΦu)=0 exactly when u is harmonic. Moreover, if u,v∈C∞(Ω‾,R) are harmonic and Φu=Φv at every point of ∂Ω, then Φu=Φv on Ω‾ (and hence u=v there).

Facts & Assumptions

Given: The domain Ω, a smooth real function u, and the matrix definitions above.

[F1]

Positive matrix harmonic-map boundary problem: the matrix equation is div⁡J=∑a∂aJa=0 for J=Φ−1dΦ, and the admissible matrices are positive Hermitian with determinant one.

[F2]

Positive-matrix comparison identity: two smooth admissible matrix solutions with identical values on the entire boundary of the same bounded connected smooth Euclidean domain agree throughout its closure.

[F4]

Ck Euclidean maps are closed under componentwise algebra and composition: compositions of smooth Euclidean maps are smooth.

Verification

1.1givenF3F4algebra

By [F3], the diagonal entries are positive and eue−u=1; by the chain rule their derivatives are eu∂au and −e−u∂au. Since the exponential is smooth and compositions of smooth maps are smooth by [F4], Φu is a smooth admissible matrix field. Direct multiplication gives Φu−1∂aΦu=diag⁡(∂au,−∂au).

2.1givenF1step 1.1algebra

Taking the componentwise divergence gives div⁡(Φu−1dΦu)=diag⁡(∑a∂a2u,−∑a∂a2u)=diag⁡(Δu,−Δu). This matrix vanishes exactly when Δu=0.

3.1givenF1F2step 1.1step 2.1

Let u,v be harmonic and suppose Φu=Φv at every point of ∂Ω. Applying steps 1.1–2.1 to each function shows that both maps satisfy the positive matrix equation; they have the same full Dirichlet data, so [F2] gives Φu=Φv on Ω‾.

4.1F3step 3.1∎

Equality of the first diagonal entries gives eu(x)=ev(x) for every x∈Ω‾. Strict increase of the exponential in [F3] implies u(x)=v(x) throughout Ω‾.

Depends on

Dependency tree · 2 levels

Sources