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 random cut crosses half the edges in expectation
Statement
In a finite simple graph with edges, place each vertex independently and uniformly in one of two sides. The number of crossing edges satisfies . Since , this random algorithm has expected value at least ; for both values are zero.
Facts & Assumptions
Given: A finite simple graph with , the random placement of each vertex on one of two sides according to a fair independent bit , and the number of edges whose endpoints land on different sides.
Every edge of a finite simple graph is a two-element subset of distinct vertices. (A finite simple graph is a finite vertex set together with a set of two-element vertex subsets)
In a finite product of finite probability spaces the coordinate events are mutually independent, and for a set of coordinates the probability of the intersection is the product of the coordinate probabilities. (Product weights normalize, and coordinate events are mutually independent)
For every event one has , and a finite sum of indicators counts the events containing the outcome. (Indicators turn event probabilities, intersections, and finite counts into expectations and products)
Expectation is linear for every finite family of real random variables, with no independence hypothesis. (Expectation is linear for every finite family of random variables, without any independence hypothesis)
For the maximization problem Max-Cut the objective is the number of crossing edges; the optimum is a maximum over the finitely many placements, and a randomized algorithm whose expected value is at least half the optimum is the corresponding -guarantee in value form. (Optimization problems and approximation ratios)
Proof
Take one uniform two-point probability space per vertex and form their finite product; its outcomes are the maps with the weights of [F2], so the bits are independent and each is or with probability . Interpret side as the side of vertex ; this is exactly the stated independent uniform placement.
For each edge define the indicator of the event that crosses the cut, and put . At each outcome the sum counts precisely the crossing edges, so is the number of crossing edges.
Fix an edge . The events and are coordinate events, so [F2] gives ; similarly . The two cases are disjoint and exhaust , hence .
By [F3] and step 2.2, for every edge .
If , then at every outcome by the empty-sum convention of [F3], so ; also every placement crosses all zero edges, so , and both values are zero.
By linearity [F4] applied to the finite family , . The calculation uses only the individual probabilities of step 3.1; no independence between distinct edge indicators is assumed or needed.
Every placement yields a cut with at most crossing edges, since has edges in total; hence , and step 4.1 gives .
Consequently the independent uniform placement produces a cut whose expected number of crossing edges is , at least half of in the value sense of [F5], with the zero-edge case covered by step 3.2.
Depends on
- Optimization problems and approximation ratios
- A finite simple graph is a finite vertex set together with a set of two-element vertex subsets
- Product weights normalize, and coordinate events are mutually independent
- Indicators turn event probabilities, intersections, and finite counts into expectations and products
- Expectation is linear for every finite family of random variables, without any independence hypothesis
Used by
Dependency tree · two levels
13 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
- Williamson and Shmoys, The Design of Approximation Algorithms, §§1.1, 1.6, 2.4, 5.1–5.2, 16.2, printed pp. 14–15, 24–26, 44–46, 107–109, 413–414 (standard reference, not scraped)
- Cornell CS 4820, Lecture notes on randomized approximation algorithms, §1.1–1.1.2, PDF pp. 1–3 (standard reference, not scraped)