every vector space has a hamel basis

[[concept]]

Topics

const fieldName = "theme"; // Your field with links
const oldPrefix = "Thoughts/01 Themes/";
const newPrefix = "Digital Garden/Topics/";
 
const relatedLinks = dv.current()[fieldName];
 
if (Array.isArray(relatedLinks)) {
    // Map over the links, replace the path, and output only clickable links
    dv.el("span",
        relatedLinks
            .map(link => {
                if (link && link.path) {
                    let newPath = link.path.startsWith(oldPrefix)
                        ? link.path.replace(oldPrefix, newPrefix)
                        : link.path;
                    return dv.fileLink(newPath);
                }
            })
            .filter(Boolean).join(", ") 
	// Remove any undefined/null items
    );
} else {
    dv.el(dv.current().theme);
}
 
 

Theorem

If $V$ is a vector space, then $V$ has a Hamel basis.

Proof

Let $E$ be the set of linearly independent subsets of $V$. Define a partial order on $E$, $⪯$ via inclusion: $e,e^{\prime }\in V,e⪯e^{\prime }⟺e\subseteq e^{\prime }$ Towards applying Zorn, let $C$ be a chain in $E$. Define $c={\bigcup }_{e\in C}e$ This is a linearly independent subset:

• Let $v_1,\dots ,v_n\in c$. Thus there exist $e_1,\dots ,e_n\in C$ where for all $j$ we have $v_j\in e_j$.
• Since $C$ is a chain, there exists some $J$ such that for all $j=1,\dots ,n$ we have $e_j⪯e_J$ (ie $e_j\subseteq e_J$). Thus $v_1,\dots ,v_n\in e_J$.

Now, since $e_J$ is a linearly independent subset, this implies that $v_1,\dots ,v_n$ are themselves linearly independent. Thus $c\in E$

Thus for all $e\in C$, we have $e⪯c$. ie, there is an upper bound of $C$.

By Zorn’s lemma, $E$ has a maximal element $H$. I claim that $H$ spans $V$.

Suppose BWOC that $H$ does not span $V$. Then there exists some $v\in V$ such that $v$ cannot be written as a finite linear combination of elements in $H$. Then $H\cup \{v\}$ is linearly independent. But then $H\subseteq H\cup \{v\}$ and $H\prec H\cup \{v\}$ so $H$ is not maximal $⟹⟸$

Thus $H$ spans $V$.

Thus every vector space has a Hamel basis \tag*{$\blacksquare$}

References

References

See Also

Mentions

Mentions

const modules = await cJS()
 
const COLUMNS = [  
	{ id: "Name", value: page => page.$link },  
	{ id: "Last Modified", value: page => modules.dateTime.getLastMod(page) },
];  
  
return function View() {  
	const current = dc.useCurrentFile();
// Selecting `#game` pages, for example. 
	let queryString = `@page and linksto(${current.$link})`;
	let pages = dc.useQuery(queryString);
	
	// check types
	pages = pages.filter( (p) => !modules.typeCheck.checkAll(p, current) ).sort()
	
	
	return <dc.Table columns={COLUMNS} rows={pages} paging={20}/>;  
}  

const { dateTime } = await cJS()
 
return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}