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 . For any , the homogeneous exact semigroup maps entrywise nonnegative initial vectors to entrywise nonnegative vectors. For a forward Euler step of size , the map is entrywise nonnegative, and hence positivity preserving for every nonnegative input, exactly when where the minimum of an empty set is . For every , the backward Euler map 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, with , with , , and .
The weighted stiffness is 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).
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).
The finite matrix exponential is given by its locally convergent power series, has derivative , and satisfies for commuting matrices (Finite matrix exponential series and its identities).
Proof
Given: The finite weighted network and the nonnegative data conventions in the Statement.
If , all free-state assertions are vacuous, so assume . Put . For distinct free vertices , by [F1]. If , [F1] says that is constant on every positive-conductance component, so ; symmetry gives . Thus has zero column sums and is a finite column generator by [F2]. If is nonzero, let and . By [F2], is a probability vector, so it is entrywise nonnegative; multiplying by proves . If , its image is zero.
If , then has nonnegative off-diagonal entries and diagonal entries . Put . If , then for every free vertex. Since each , every conductance incident to a free vertex is zero; hence each free row of vanishes, , and its exponential is the identity. If , every entry of is nonnegative. For , each term of the matrix series is entrywise nonnegative. By [F3], since commutes with , is entrywise nonnegative.
The diagonal entries of are , and its off-diagonal entries are by [F1]. Thus all entries are nonnegative exactly when each diagonal is nonnegative, which is exactly for every with . If a diagonal is negative, applying the step matrix to the corresponding coordinate vector produces a negative coordinate, so the condition is sharp.
The mass state satisfies for the homogeneous network equation. Its solution is . Since and are entrywise positive diagonal matrices, where the second equality follows term by term from the matrix exponential series applied to the similarity . Steps 1.1–1.2 therefore prove positivity of for both boundary cases.
Let and solve . The matrix is symmetric positive definite because for nonzero , by [F1]; hence the solve exists uniquely. If is a minimum coordinate, extend by zero on . The edge formula for is a sum of terms , each nonpositive because every free neighbor has value at least and every Dirichlet value is zero. Therefore , contradicting . Thus 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
- Fan R. K. Chung, Spectral Graph Theory, Chapter 1: Eigenvalues and the Laplacian of a Graph, CBMS 92 (1997), complete chapter text (standard reference, not scraped)
- Ward Whitt, Continuous-Time Markov Chains, full lecture notes (2006) (standard reference, not scraped)