Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 6 and its proof, printed pp. 1325–1326 (published PDF). The rank identity used without proof in Theorem 5 is expanded here.
Statement. Let be a finite matroid of rank and let be an integer. On , let and define
Then is the base family of a matroid on ; this is the printed Theorem 6, stated there with no restriction on . Its rank function, which the proof of Theorem 5 uses without stating it, is given for every by
For , the same base description gives a matroid only when ; the copied ground set is then empty.
Proof. The family is nonempty: choose a base of and take one labeled copy of each . Every member has size .
Let and . Put and . Since , the projection is injective on , and similarly on . If , put . If , ordinary basis exchange for gives such that
is a base. Let be the unique member of over . If , then either or is a different labeled copy absent from . If , our choice gives , so . In every case
Thus the nonempty equal-sized family satisfies the basis exchange axiom and defines a matroid .
To prove (1), first let be independent in . It lies in a base . Projection is injective on , and is independent in , so is independent and
This proves the upper bound.
Conversely, choose a base of the restriction of to . For each , choose one labeled copy above , and let . Extend to a base of . Add one arbitrary labeled copy above each element of . The resulting set belongs to , so is independent in . Therefore
which proves (1).
If , then . The proposed base family is when and is empty when . Only the first case is a matroid base family.
This construction replaces each ground element by parallel labeled copies, but the proof uses only the displayed basis definition and finite matroid extension.