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.
Resting Bingham graph supports nonzero stress
Worked model calculation/counterexample; leaf, no downstream suppliers.
Example
Use the Bingham graph on with Frobenius norm , whose zero-rate value is . Let the strain rate be , let the yield-ball radius satisfy in Pa, and choose
This example tests membership in the constitutive graph only. It does not assert force balance, a realized material state, or an experimental observation.
Example references
Facts & Assumptions
Given: The Frobenius-normalized Bingham graph and a positive yield-ball radius .
Bingham yield graph and convex monotonicity: at zero strain rate, the Bingham graph value is the full set of trace-free symmetric stresses whose Frobenius norm is at most .
Pa and the strain rate is .
Proof
The displayed matrix is symmetric and has trace . Its squared Frobenius norm is the sum of its squared entries, , so .
By [F1] and , the admissible rest stresses are exactly the trace-free symmetric matrices with norm at most . Step 1.1 shows that meets these conditions; since , it is nonzero. Thus is a nonzero graph-admissible stress at rest.
Remarks
The figure shows the planar section of the five-dimensional space spanned by
These matrices are Frobenius-orthonormal, so stress coordinates in Pa give . The disk is the intersection of the full stress ball with this plane, and its boundary point represents the proved stress . The cross-section is explanatory; the proof above uses the matrix entries and the supplier's graph definition, not the drawing.
\begin{center} \begin{tikzpicture}[scale=1] \draw[->] (-1.45,0) -- (1.55,0) node[right] {}; \draw[->] (0,-1.35) -- (0,1.45) node[above] {}; \draw[thick] (0,0) circle [radius=1.1]; \fill (0,0) circle (1.2pt) node[below left] {}; \fill (1.1,0) circle (1.7pt) node[below right] {}; \draw[dashed] (0,0) -- (1.1,0) node[midway,above] {}; \end{tikzpicture} \end{center}