# Thread:

1. ## Re: a "basis" in {0,1}^n with operations induced from the boolean algebra {0,1}

i think you can for $\{0,1\}^n$, especially since you know that spanning is the hard part. it might be more challenging to prove the more general result (an arbitrary idempotent semiring).

2. ## Re: a "basis" in {0,1}^n with operations induced from the boolean algebra {0,1}

OK. It's actually very easy when you know what you want to prove. Unless I'm mistaken of course.

Let $X\subseteq \{0,1\}^n$. Suppose X spans the space. Then there must be a combination of vectors in X that is equal to $e_i.$ Suppose $e_i\not\in X.$ Then since $X\neq\{0\},$ every vector in X has 1 on some coordinate different from $i$. No combination of such vectors can be equal to $e_i$. Therefore for any $i=1,2,...,n,\, e_i$ must be in X. If we suppose that X is independent, there can be no other vectors in it.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9456386566162109, "perplexity_flag": "head"}