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 four-vertex integral network with an exhibited maximum flow and minimum cut of value five
Example
Let the vertices be , with labelled arcs and capacities The flow with values in that order has value five and is maximum.
Facts & Assumptions
Given: The displayed finite integral network and flow .
Finite integral max-flow min-cut equates a maximum flow value and a minimum cut capacity (Ford-Fulkerson terminates for finite integer capacities and proves max-flow min-cut with an integral maximum flow).
Verification
Verification technique: direct.
At , incoming flow equals outgoing flow , and at , incoming flow equals outgoing flow ; every arc value is within its capacity.
The flow value is , while the cut has capacity .
By [L1], the exhibited feasible flow and cut of common value five are respectively maximum and minimum.
This network therefore has max-flow value and min-cut capacity both equal to five.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 24 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.