Wiki
Wiki

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 (S,M)(S,M) be a finite matroid of rank r(M)r(M) and let k≥1k\ge1 be an integer. On Sk=S×[k]S^k=S\times[k], let π(x,h)=x\pi(x,h)=x and define

G={X⊆Sk:∣X∣=r(M) and π(X) is a base of M}.\mathcal G =\{X\subseteq S^k:|X|=r(M)\text{ and }\pi(X)\text{ is a base of }M\}.

Then G\mathcal G is the base family of a matroid MkM^k on SkS^k; this is the printed Theorem 6, stated there with no restriction on kk. Its rank function, which the proof of Theorem 5 uses without stating it, is given for every Z⊆SkZ\subseteq S^k by

rMk(Z)=rM(π(Z)).(1)r_{M^k}(Z)=r_M(\pi(Z)). \tag{1}

For k=0k=0, the same base description gives a matroid only when r(M)=0r(M)=0; the copied ground set is then empty.

Proof. The family G\mathcal G is nonempty: choose a base BB of MM and take one labeled copy (e,1)(e,1) of each e∈Be\in B. Every member has size r(M)r(M).

Let X,Y∈GX,Y\in\mathcal G and x=(e,a)∈Xx=(e,a)\in X. Put BX=π(X)B_X=\pi(X) and BY=π(Y)B_Y=\pi(Y). Since ∣X∣=∣BX∣|X|=|B_X|, the projection is injective on XX, and similarly on YY. If e∈BYe\in B_Y, put f=ef=e. If e∉BYe\notin B_Y, ordinary basis exchange for e∈BX∖BYe\in B_X\setminus B_Y gives f∈BY∖BXf\in B_Y\setminus B_X such that

BX−{e}+{f}B_X-\{e\}+\{f\}

is a base. Let yy be the unique member of YY over ff. If f=ef=e, then either y=xy=x or yy is a different labeled copy absent from XX. If f≠ef\ne e, our choice gives f∉BXf\notin B_X, so y∉Xy\notin X. In every case

X−{x}+{y}∈G.X-\{x\}+\{y\}\in\mathcal G.

Thus the nonempty equal-sized family G\mathcal G satisfies the basis exchange axiom and defines a matroid MkM^k.

To prove (1), first let W⊆ZW\subseteq Z be independent in MkM^k. It lies in a base X∈GX\in\mathcal G. Projection is injective on XX, and π(X)\pi(X) is independent in MM, so π(W)\pi(W) is independent and

∣W∣=∣π(W)∣≤rM(π(Z)).|W|=|\pi(W)|\le r_M(\pi(Z)).

This proves the upper bound.

Conversely, choose a base CC of the restriction of MM to π(Z)\pi(Z). For each e∈Ce\in C, choose one labeled copy ze∈Zz_e\in Z above ee, and let W={ze:e∈C}W=\{z_e:e\in C\}. Extend CC to a base BB of MM. Add one arbitrary labeled copy above each element of B∖CB\setminus C. The resulting set belongs to G\mathcal G, so WW is independent in MkM^k. Therefore

rMk(Z)≥∣W∣=∣C∣=rM(π(Z)),r_{M^k}(Z)\ge |W|=|C|=r_M(\pi(Z)),

which proves (1).

If k=0k=0, then S0=∅S^0=\varnothing. The proposed base family is {∅}\{\varnothing\} when r(M)=0r(M)=0 and is empty when r(M)>0r(M)>0. Only the first case is a matroid base family. □\square

This construction replaces each ground element by kk parallel labeled copies, but the proof uses only the displayed basis definition and finite matroid extension.