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

Positive-matrix comparison identity

Statement

Let d,n≥1 and let Ω⊆Rd be the nonempty bounded connected smooth domain of Positive matrix harmonic-map boundary problem. Let Φ0,Φ1∈C∞(Ω‾,Pn) satisfy div⁡Ji=0, where Ji:=Φi−1dΦi=∑a=1dJi,a dxa and div⁡Ji:=∑a∂aJi,a. Define

Ψ:=Φ1Φ0−1−In,ΔJa:=J1,a−J0,a.

Then, pointwise on Ω,

Δtr⁡Ψ=∑a=1dtr⁡ ⁣((ΔJa)†Φ1ΔJaΦ0−1)≥0,

where Δ=∑a∂a2 is the Euclidean Laplacian. If Φ1=Φ0 on the entire boundary ∂Ω, then Φ1=Φ0 on Ω‾. This is an abstract bounded-domain uniqueness result for the stated positive matrix equation.

Facts & Assumptions

Given: The domain, matrix fields, regularity, determinant and positivity conditions, and matrix equations in the Statement.

[F1]

Positive matrix harmonic-map boundary problem: Pn consists of positive definite Hermitian complex n×n matrices with determinant one; J=Φ−1dΦ is differentiated entrywise and its Euclidean divergence is ∑a∂aJa.

[F2]

Finite matrix spectral and state calculus: every Hermitian matrix on a finite-dimensional complex inner-product space has an orthonormal eigenbasis with real eigenvalues; positive matrices have positive square roots; and the finite trace is basis-independent and cyclic.

[F3]

For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B): for square matrices over a commutative field, det⁡(AB)=det⁡(A)det⁡(B).

[F4]

The arithmetic mean, geometric mean inequality: for n≥1 nonnegative reals λ0,…,λn−1, ∏jλj≤(1n∑jλj)n, with equality exactly when all entries are equal.

[F5]

Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes and Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0: matrix products are computed by finite entry sums. For complex-valued entries, identify C with R2: if f=f1+if2 and g=g1+ig2, then fg=(f1g1−f2g2)+i(f1g2+f2g1), so the real sum and product rules applied to both components give ∂a(fg)=(∂af)g+f(∂ag). Finite entry sums obey the same rule. Directional derivatives and partial derivatives of a map U⊆Rm→Rn identifies ∂a with differentiation along the ath coordinate line.

Proof

1.1givenF1F5algebra

Put u:=tr⁡Ψ. The inverse formula in [F1] makes each Φi−1 smooth on Ω‾, so u is smooth there. Differentiating ΦiΦi−1=In entrywise and using the product rule gives ∂aΦi−1=−Φi−1(∂aΦi)Φi−1=−Ji,aΦi−1. Since ∂aΦi=ΦiJi,a, it follows that ∂aΨ=Φ1ΔJaΦ0−1. The two divergence equations imply ∑a∂aΔJa=0.

2.1givenF1F2F5step 1.1algebra

By [F2], each positive definite Hermitian Φi has a positive Hermitian square root Φi1/2. Its eigenvalues are the positive square roots of the positive eigenvalues of Φi, so Φi1/2 is invertible; define Φi−1/2:=(Φi1/2)−1. Differentiate the identity in step 1.1, sum over a, take traces, and discard the term tr⁡(Φ1(∑a∂aΔJa)Φ0−1)=0. This gives Δu=∑atr⁡(Φ1(J1,aΔJa−ΔJaJ0,a)Φ0−1). Since Φi†=Φi pointwise and derivatives are taken componentwise, (∂aΦi)†=∂aΦi. Thus Ji,a†=ΦiJi,aΦi−1. Substituting this relation and cyclically permuting factors inside the trace rewrites each summand as tr⁡((ΔJa)†Φ1ΔJaΦ0−1). With Ma:=Φ11/2ΔJaΦ0−1/2, this trace equals tr⁡(Ma†Ma)=∑i,j∣(Ma)ij∣2≥0. Hence Δu≥0.

3.1givenF1F2F3F4step 2.1algebra

The Hermitian matrix C:=Φ0−1/2Φ1Φ0−1/2 is positive definite: for v≠0, v†Cv=(Φ0−1/2v)†Φ1(Φ0−1/2v)>0. Let μ0,…,μn−1>0 be the eigenvalues of Φ0. In an orthonormal eigenbasis, determinant multiplicativity and det⁡(U†U)=det⁡In=1 for the unitary change-of-basis matrix U give det⁡Φ0=∏jμj=1; hence det⁡(Φ0−1/2)=∏jμj−1/2=1. Therefore determinant multiplicativity gives det⁡C=det⁡(Φ0−1/2)2det⁡Φ1=1. For the positive eigenvalues λ0,…,λn−1 of C, orthonormal diagonalization gives det⁡C=∏jλj and tr⁡C=∑jλj. Cyclicity of trace gives tr⁡C=tr⁡(Φ1Φ0−1), and [F4] gives 1=(∏jλj)1/n≤1n∑jλj=tr⁡C/n, so u=tr⁡C−n≥0. Equality u=0 forces equality in AM-GM, hence all λj=1 and C=In; multiplying by Φ01/2 on both sides gives Φ1=Φ0. Therefore u=0 holds exactly when Φ1=Φ0.

3.2givenF6step 2.1algebra

Suppose Φ1=Φ0 on ∂Ω, so u=0 there. Since Ω is nonempty and bounded, Ω‾ is nonempty, closed and bounded, hence compact by [F6]; choose R>0 with Ω‾⊆{x:∣x∣≤R}. For each ϵ>0, the continuous function uϵ(x):=u(x)+ϵ∣x∣2 attains a maximum on Ω‾ by [F6]. Since Δuϵ=Δu+2dϵ>0, this maximum cannot occur at an interior point: at any interior local maximum x, each symmetric second difference [uϵ(x+hea)+uϵ(x−hea)−2uϵ(x)]/h2 is nonpositive for sufficiently small h, so taking h→0 gives ∂a2uϵ(x)≤0 for every a and hence Δuϵ(x)≤0, a contradiction. The maximum is therefore on the boundary, where uϵ≤ϵR2. Thus u(x)≤ϵR2 for every x∈Ω; letting ϵ↓0 gives u≤0.

4.1step 3.1step 3.2algebra∎

Step 3.1 gives u≥0, whereas step 3.2 gives u≤0. Hence u=0 on Ω and, by continuity, on Ω‾. The equality case in step 3.1 then yields Φ1=Φ0 throughout Ω‾.

Depends on

Dependency tree · 2 levels

Sources