I am stuck on a little homework problem I have. Here, $M$ is a matroid with rank function $R$. I am given this definition: In a matroid $M$, a set $A$ is closed if $R(A \cup e) > R(A)$ for all $e \in E \setminus A$. I want to show that the intersection of two closed sets is again closed. My approach thus far is to take $((A \cap B ) \cup e))$ and stick it into the semimodular law for the rank function, aiming to show that $R((A \cap B ) \cup e)) > R(A \cap B)$ for $e \notin A \cap B$, but nothing of value seems to come out. What am I missing? I know I will need to use the fact that $A$ and $B$ are closed, but I am not sure how to work that in.
2026-03-26 03:11:29.1774494689
Proving that the intersection of two closed sets is closed in a matroid
396 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in MATROIDS
- Do these special substring sets form a matroid?
- how to prove that the dual of a matroid satisfies the exchange property?
- Proof of uniform matrix being transversal matrix by selecting singletons
- Smallest matroid containing two disjoint maximal elements of cardinality $K$?
- How much does the number of connected components of a graph grow in the case below?
- Given bases $A$, $B$ of a matroid there is a one-to-one mapping $\omega$ from $A$ to $B$ such that $(A - {a}) \cup {\omega(a)}$ is independent
- How to list all circuits of an oriented matroid and all circuits of its contraction of a vertex by hand?
- Relationship between Affine Dependence and Linear Dependence in Oriented Matroids?
- Contraction of oriented matroid as related to polytope?
- Why is this not a matroid?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Notation: $A+f$ means $A\cup \{ f\}$ for a set $A$ and element $f$.
Proof with submodularity
Recall, that submodularity for rank function $R$ means that for any $X, Y \subset E$ $$R(X)+R(Y) \geq R(X\cup Y)+R(X\cap Y)$$ Let $f\in E\setminus A$ be arbitrary, $X:=A$, $Y:=A\cap B+f$. $$R(A)+R(A\cap B+f) \geq R(A+f) + R(A\cap B)>R(A)+R(A\cap B)$$ $$R(A\cap B+f)>R(A\cap B)$$ The same is true for every $f\in E\setminus B$, except with $X:=B$. Thus the equation holds for every $f\in E\setminus (A\cap B)$, which was the statement.
$$\tag*{$\blacksquare$}$$
Proof without submodularity
Define $AB_{max} \subset A_{max} \subset A$ such, that $AB_{max}$ and $A_{max}$ are maximal independent subsets in $A \cap B$, and $A$ respectively. (recall, that every subset of an "$A_{max}$" is an "$AB_{max}$", and every "$AB_{max}$" can be expanded to become an "$A_{max}$")
If $A \cap B$ is NOT closed, there exists an $f$ element outside of $A \cap B$ with which $AB_{max} + f$ is dependent, for an arbitrary choice of $AB_{max}$.
(this is equivalent to $R(A\cap B) = R(A\cap B+f)$, the proposition to be contradicted)
Where could such an $f$ be?
If it's NOT in $A$, then for arbitrary $A_{max}$, $A_{max}+f$ would be dependent as well, since it contains an "$(AB_{max}+f)$", which is dependent by the definition of $f$. This contradicts the closeness of $A$. (it's the equivalent of $R(A)=R(A+f)$)
Similarly if it's NOT in $B$, then it contradicts the closeness of $B$.
Such $f$ therefore cannot exist and thus $A\cap B$ is a closed set.
$$\tag*{$\blacksquare$}$$