Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 graph-diffusion semigroup and Euler maps

Statement

Use the data of Finite weighted network diffusion data and write L=LD. For any t≥0, the homogeneous exact semigroup SD(t)=e−tM−1L maps entrywise nonnegative initial vectors to entrywise nonnegative vectors. For a forward Euler step of size τ≥0, the map EF(τ)=I−τM−1L is entrywise nonnegative, and hence positivity preserving for every nonnegative input, exactly when 0≤τ≤τF:=min⁡i∈ILii>0miLii, where the minimum of an empty set is +∞. For every τ>0, the backward Euler map (M+τL)−1M exists and is positivity preserving. The forward Euler threshold is sharp for positivity of the full step matrix.

Facts & Assumptions

Given: A finite graph, free and Dirichlet vertices, M=diag⁡(mi) with mi>0, C=diag⁡(ce) with ce≥0, L=LD, and τ≥0.

[F1]

The weighted stiffness is LD=BCBT restricted to free vertices; it is symmetric positive semidefinite, has nonpositive off-diagonal entries, and its kernel is the componentwise constant space stated in (Finite weighted network diffusion data, Energy, kernel, and weighted mass balance for a finite network).

[F2]

A finite column generator has nonnegative off-diagonal entries and zero column sums; its finite master equation has the matrix-exponential solution and maps probability vectors to probability vectors (Finite column generator, Finite master equation and uniformization formula).

[F3]

The finite matrix exponential is given by its locally convergent power series, has derivative QetQ, and satisfies eAeB=eA+B for commuting matrices (Finite matrix exponential series and its identities).

Proof

Given: The finite weighted network and the nonnegative data conventions in the Statement.

1.1F1F2givenalgebra

If I=∅, all free-state assertions are vacuous, so assume I≠∅. Put Q=−LM−1. For distinct free vertices i,j, Qij=−Lij/mj≥0 by [F1]. If D=∅, [F1] says that 1 is constant on every positive-conductance component, so L1=0; symmetry gives 1TL=0. Thus Q has zero column sums and is a finite column generator by [F2]. If p0≥0 is nonzero, let s=1Tp0>0 and π=p0/s. By [F2], etQπ is a probability vector, so it is entrywise nonnegative; multiplying by s proves etQp0≥0. If p0=0, its image is zero.

1.2F1F3givenconstruct

If D≠∅, then Q has nonnegative off-diagonal entries and diagonal entries Qii=−Lii/mi. Put λ=max⁡i∈ILii/mi≥0. If λ=0, then Lii=∑e incident to ice=0 for every free vertex. Since each ce≥0, every conductance incident to a free vertex is zero; hence each free row of LD vanishes, Q=0, and its exponential is the identity. If λ>0, every entry of Q+λI is nonnegative. For t≥0, each term of the matrix series et(Q+λI)=∑k≥0tk(Q+λI)k/k! is entrywise nonnegative. By [F3], since −λtI commutes with t(Q+λI), etQ=e−λtIet(Q+λI)=e−λtet(Q+λI) is entrywise nonnegative.

1.3F1givenalgebra

The diagonal entries of EF(τ) are 1−τLii/mi, and its off-diagonal entries are −τLij/mi≥0 by [F1]. Thus all entries are nonnegative exactly when each diagonal is nonnegative, which is exactly τ≤mi/Lii for every i with Lii>0. If a diagonal is negative, applying the step matrix to the corresponding coordinate vector produces a negative coordinate, so the condition is sharp.

2.1F3step 1.1step 1.2algebra

The mass state p=Mu satisfies p′=Qp for the homogeneous network equation. Its solution is p(t)=etQp(0). Since M and M−1 are entrywise positive diagonal matrices, u(t)=M−1etQMu(0)=e−tM−1Lu(0), where the second equality follows term by term from the matrix exponential series applied to the similarity M−1QM=−M−1L. Steps 1.1–1.2 therefore prove positivity of SD(t) for both boundary cases.

3.1F1givenstep 1.1algebra∎

Let y≥0 and solve (M+τL)x=My. The matrix is symmetric positive definite because for nonzero x, xT(M+τL)x≥∑imixi2>0 by [F1]; hence the solve exists uniquely. If xk<0 is a minimum coordinate, extend x by zero on D. The edge formula for (Lx)k is a sum of terms ce(xk−xˉother(e)), each nonpositive because every free neighbor has value at least xk and every Dirichlet value is zero. Therefore ((M+τL)x)k=mkxk+τ(Lx)k<0, contradicting (My)k=mkyk≥0. Thus x≥0 and backward Euler is positivity preserving.

Depends on

Used by

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