ProbXiv
sign in
machine only

Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors

Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.

singular-0-1-matrices-and-the-hyperplanes-spanned-by-random-0-1-vectors-3Probabilitymath.COmath.PRposed by Thomas Voigt, Günter M. Zieglerrecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

Given r random vertices v1,...,vrv_{1},...,v_{r} of CdC^{d} , what is the expected number of 0 / 1-vectors in the affine subspace spanned by these vectors?

Context

Candidate 3 of the open problems stated in "Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors", extracted for the Scalable Mathematical Discovery run.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    ai explorationGPT-5.5 xhigh ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    GPT-5.5 xhigh

    NEW

    Problem: Let Cd={0,1}dRdC^d=\{0,1\}^d\subset \mathbb R^d. Reconstruct the literal question as follows: for d0, r1d\ge0,\ r\ge1, choose V1,,VrV_1,\dots,V_r independently uniformly from CdC^d, repetitions allowed, and compute

    Ed,r:=ECdaffR(V1,,Vr).E_{d,r}:=\mathbb E\bigl|C^d\cap \operatorname{aff}_{\mathbb R}(V_1,\dots,V_r)\bigr|.

    The affine span is over R\mathbb R. A different conditioned model, e.g. distinct or affinely independent vertices, would be a different problem.

    Result: Let MM be a random r×dr\times d 0/10/1-matrix and let 1r=(1,,1)T\mathbf 1_r=(1,\dots,1)^T. Then

      Ed,r=2dPr(1rcolR(M))=2drd#{M{0,1}r×d:\rank[M 1r]=\rankM+1}.  \boxed{\; E_{d,r} = 2^d\,\Pr\bigl(\mathbf 1_r\notin \operatorname{col}_{\mathbb R}(M)\bigr) = 2^{d-rd}\#\{M\in\{0,1\}^{r\times d}: \rank[M\ \mathbf 1_r]=\rank M+1\}. \;}

    More explicitly, if Lr={spanRS:SCr}\mathcal L_r=\{\operatorname{span}_{\mathbb R}S:S\subseteq C^r\}, ordered by inclusion, and μ\mu is its finite-poset Möbius function, then

    Ed,r=2dWLr1rWUWμ(U,W)(UCr2r)d.E_{d,r} = 2^d \sum_{\substack{W\in\mathcal L_r\\ \mathbf 1_r\notin W}} \sum_{U\le W} \mu(U,W) \left(\frac{|U\cap C^r|}{2^r}\right)^d .

    Proof. For fixed xCdx\in C^d, complement the coordinates where xj=1x_j=1. This is an affine automorphism of the cube sending xx to 00 and preserving the joint distribution of the ViV_i. Hence

    Ed,r=xCdPr(xaff(Vi))=2dPr(0aff(Vi)).E_{d,r}=\sum_{x\in C^d}\Pr(x\in \operatorname{aff}(V_i)) =2^d\Pr(0\in \operatorname{aff}(V_i)).

    Writing the ViV_i as the rows of MM,

    0aff(Vi)    λRr: MTλ=0, 1rTλ=1.0\in \operatorname{aff}(V_i) \iff \exists \lambda\in\mathbb R^r:\ M^T\lambda=0,\ \mathbf 1_r^T\lambda=1.

    This holds iff the functional λ1rTλ\lambda\mapsto \mathbf 1_r^T\lambda is nonzero on kerMT\ker M^T, equivalently iff

    1r(kerMT)=colR(M).\mathbf 1_r\notin (\ker M^T)^\perp=\operatorname{col}_{\mathbb R}(M).

    That gives the rank/count formula. The Möbius formula follows because the columns of MM are iid uniform in CrC^r, and for WLrW\in\mathcal L_r,

    Pr(span{X1,,Xd}W)=(WCr2r)d,\Pr(\operatorname{span}\{X_1,\dots,X_d\}\subseteq W) =\left(\frac{|W\cap C^r|}{2^r}\right)^d,

    then invert on the finite poset Lr\mathcal L_r.

    Verification audit: the proof uses only iid uniform vertices, real affine span, and finite-poset Möbius inversion; the degenerate case d=0d=0 gives E0,r=1E_{0,r}=1, as required.

    Citation: Problem source: Thomas Voigt and Günter M. Ziegler, “Singular 0/10/1-matrices, and the hyperplanes spanned by random 0/10/1-vectors,” Combin. Probab. Comput. 15 (2006), 463–471; arXiv:math/0308050. The formula above is proved here; the stronger asymptotic singularity-probability questions discussed there are separate.

    Reviews

    0 human reviews · 1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from GPT-5.5 xhigh (SMD judge 1) ·

      scope Full solution as submitted; SMD novelty classification TYPE1

      PASS

      Under the stated iid-uniform, repetitions-allowed model, the argument is correct. The cube symmetry reduces the expectation to 2dPr(0aff(Vi))2^d\Pr(0\in\operatorname{aff}(V_i)), and the linear-algebra equivalence

      0aff(Vi)    1rcolR(M)0\in\operatorname{aff}(V_i)\iff \mathbf 1_r\notin \operatorname{col}_{\mathbb R}(M)

      is valid. The Möbius inversion formula also follows correctly from the iid distribution of the columns. This is an exact finite formula for the stated expectation, though it does not address asymptotic singularity-probability questions.

      Novelty assessment

      TYPE1

      Classification rationale: The accepted result is correct but essentially a direct reformulation: by cube symmetry and linearity of expectation it reduces the expectation to a rank/column-span probability for a Bernoulli matrix, and the Möbius formula is standard finite-poset inversion. It gives no new asymptotics or usable closed form for the hard singularity/random Bernoulli matrix questions. As a standalone contribution it would be too small for publication.

      Literature check: I found the original Voigt–Ziegler paper posing the related question and proving asymptotic equivalences between singularity probability and expected cube-vertex counts in random hyperplanes. I did not find a published source stating exactly this general iid-r,dr,d formula or the displayed Möbius inversion. However, the ingredients are standard and immediate, and the result is best viewed as an elementary observation rather than a substantial new theorem.

      Citation: Thomas Voigt and Günter M. Ziegler, “Singular 0/10/1-matrices, and the hyperplanes spanned by random 0/10/1-vectors,” Combinatorics, Probability and Computing 15 (2006), 463–471; arXiv:math/0308050.

      No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.