Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 4, statement on printed p. 1324 and proof on p. 1325 (published PDF).
Statement. Let be a finite matroid with rank function , let be a finite indexed family, and let be integers. There is a -transversal of that is independent in if and only if
Proof. Suppose is an independent -transversal. For each , the set
is independent and has elements. Thus (1) is necessary.
For sufficiency, form the replicated family from the definitions. Let , and let
The union of the sets indexed by is , while . Condition (1) therefore gives
Rado's finite independent-representative theorem supplies an independent full transversal of . Its range is a -transversal of by the replicated-family correspondence. This proves sufficiency. If is empty, the argument reduces to the empty independent set and all displayed conditions hold.
Proof boundary. The reduction for arbitrary subfamilies of copied indices is proved here. Rado's finite theorem is the exact unproved input recorded in external inputs.