Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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 G with m edges, place each vertex independently and uniformly in one of two sides. The number X of crossing edges satisfies E[X]=m/2. Since OPT⁡MaxCut≤m, this random algorithm has expected value at least OPT⁡MaxCut/2; for m=0 both values are zero.

Facts & Assumptions

Given: A finite simple graph G=(V,E) with m=∣E∣, the random placement of each vertex v on one of two sides according to a fair independent bit bv, and the number X of edges whose endpoints land on different sides.

[F1]

Every edge of a finite simple graph is a two-element subset {u,v}⊆V of distinct vertices. (A finite simple graph is a finite vertex set together with a set of two-element vertex subsets)

[F2]

In a finite product of finite probability spaces the coordinate events are mutually independent, and for a set J of coordinates the probability of the intersection is the product of the coordinate probabilities. (Product weights normalize, and coordinate events are mutually independent)

[F3]

For every event A one has E[1A]=P(A), and a finite sum of indicators counts the events containing the outcome. (Indicators turn event probabilities, intersections, and finite counts into expectations and products)

[F4]

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)

[F5]

For the maximization problem Max-Cut the objective is the number of crossing edges; the optimum OPT⁡MaxCut is a maximum over the finitely many placements, and a randomized algorithm whose expected value is at least half the optimum is the corresponding 1/2-guarantee in value form. (Optimization problems and approximation ratios)

Proof

technique · direct
1.1F2givenconstruct

Take one uniform two-point probability space per vertex and form their finite product; its outcomes are the maps b:V→{0,1} with the weights of [F2], so the bits bv are independent and each is 0 or 1 with probability 1/2. Interpret side bv as the side of vertex v; this is exactly the stated independent uniform placement.

2.1F1F3step 1.1construct

For each edge e={u,v} define the indicator Xe:=1bu≠bv of the event that e crosses the cut, and put X:=∑e∈EXe. At each outcome the sum counts precisely the crossing edges, so X is the number of crossing edges.

2.2F2step 1.1algebra

Fix an edge e={u,v}. The events {bu=0} and {bv=1} are coordinate events, so [F2] gives P[bu=0,bv=1]=12⋅12=14; similarly P[bu=1,bv=0]=14. The two cases are disjoint and exhaust {bu≠bv}, hence P[bu≠bv]=14+14=12.

3.1F3step 2.2algebra

By [F3] and step 2.2, E[Xe]=P[bu≠bv]=12 for every edge e.

3.2F3F5step 2.1algebra

If m=0, then X=∑e∈∅Xe=0 at every outcome by the empty-sum convention of [F3], so E[X]=0=m/2; also every placement crosses all zero edges, so OPT⁡MaxCut=0, and both values are zero.

4.1F4step 2.1step 3.1algebra

By linearity [F4] applied to the finite family (Xe)e∈E, E[X]=∑e∈EE[Xe]=m⋅12=m/2. The calculation uses only the individual probabilities of step 3.1; no independence between distinct edge indicators is assumed or needed.

5.1F5step 4.1algebra

Every placement yields a cut with at most m crossing edges, since G has m edges in total; hence OPT⁡MaxCut≤m, and step 4.1 gives E[X]=m/2≥OPT⁡MaxCut/2.

6.1step 5.1step 3.2∎

Consequently the independent uniform placement produces a cut whose expected number of crossing edges is m/2, at least half of OPT⁡MaxCut in the value sense of [F5], with the zero-edge case covered by step 3.2.

Depends on

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