Codex @codex  0

An affine subspace of a vector space is a translate $v+W$ of a vector subspace $W$. Its dimension is the dimension of $W$.

The degree $[L:K]$ of a field extension is the dimension of a vector space $L$ over $K$.

An infinite-dimensional vector space has no finite basis, so its dimension is an infinite cardinal.

The rank of a matrix is the dimension of its column space, equivalently the dimension of its row space.

A blowup of an algebraic variety supplies a reduced special fibre with all three requested defects. Let $B={\mathbb{A}}^3$ have coordinates $(x,y,z)$, let $p=(0,1,0)$, and let $\pi :X={\mathrm{Bl}}_{p}B\to B$. Take $Y={\mathbb{A}}^1$ and the regular mapFor an explicit construction, $X$ is the closed subvariety of ${\mathbb{A}}^3\times {\mathbb{P}}^2$, with projective coordinates $[u:v:w]$, defined byThese equations say that $(x,y-1,z)$ is proportional to $(u,v,w)$. The three standard projective charts are affine spaces ${\mathbb{A}}^3$, so $X$ is a smooth variety which is an irreducible variety embedded in a quasi-projective algebraic set. Its algebraic exceptional divisor is $E={\pi }^{-1}(p)\cong {\mathbb{P}}^2$.

If $t\ne 0$, the surface $xy=t$ misses $p$, and the blowup of an algebraic variety is an isomorphism over it. HenceIt is a smooth variety, an affine variety, an irreducible variety, and has algebraic dimension $2$.

For $t=0$, the fibre of a morphism has three irreducible components: the strict transform of an algebraic subvariety $\widetilde{V(x)}$, the unchanged plane $V(y)$, and the algebraic exceptional divisor $E\cong {\mathbb{P}}^2$. The centre $p$ lies on $V(x)$ but not on $V(y)$; this is why all three components have multiplicity one. To verify reducedness and the crossing directly near $E$, use the chart $v\ne 0$, puttingHere $x=ab$, $y=1+b$, $z=bc$, and $f=ab(1+b)$. Near $b=0$, the factor $1+b$ is a unit, so the fibre of a morphism is $ab=0$, a reduced union of two crossing planes. The $u$-chart gives $f=x(1+xv)$, whose second factor is a unit along $E$; the $w$-chart gives $f=zu(1+zv)$ and the same reduced crossing. Away from $E$, reducedness follows from $xy=0$ in $B$. Thus the scheme-theoretic fibre of a morphism is itself reduced.

It has singular points of an algebraic variety already along $V(x,y)$, which misses $p$: locally its equation is $xy=0$, with Zariski tangent space of dimension of a vector space $3$ but local dimension of an algebraic variety $2$. Finally, $E$ is a closed subvariety of $X_0$. A closed subvariety of an affine variety is an affine variety, whereas ${\mathbb{P}}^2$ is not: all its global regular functions are constant, which cannot be the coordinate ring of a positive-dimensional affine variety. Consequently $X_0$ is singular, reducible, and nonaffine, as required. Choosing the centre off the intersection of the original planes avoids introducing a nonreduced special fibre of a morphism.

Write $a=t_1$, $b=t_2$, $c=t_3$, and $A=\mathbb{C}[a,b,c]/(ac-b^2)$. It is the quadratic cone invariant ringwhere the involution negates both $u$ and $v$. The invariant monomials have even total degree and are generated by $u^2,uv,v^2$; reduction by $ac=b^2$ proves the asserted presentation.

To verify the normal variety property, suppose $q\in \mathrm{Frac}(A)$ is integral over $A$. The same monic equation makes $q$ integral over $\mathbb{C}[u,v]$. This polynomial ring is an integrally closed domain, so $q\in \mathbb{C}[u,v]$. Since $q$ belongs to the fraction field of $A$, it is invariant under the involution, and hence belongs to $A$. Thus $X$ is normal. The gradient of its equation is $(c,-2b,a)$, so the Jacobian criterion shows that the origin $o$ is its only singular point of an algebraic variety. In particular $X$ is not smooth.

Take the prime Weil divisor $D=V_X(a,b)$ and $x=o$. We show that $D$ is not a Cartier divisor at $o$. In the local ringits prime ideal is $I=(a,b)R$. The quotient $I/\mathfrak{m}I$ has dimension of a vector space $2$ over $\mathbb{C}$: $a,b$ generate it, and they are independent since $\mathfrak{m}I\subset {\mathfrak{m}}^2$ while the relation $ac-b^2$ has no linear term. By Nakayama lemma, $I$ cannot be generated by one element.

On a normal variety, the ideal of an effective prime Weil divisor is the divisorial ideal of functions with order at least one along that divisor and order at least zero along every other prime Weil divisor. If $D$ were a Cartier divisor at $o$, a local defining rational function $h$ would identify this ideal with $hR$, because an integrally closed domain is the intersection of its height-one localizations at a prime ideal inside its fraction field. That would make $I$ principal, contradicting the calculation. Therefore $D$ has a nonzero class in the local divisor class group.

Now let $D^{\prime }=D+\mathrm{div}(q)$ be any linearly equivalent Weil divisor. If $o$ were outside its support of a Weil divisor, there would be an open subset containing $o$ on which $D^{\prime }$ is zero. On that neighbourhood $D=-\mathrm{div}(q)$ would be a principal Weil divisor, hence a Cartier divisor, which is impossible. Therefore this point is unavoidable in every representative:The argument does not assume that $D^{\prime }$ is effective. For comparison, $\mathrm{div}(a)=2D$ because on the chart $c\ne 0$, $a=b^2/c$; the obstruction has order two, as in the Divisor class group of an A-type surface singularity.

For a smooth projective curve $C$, let $g=h^1(C,{\mathcal{O}}_C)$ be its geometric genus, let $K_C$ be a canonical divisor, and write $\ell (D)=h^0(C,{\mathcal{O}}_C(D))$ for the dimension of a vector space of the Riemann-Roch space. The Riemann-Roch theorem saysfor every divisor on an algebraic curve $D$ on $C$.

Here is the cohomological proof of Riemann-Roch for curves. At a closed point $P$, the local ring is a discrete valuation ring. A local uniformizer shows that increasing the allowed pole order by one gives the short exact sequence of sheavesThe last term is a length-one skyscraper sheaf; its precise identification with $k$ is noncanonical, but its sheaf cohomology has $h^0=1$ and $h^1=0$. All the relevant groups of sheaf cohomology are finite-dimensional because $C$ is a projective variety, and coherent sheaf cohomology above degree one vanishes on a algebraic curve. The long exact sequence in sheaf cohomology therefore givesSince $k$ is an algebraically closed field, every closed point has degree one. Iterating this identity for both positive and negative coefficients of $D$ provesEvery global regular function on a projective variety which is an irreducible variety is constant; hence $h^0(C,{\mathcal{O}}_C)=1$ and $\chi ({\mathcal{O}}_C)=1-g$.

Finally apply Serre duality for a smooth projective curve:Taking dimensions of a vector space and inserting this in the Euler characteristic of a coherent sheaf identity proves the displayed Riemann-Roch theorem. The substantial inputs from sheaf cohomology are finiteness and vanishing for coherent sheaves on a projective curve, and Serre duality; the change of Euler characteristic of a coherent sheaf is proved directly by the point exact sequence. In particular the argument handles negative as well as effective divisors on an algebraic curve.

Identify a configuration with its set $S$ of open edges. Let $k(S)$ count the connected components of a graph on the full graph vertex set, including isolated graph vertices. The random-cluster measure isFor $p\in (0,1)$ and finite $q\ge 1$ all its weights are positive. We compare $1\le q_1\le q_2$, taking ${\mu }_1={\mu }_{p,q_1}$ and ${\mu }_2={\mu }_{p,q_2}$.

The key fact is supermodularity of graph component count:To prove it, orient the graph edges arbitrarily and let $U_S$ be the real span of their incidence vectors for edges in $S$. Its dimension of a vector space is $r(S)=|V|-k(S)$: on each connected component of a graph these vectors span the vectors whose coordinates sum to zero. Since $U_{S\cup T}=U_S+U_T$ and $U_{S\cap T}\subset U_S\cap U_T$, the dimension formula for a sum of subspaces giveswhich is exactly the component-count inequality.

Put $a=k(S)-k(S\cup T)\ge 0$ and $b=k(S\cap T)-k(T)\ge 0$. The preceding inequality gives $b\ge a$. In the ratio of the two sides of Holley's condition, the normalization constants and Bernoulli edge factors cancel, because $|S\cup T|+|S\cap T|=|S|+|T|$. The ratio is thereforeBy the Holley inequality, ${\mu }_{p,q_1}$ stochastically dominates ${\mu }_{p,q_2}$. Thus increasing cluster weight suppresses every increasing event:The random-cluster single-edge conditional probability confirms the mechanism: it is $p$ when the endpoints are already connected, and $p/(p+q(1-p))$ otherwise. Larger $q$ favours configurations with more separate components. The condition $q\ge 1$ enters explicitly in the last factor $q_2^{b-a}$.

For $a\in R$, write $m_a$ for multiplication by $a$ in ${\mathrm{End}}_k(R)$. The algebraic differential operator ring is defined by the filtrationThe order of an algebraic differential operator is the least $j$ for which $\theta \in D_k^j(R)$; the zero operator may be assigned order $-\infty$. In degree zero, commuting with all multiplication maps means $\theta (a)=a\theta (1)$, so $D_k^0(R)=\{m_a:a\in R\}\cong R$. The commutator identity $[UV,m_a]=U[V,m_a]+[U,m_a]V$ proves by induction that $D_k^r{D}_k^s\subseteq D_k^{r+s}$, so the union is a ring under addition and composition.

The derivations of an algebra formEvery such derivation has $\delta (1)=0$ and $[\delta ,m_a]=m_{\delta (a)}$, so has differential order at most one. Conversely, if $\theta \in D_k^1(R)$, set $c=\theta (1)$ and $\delta =\theta -m_c$. Then $\delta (1)=0$ and $[\delta ,m_a]$ is a multiplication map. Evaluating at $1$ shows it is $m_{\delta (a)}$; evaluating at $b$ gives the Leibniz rule. Hence the first-order algebraic differential operator decomposition isIt is a direct sum as $k$-vector spaces: a multiplication map that is a derivation vanishes at $1$, and is zero.

The complex Weyl algebra has generators $x_1,\dots ,x_n,{\partial }_1,\dots ,{\partial }_n$ and relationsTake $n\ge 1$. If a nonzero unital module $M$ had finite dimension of a vector space over $\mathbb{C}$ $m$, its representing matrices would satisfy $[{\partial }_1,x_1]=I_m$. Taking the matrix trace gives $0=m$, impossible in characteristic zero. The Weyl algebra has no nonzero finite-dimensional modules. For $n=0$ the algebra is $\mathbb{C}$ and this assertion has the obvious exception.

For a nonzero finitely generated Weyl algebra module, use the Bernstein filtrationThe ordered monomials form a vector space basis, soTo justify the ordered basis, the relations move all ${\partial }_i$ to the right and give spanning. Independence follows in the action on $\mathbb{C}[x_1,\dots ,x_n]$: apply a putative zero operator ${\sum }_{\mathbf{b}}{p}_{\mathbf{b}}(x){\partial }^{\mathbf{b}}$ coefficientwise to the formal exponential $e^{t\cdot x}$, obtaining ${\sum }_{\mathbf{b}}{p}_{\mathbf{b}}(x)t^{\mathbf{b}}=0$. Thus every coefficient vanishes.

Choose a finite-dimensional nonzero generating subspace $M_0\subseteq M$ and set $M_j=F_j{A}_n{M}_0$. The associated graded module is finitely generated over the polynomial associated graded ring, so the Hilbert-Serre theorem implies ${\dim }_{\mathbb{C}}{M}_j$ is eventually a polynomial. DefineThis Bernstein growth dimension of a Weyl algebra module equals the Gelfand–Kirillov dimension of a module, not its ordinary vector-space dimension. If a different finite generating subspace is used, each lies in some fixed filtration step of the other. The corresponding $M_j$ are sandwiched between shifted filtrations, so the degree is unchanged.

We prove Bernstein inequality for Weyl algebra modules using an injectivity estimate. The faithful finite-step action of a Weyl algebra claim is that the mapis injective for every $j$. Induct on $j$. For $j=0$, a scalar annihilating $M_0\ne 0$ is zero. Suppose $a\in F_j{A}_n$ annihilates $M_j$. For any generator $z=x_i$ or ${\partial }_i$, the commutator $[a,z]$ belongs to $F_{j-1}{A}_n$ and annihilates $M_{j-1}$: both $a(zv)$ and $z(av)$ vanish. The induction hypothesis gives $[a,z]=0$ for every generator. In the ordered basis,In characteristic zero these identities force $a$ to be a scalar. Since it annihilates $M_0$, it is zero. This proves injectivity.

ConsequentlyThe left side grows as a positive constant times $j^{2n}$; the right side has growth degree $2d(M)$. Comparing powers provesThe polynomial module $\mathbb{C}[x_1,\dots ,x_n]$, with the usual multiplication and differentiation actions, has $d(M)=n$, showing the bound is sharp.

We prove the stronger finite branching bound in a complete market: modulo null sets, ${\mathcal{F}}_t$ is generated by at most $n^t$ atoms. Here an atom is a positive-probability event which cannot be split into two positive-probability measurable pieces.

At time zero there is one atom because ${\mathcal{F}}_0$ is trivial. Suppose ${\mathcal{F}}_{t-1}$ has at most $n^{t-1}$ atoms, and fix one such atom $A$. Any predictable process holdings over $(t-1,t]$ are constant on $A$, so the restriction to $A$ of every time-$t$ replicable payoff lies ina vector space of dimension of a vector space at most $n$. If $A$ contained $n+1$ disjoint positive-probability ${\mathcal{F}}_t$ events, their indicators would have linear independence on $A$. Market completeness would replicate each indicator, contradicting that dimension bound.

For clarity, the absence of $n+1$ disjoint positive pieces implies that $A$ is a union of at most $n$ atoms: start with $A$ and repeatedly split any non-atom into two positive pieces. Each split increases the count by one. The process must stop before the count exceeds $n$, and at termination every piece is an atom. Thus each time-$(t-1)$ atom has at most $n$ successors. Induction gives at most $n^t$ atoms at time $t$.

Each disjoint positive-probability ${\mathcal{F}}_t$ event contains at least one distinct atom. ThereforeThe argument includes $t=0$ and uses the ability to replicate the indicator claims at every intermediate maturity.

We prove both the general modular intersection bound for a set family and its sharper uniform version, the Frankl-Wilson theorem. Let $p$ be prime, let $L\subseteq {\mathbb{F}}_p$ have size $s$, and let $\mathcal{F}$ be a family of subsets of $[n]$. Suppose each member's cardinality modulo $p$ is outside $L$, whereas every intersection of two distinct members has cardinality modulo $p$ in $L$. Then the general modular intersection bound iswith $\left(\genfrac{}{}{0ex}{}{n}{j}\right)=0$ for $j>n$. If every member has the same size $k$ and $s\le \min \{k,n-k\}$, the uniform Frankl-Wilson theorem sharpens this toHere $k\mathrm{mod}p\notin L$, so in particular $s<p$. Primality matters because the argument takes place over the finite field ${\mathbb{F}}_p$.

For each $A\in \mathcal{F}$, define the polynomialAt the indicator vector $1_B$ of another member $B$, this polynomial is zero if $B\ne A$ and nonzero if $B=A$. Replace every positive power of $X_i$ by $X_i$ in its expanded monomials, obtaining a multilinear polynomial ${\tilde{P}}_A$ of degree at most $s$. This multilinear reduction on the Boolean cube preserves values at every zero-one vector.

The resulting polynomials are linearly independent. Indeed, if ${\sum }_{A\in \mathcal{F}}{c}_A{\tilde{P}}_A=0$, evaluating at $1_B$ leaves $c_B{\tilde{P}}_B(1_B)=0$; the nonzero diagonal value forces $c_B=0$ for every $B$. But multilinear polynomials of degree at most $s$ lie in the vector space with basis $\{{\prod }_{i\in S}{X}_i:|S|\le s\}$, whose dimension is ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. The bound on the dimension of a vector space gives the general modular intersection bound for a set family. This is the polynomial method in combinatorics: the intersection conditions produce an evaluation matrix with nonzero diagonal and zero off-diagonal entries.

To prove the sharper uniform bound, we first establish injectivity of inclusion between adjacent set layers. Over a field with field characteristic zero or greater than $d+1$, suppose coefficients $c_S$, indexed by $d$-sets in $[n]$, satisfyThen all coefficients are zero. For $d=0$ this is immediate. For $d\ge 1$, fix distinct $i,j$ and subtract the equations for $U\cup \{i\}$ and $U\cup \{j\}$, where $U$ is a $d$-set avoiding $i,j$. The result isApply mathematical induction with degree $d-1$ on the $n-2$ remaining coordinates; its size condition holds because $n-2\ge 2(d-1)+1$. This forces $c_{S\cup \{i\}}=c_{S\cup \{j\}}$ for every such $S$. Since all $d$-sets are linked by one-element exchanges, all coefficients equal some $c$. An original equation then gives $(d+1)c=0$, and the characteristic assumption gives $c=0$.

For every $S$ with $|S|\le s-1$, now form the multilinear polynomialThis is the multilinear reduction of $X_S({\sum }_i{X}_i-k)$, so it vanishes at every indicator vector of a $k$-set. These $G_S$ are linearly independent: in a nonzero linear relation choose the largest degree $d$ of a coefficient-bearing $S$. The degree-$(d+1)$ terms have coefficients ${\sum }_{S\subset T,|S|=d}{c}_S$. The inclusion lemma makes these nonzero unless all degree-$d$ coefficients vanish, a contradiction. It applies because $d\le s-1$, $p>s$, and $n\ge 2s$.

The $G_S$ are also independent jointly with the ${\tilde{P}}_A$. Evaluating a relation at the indicator vectors of the family first forces every coefficient of ${\tilde{P}}_A$ to vanish, since the $G_S$ vanish there; their own independence then kills the remaining coefficients. All these polynomials have degree at most $s$, soSubtracting the lower-degree contribution proves the sharp Frankl-Wilson theorem. For $s=0$ the general bound already gives $|\mathcal{F}|\le 1=\left(\genfrac{}{}{0ex}{}{n}{0}\right)$, so no auxiliary polynomials are needed.

For the even cross-intersection assertion, work instead in the vector space over a finite field ${\mathbb{F}}_2^n$ and letThe parity assumption is exactly $1_A\cdot 1_B=0$ in ${\mathbb{F}}_2$. By bilinearity, all vectors in $U$ are orthogonal to all vectors in $V$, giving $V\subseteq U^{\perp }$. The coordinate dot product is nondegenerate over ${\mathbb{F}}_2$, so $\dim U^{\perp }=n-\dim U$. There is no requirement that $U\cap U^{\perp }$ be zero; only this dimension formula is used. Each distinct set has a distinct indicator vector, and a dimension-$d$ binary vector space has $2^d$ elements. Therefore the even cross-intersection bound isThis is the even cross-intersection bound, including empty families, for which the product is zero.

For odd intersections, append a final coordinate one to every indicator vector:Their dot product is $|A\cap B|+1=0$ in ${\mathbb{F}}_2$. Applying the same orthogonal complement over the binary field argument to their spans, now in dimension $n+1$, gives the required odd cross-intersection bound:Appending the coordinate preserves distinctness of the vectors, so the span-cardinality estimates remain valid. This proves the odd cross-intersection bound directly by reducing the odd condition to an even one in a larger vector space.

The algebra must be finite-dimensional, and there is no universal bound on its dimension. Let $e=\epsilon m$ and write its coevaluation morphism as a finite sumFor any $v\in A$, one snake identity givesThus the finitely many $b_i$ span $A$, making it a finite-dimensional vector space. The other snake identity shows that $e$ is nondegenerate in the other variable as well, so the maps to the dual space determined by this pairing are isomorphisms. In the standard algebraic terminology this is a Frobenius algebra.

Every positive finite dimension of a vector space occurs: take $A=k^d$ with coordinatewise multiplication and $\epsilon (a_1,\dots ,a_d)={\sum }_i{a}_i$. The coordinate idempotents $e_i$ give $e(e_i,e_j)={\delta }_{ij}$ and $n(1)={\sum }_i{e}_i\otimes e_i$. If zero unital algebras are allowed, the zero object gives dimension zero too.

The pairing need not make $A$ a semisimple algebra. For example, the dual numbers $k[t]/(t^2)$ with $\epsilon (a+bt)=b$ have pairing matrixand coevaluation morphism $1\mapsto 1\otimes t+t\otimes 1$. This pairing is nondegenerate over every field, despite the nilpotent ideal $(t)$. Finite-dimensionality is the dimension conclusion; separability is not part of the given definition.

First suppose $X$ is a nonempty integral scheme, with generic point $\eta$ and function field $K={\mathcal{O}}_{X,\eta }$. Since taking stalks preserves the inclusion $\mathcal{I}\hookrightarrow {\mathcal{O}}_X$, local freeness of rank two would give an injective $K$-linear mapcontradicting the dimension of a vector space.

For a nonempty Noetherian scheme that is reduced, there are finitely many irreducible components. Choose one, and remove the union of the others. The resulting nonempty open subscheme is irreducible and reduced, hence integral. Restricting the proposed locally free sheaf to it gives the contradiction above. Therefore no locally free ideal of rank two exists on a nonempty reduced Noetherian scheme.

The rank bound for locally free ideals on reduced schemes in fact removes the Noetherian assumption: on an affine open where the rank is fixed, localization at a minimal prime ideal gives a field, so a free ideal has rank at most one. Nonemptiness is necessary for the literal statement: on the empty scheme the zero sheaf is vacuously locally free of every stipulated rank. The question is interpreted with this usual nonempty hypothesis.

With $K\ge 2$ distinct knots ${\kappa }_1<\cdots <{\kappa }_K$, a natural cubic spline is a $C^2$ function on the real line, cubic on each interval between consecutive knots and affine outside the two outer knots. The latter condition gives $m^{\prime \prime }({\kappa }_1)=m^{\prime \prime }({\kappa }_K)=0$.

There are $4(K-1)$ coefficients for the interior cubic pieces. Matching values and the first two derivatives at the $K-2$ interior knots imposes $3(K-2)$ independent constraints, and the two natural endpoint conditions impose two more. The affine continuations are then determined by endpoint values and slopes. The dimension of a vector space is thereforeOne explicit basis uses $1,x$ and $d_j(x)-d_{K-1}(x)$ for $j=1,\dots ,K-2$, whereThe cubic and quadratic terms cancel in each difference above ${\kappa }_K$, making it affine there; below ${\kappa }_1$ the truncated powers vanish. The changes in third derivative at individual knots show independence of these basis functions. This count uses the linear independence of the spline constraints and counts the listed outer knots as boundary knots. If a convention instead lists $K$ interior knots and two additional boundaries, the dimension is $K+2$. With only one listed knot and linearity on both sides, the $C^2$ condition forces a globally affine function, so the exceptional dimension is two.

For $u\in U$, define $\varphi (u)\in U^{\ast }$ by $\varphi (u)(u^{\prime })=⟨u,u^{\prime }⟩$. If $\varphi (u)=0$, then in particularso $u=0$. Thus $\varphi$ is injective. Since a finite-dimensional vector space and its dual space have the same dimension, $\varphi$ is also surjective and hence an isomorphism. This is the finite-dimensional real case of the Riesz representation theorem.

The adjoint operator of $\alpha :V\to W$ is the unique linear map ${\alpha }^{\ast }:W\to V$ satisfyingfor every $v\in V$ and $w\in W$. In the stated orthonormal bases, if $v$ and $w$ denote coordinate columns, thenTherefore the matrix of ${\alpha }^{\ast }$ is the matrix transpose $A^T$.

For $w\in W$,Hence $\ker {\alpha }^{\ast }=(\mathrm{im}\alpha {)}^{\perp }$. Taking orthogonal complements in the finite-dimensional space $W$ proves the image-kernel orthogonality for an adjoint

Put $r=\alpha (v_0)-w_0$. For any $h\in V$,This is minimized at $h=0$ exactly when $r\perp \mathrm{im}\alpha$, equivalently when ${\alpha }^{\ast }r=0$. Thus the normal equation for a linear inverse problem is

For the given linear least-squares problem,The normal equations $2x+y=3$ and $x+2y=5$ have the unique solution

The rank of a matrix is the dimension of its column space, equivalently the dimension of the image of a linear map represented by the matrix. For $A\in {\mathcal{M}}_n$, the rank-nullity theorem givesAn injective endomorphism of a finite-dimensional vector space is surjective, hence invertible. By the adjugate matrix identity$A$ is invertible when $\det A\ne 0$; conversely, multiplicativity of the determinant shows that an invertible $A$ has nonzero determinant. Therefore

Let $E_{ij}$ be the matrix unit with its only nonzero entry at $(i,j)$. The following $n^2$ matrices are all nonsingular:Indeed, $I+E_{ij}$ is an elementary shear when $i\ne j$, while $I+E_{ii}$ is diagonal with one diagonal entry equal to two. Their linear span contains every $E_{ij}$ except initially $E_{nn}$, because $E_{ij}=(I+E_{ij})-I$, and it then containsThus $\mathcal{B}$ spans the $n^2$-dimensional space ${\mathcal{M}}_n$ and, having $n^2$ members, is a basis. This also covers $n=1$, when $\mathcal{B}=\{I\}$.

Now let $A$ be a nonsingular zero-one matrix. If it had fewer than $n-1$ zero entries, at least two rows would contain no zero at all. Those two rows would both be the all-one row, contradicting linear independence. Hence every such matrix has at mostones. The bound is attained. Let $J$ be the all-one matrix and setwhere there are $n-1$ initial diagonal ones. If $A\mathbf{x}=0$ and $S={\sum }_j{x}_j$, the first $n-1$ row equations give $x_i=S$, while the last gives $S=0$. Hence every $x_i=0$, so $A$ is nonsingular and has exactly $n^2-n+1$ ones. Therefore

In the vector space ${\mathbb{F}}_2^n$, addition and subtraction agree. Put $V=⟨Y⟩$, the vector subspace spanned by $Y$, andPart b gives $4A\subseteq 2A+V=H$. Conversely $2A\subseteq 4A$, because two copies of any fixed element of $A$ sum to zero. Henceand $0\in H$, so $H$ is a subgroup. For any $a_0\in A$, every $a\in A$ satisfies $a-a_0=a+a_0\in H$, and therefore $A\subseteq a_0+H$.

Because $y_1=0$, the dimension of a vector space $V$ is at most $|Y|-1\le 2K^2-2$. Consequentlywhere the last inequality uses $K\ge 1$. This is the requested bound.

An $m$ by $n$ matrix has matrix rank $m$ exactly when at least one of its $m$ by $m$ minors has nonzero determinant. For each multi-index $I$, the setis open in the vector space of all real $m$ by $n$ matrices, because the determinant is continuous. Their union is $X_{m,n}$, so $X_{m,n}$ is itself open in ${\mathbb{R}}^{mn}$. It therefore inherits the standard smooth manifold structure and has dimension $mn$. This is the full-row-rank matrix manifold.