# matroid

## Primary tabs

Defines:
submodular inequality
Keywords:
combinatorics
Synonym:
independence structure
Type of Math Object:
Definition
Major Section:
Reference
Groups audience:

## Mathematics Subject Classification

### Matroids, Definition 4, part b3)

Quote:

b3) If $S,T\in B$ and $x\in E-S$ then there exists $y\in E-T$
such that $(S\cup {x})-{y}\in B$.

-End quote.

Wouldn't the following:

b3) If $S,T\in B$ and $x\in T-S$ then there exists $y\in S-T$
such that $(S\cup {x})-{y}\in B$.

be logically equivalent, and a bit clearer?

In the other case covered by the existing b3), i.e. the case

$x\in E-T-S$

b3) becomes vacuously true, since you can just take y=x, so why not leave that case out.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 153, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8530979156494141, "perplexity": 3039.2933770285963}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-14/segments/1427131310006.38/warc/CC-MAIN-20150323172150-00032-ip-10-168-14-71.ec2.internal.warc.gz"}