Dave Keenan & Douglas Blumeyer's guide to RTT/Conventions for names, variables, units, and notations

This is an appendix to our series "Dave Keenan & Douglas Blumeyer's guide to RTT", or "D&D's guide" for short. The tables in this article present our recommendations for communicating about regular temperament theory (RTT), in particular the names and notations for temperament matrices, tuning schemes, interval complexities, and measurement units.

Our recommendations are designed to make this topic easy to learn for musicians who do not have technical backgrounds, though we have generally deferred to established mathematical, scientific, and engineering conventions for the benefit of those who do.

For more information on our variation on extended bra-ket notation, please see Extended bra-ket notation: Variant including curly and square brackets.

We've followed a symbol formatting pattern, explained by the table below, which we hope serves as an aid to quickly identifying objects and remembering their properties and purposes, but at the least we hope our choices are unobtrusive. In short, the objects with simple units of primes, generators or cents, i.e. the things which are actually audible in our application, are distinguished by upright formatting, while other variables are italic as is conventional. This is crossed with the mathematical convention that objects of order-1 like vectors are bolded and order-2 like matrices are uppercased:

	units →		simple units	compound or no units
↓ order	↓ style →		upright	italic
0	plain		scalar with simple unit	scalar with no unit
1	bold		vector	map (covector)
2	UPPERCASE		LIST or BASIS	true MATRIX

We present our conventions here in three separate sections, one for each level of this article series: basic, intermediate, and advanced. The basic section contains only information covered in the basic part of the series, the intermediate section contains both basic and intermediate, and the advanced section contains it all (that is to say, the sections are cumulative). We expect that for most readers, the basic tier will be the best reference (this is the reference designed primarily for musicians interested in RTT, as opposed to scientists, engineers, mathematicians, or theoreticians), and so we've left the other two sections initially collapsed.

Basic

Objects

equivalent expressions	variable	name	units			shape		type		EBK notation		subobjects				notes
			unreduced	reduced	read as	unreduced	reduced	numeric	structural	row-first	col-first	row	col	diag	entry
mapping
	[math]\displaystyle{ \textbf{i} }[/math]	(just) interval		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, 1) }[/math]	integer	vector		[...⟩				[math]\displaystyle{ \mathrm{i}_i }[/math]	specific type: prime-count vector (PC-vector) jargon name: monzo
	[math]\displaystyle{ M }[/math]	(temperament) mapping (matrix)		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (r, d) }[/math]	integer	matrix	[⟨...] ...}	⟨[...} ...]	[math]\displaystyle{ 𝒎_i }[/math]			[math]\displaystyle{ m_{ij} }[/math]	jargon name: val list
[math]\displaystyle{ M\textbf{i} }[/math]	[math]\displaystyle{ \textbf{y} }[/math]	mapped interval	[math]\displaystyle{ \scriptsize \begin{array} {c} M \\[-2pt] 𝗴 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗴 }[/math]	generators	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} M \\[-3pt] (r, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (r, 1) }[/math]	integer	vector		[...}					specific type: generator-count vector (GC-vector) jargon name: tmonzo; mnemonic: [math]\displaystyle{ \textbf{y} }[/math]nterval
	[math]\displaystyle{ 𝒎 }[/math]	(temperament) map		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	vector	⟨...]					[math]\displaystyle{ m_i }[/math]	jargon name: val
	[math]\displaystyle{ d }[/math]	dimensionality					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
	[math]\displaystyle{ r }[/math]	rank					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
tuning
	[math]\displaystyle{ 𝒋 }[/math]	just(-prime) tuning map		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ j_i }[/math]
	[math]\displaystyle{ 𝒈 }[/math]	generator tuning map		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	cents per generator		[math]\displaystyle{ \scriptsize (1, r) }[/math]	real	vector	{...]					[math]\displaystyle{ g_i }[/math]
[math]\displaystyle{ 𝒈M }[/math]	[math]\displaystyle{ 𝒕 }[/math]	(tempered-prime) tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒈 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} 𝑀 \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒈 \\[-3pt] (1, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ t_i }[/math]
[math]\displaystyle{ 𝒕 - 𝒋 }[/math]	[math]\displaystyle{ 𝒓 }[/math]	retuning (or mistuning) map		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ r_i }[/math]	previous name: prime error map
[math]\displaystyle{ 𝒋\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{o} }[/math]	(just) (interval) size	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒋 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒋 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar							mnemonic: [math]\displaystyle{ \mathrm{o} }[/math]riginal size
[math]\displaystyle{ 𝒈M\textbf{i} \\ 𝒕\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{a} }[/math]	tempered (interval) size	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒕 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒕 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar							mnemonic: [math]\displaystyle{ \mathrm{a} }[/math]ltered size
[math]\displaystyle{ 𝒕\textbf{i} - 𝒋\textbf{i} \\ a - o \\ 𝒓\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{e} }[/math]	(interval) error	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒓 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒓 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
optimization
	[math]\displaystyle{ p }[/math]	optimization power					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
	[math]\displaystyle{ ⟪ · ⟫_p }[/math]	power mean ([math]\displaystyle{ p }[/math]-mean)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
damage
[math]\displaystyle{ s^{-1} }[/math]	[math]\displaystyle{ c }[/math]	complexity	𝟙(C)	[math]\displaystyle{ \small\mathsf{(C)} }[/math]	complexity weight		[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ c^{-1} }[/math]	[math]\displaystyle{ s }[/math]	simplicity	𝟙(S)	[math]\displaystyle{ \small\mathsf{(S)} }[/math]	simplicity weight		[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ c }[/math] or [math]\displaystyle{ s }[/math]	[math]\displaystyle{ w }[/math]	weight	𝟙(C) or 𝟙[math]\displaystyle{ \small\mathsf{(S)} }[/math]	[math]\displaystyle{ \small\mathsf{(C)} }[/math] or [math]\displaystyle{ \small\mathsf{(S)} }[/math]	complexity weight or simplicity weight		[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ |\mathrm{e}|w }[/math]	[math]\displaystyle{ \mathrm{d} }[/math]	damage	[math]\displaystyle{ \scriptsize \begin{array} {c} |\mathrm{e}| \\[-2pt] ¢ \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} w \\[-2pt] \text{(U, C, or S)} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(U)} }[/math] or [math]\displaystyle{ \mathsf{¢}\small\mathsf{(C)} }[/math] or [math]\displaystyle{ \mathsf{¢}\small\mathsf{(S)} }[/math]	(see damages tables)	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} |\mathrm{e}| \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} w \\[-3pt] (\cancel{1}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
target-intervals
	[math]\displaystyle{ \mathrm{T} }[/math]	target-interval list		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, k) }[/math]	integer	matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{t}_i }[/math]		[math]\displaystyle{ \mathrm{t}_{ij} }[/math]
[math]\displaystyle{ M\mathrm{T} }[/math]	[math]\displaystyle{ \mathrm{Y} }[/math]	mapped target-interval list	[math]\displaystyle{ \scriptsize \begin{array} {c} M \\[-2pt] 𝗴 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗴 }[/math]	generators	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} M \\[-3pt] (r, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (r, k) }[/math]	integer	matrix		[[...} ...]		[math]\displaystyle{ \textbf{y}_i }[/math]		[math]\displaystyle{ \mathrm{y}_{ij} }[/math]	mnemonic: looks like bent-up 'T', or cross between 'M' and 'T'
[math]\displaystyle{ 𝒋\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{o} }[/math]	target-interval (just) size list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒋 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒋 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{o}_i }[/math]	mnemonic: [math]\displaystyle{ \textbf{o} }[/math]riginal size list
[math]\displaystyle{ 𝒕\mathrm{T} \\ 𝒈M\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{a} }[/math]	tempered target-interval size list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒕 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒕 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{a}_i }[/math]	mnemonic: [math]\displaystyle{ \textbf{a} }[/math]ltered size list
[math]\displaystyle{ 𝒕\mathrm{T} - 𝒋\mathrm{T}\\ \textbf{a} - \textbf{o} \\ 𝒓\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{e} }[/math]	target-interval error list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒓 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒓 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{e}_i }[/math]
[math]\displaystyle{ C }[/math] or [math]\displaystyle{ S }[/math]	[math]\displaystyle{ W }[/math]	target-interval weight matrix	𝟙(C) or 𝟙(S) or 𝟙(U)	[math]\displaystyle{ \small\mathsf{(C)} }[/math] or [math]\displaystyle{ \small\mathsf{(S)} }[/math] or [math]\displaystyle{ \small\mathsf{(U)} }[/math]	complexity weight or simplicity weight		[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒘 }[/math]	[math]\displaystyle{ w_i }[/math]
[math]\displaystyle{ S^{-1} }[/math]	[math]\displaystyle{ C }[/math]	target-interval complexity weight matrix	𝟙(C)	[math]\displaystyle{ \small\mathsf{(C)} }[/math]	complexity weight		[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒄 }[/math]	[math]\displaystyle{ c_i }[/math]
[math]\displaystyle{ C^{-1} }[/math]	[math]\displaystyle{ S }[/math]	target-interval simplicity weight matrix	𝟙(S)	[math]\displaystyle{ \small\mathsf{(S)} }[/math]	simplicity weight		[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒔 }[/math]	[math]\displaystyle{ s_i }[/math]
[math]\displaystyle{ |\textbf{e}|W }[/math]	[math]\displaystyle{ \textbf{d} }[/math]	target-interval damage list	[math]\displaystyle{ \scriptsize \begin{array} {c} |\textbf{e}| \\[-2pt] ¢ \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} W \\[-2pt] (\text{U, C, or S}) \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(U)} }[/math], [math]\displaystyle{ \mathsf{¢}\small\mathsf{(C)} }[/math], or [math]\displaystyle{ \mathsf{¢}\small\mathsf{(S)} }[/math]	weighted cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} |\textbf{e}| \\[-3pt] (1, \cancel{k}) \end{array} \!\! \begin{array} {c} W \\[-3pt] (\cancel{k}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{d}_i }[/math]
	[math]\displaystyle{ k }[/math]	target-interval count					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar							mnemonic: [math]\displaystyle{ k }[/math]ount
unchanged-intervals
	[math]\displaystyle{ h }[/math]	unchanged-interval count					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar							mnemonic: unc[math]\displaystyle{ h }[/math]anged interval count
exploring temperaments
	[math]\displaystyle{ \mathrm{C} }[/math]	comma basis		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, n) }[/math]	integer	matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{c}_i }[/math]		[math]\displaystyle{ \mathrm{c}_{ij} }[/math]	jargon name: monzo list
	[math]\displaystyle{ \textbf{c} }[/math]	comma		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, 1) }[/math]	integer	vector		[...⟩				[math]\displaystyle{ \mathrm{c}_i }[/math]	specific type: prime-count vector (PC-vector)

Units

We recommend using a narrow no-break space (U+202F) between quantities and their units. For how to type this, see the WinCompose section below.

symbol	name	vectorized
[math]\displaystyle{ \small 𝗴 }[/math]	generators	yes
[math]\displaystyle{ \small 𝗽 }[/math]	primes	yes
[math]\displaystyle{ \mathsf{¢} }[/math]	cents
[math]\displaystyle{ \mathsf{¢}\small\mathsf{(U)} }[/math]	unity-weighted cents
[math]\displaystyle{ \mathsf{¢}\small\mathsf{(C)} }[/math]	complexity-weighted cents
[math]\displaystyle{ \mathsf{¢}\small\mathsf{(S)} }[/math]	simplicity-weighted cents
[math]\displaystyle{ \small\mathsf{oct} }[/math]	octaves
[math]\displaystyle{ \small\mathsf{(C)} }[/math]	complexity weight
[math]\displaystyle{ \small\mathsf{(S)} }[/math]	simplicity weight

Tuning schemes

Copied from Dave Keenan & Douglas Blumeyer's guide to RTT: tuning fundamentals#Systematic tuning scheme names.

damage weight	optimization power	systematic name
<none>	∞	minimax-U
complexity		minimax-C
1/complexity		minimax-S
<none>	2	miniRMS-U
complexity		miniRMS-C
1/complexity		miniRMS-S
<none>	1	minimean-U
complexity		minimean-C
1/complexity		minimean-S

Damages

quantity		unit
abbreviation	name	symbol	name
U-damage	unity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(U)} }[/math]	unity-weighted cents
C-damage	complexity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(C)} }[/math]	complexity-weighted cents
S-damage	simplicity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(S)} }[/math]	simplicity-weighted cents

Complexity and simplicity

quantity		unit
abbreviation	name	symbol	name
C	complexity	[math]\displaystyle{ \small\mathsf{(C)} }[/math]	complexity weight
S	simplicity	[math]\displaystyle{ \small\mathsf{(S)} }[/math]	simplicity weight

Intermediate

Objects

equivalent expressions	variable	name	units			shape		type		EBK notation		subobjects				notes
			unreduced	reduced	read as	unreduced	reduced	numeric	structural	row-first	col-first	row	col	diag	entry
mapping
	[math]\displaystyle{ \textbf{i} }[/math]	(just) interval		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, 1) }[/math]	integer	vector		[...⟩				[math]\displaystyle{ \mathrm{i}_i }[/math]	specific type: prime-count vector (PC-vector) jargon name: monzo
	[math]\displaystyle{ M }[/math]	(temperament) mapping (matrix)		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (r, d) }[/math]	integer	matrix	[⟨...] ...}	⟨[...} ...]	[math]\displaystyle{ 𝒎_i }[/math]			[math]\displaystyle{ m_{ij} }[/math]	jargon name: val list
[math]\displaystyle{ M\textbf{i} }[/math]	[math]\displaystyle{ \textbf{y} }[/math]	mapped interval	[math]\displaystyle{ \scriptsize \begin{array} {c} M \\[-2pt] 𝗴 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗴 }[/math]	generators	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} M \\[-3pt] (r, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (r, 1) }[/math]	integer	vector		[...}					specific type: generator-count vector (GC-vector) jargon name: tmonzo; mnemonic: [math]\displaystyle{ \textbf{y} }[/math]nterval
	[math]\displaystyle{ 𝒎 }[/math]	(temperament) map		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	vector	⟨...]					[math]\displaystyle{ m_i }[/math]	jargon name: val
[math]\displaystyle{ n + r }[/math]	[math]\displaystyle{ d }[/math]	dimensionality					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
[math]\displaystyle{ d - n }[/math]	[math]\displaystyle{ r }[/math]	rank					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
[math]\displaystyle{ d - r }[/math]	[math]\displaystyle{ n }[/math]	nullity					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
tuning
[math]\displaystyle{ 1200×\textbf{1}LG_{\text{j}}M_{\text{j}} \\ 1200×\textbf{1}L \\ 𝒈_{\text{j}}M_{\text{j}} }[/math]	[math]\displaystyle{ 𝒋 }[/math]	just(-prime) tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G_{\text{j}} \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M_{\text{j}} \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{1} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G_{\text{j}} \\[-3pt] (\cancel{d}, \cancel{r}) \end{array} \!\! \begin{array} {c} M_{\text{j}} \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ j_i }[/math]
[math]\displaystyle{ 1200×\textbf{1}LG }[/math]	[math]\displaystyle{ 𝒈 }[/math]	generator tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} 𝗴 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	cents per generator	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{1} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G \\[-3pt] (\cancel{d}, r) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, r) }[/math]	real	vector	{...]					[math]\displaystyle{ g_i }[/math]
[math]\displaystyle{ 1200×\textbf{1}LGM \\ 1200×\textbf{1}LP \\ 𝒈M }[/math]	[math]\displaystyle{ 𝒕 }[/math]	(tempered-prime) tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1×\cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G \\[-3pt] (\cancel{d}, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ t_i }[/math]
[math]\displaystyle{ 𝒕 - 𝒋 \\ 1200×\textbf{1}L(P - I) }[/math]	[math]\displaystyle{ 𝒓 }[/math]	retuning (or mistuning) map		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ r_i }[/math]	previous name: prime error map
[math]\displaystyle{ 𝒋\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{o} }[/math]	(just) (interval) size	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒋 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒋 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar							mnemonic: [math]\displaystyle{ \mathrm{o} }[/math]riginal size
[math]\displaystyle{ 𝒈M\textbf{i} \\ 𝒕\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{a} }[/math]	tempered (interval) size	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒕 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒕 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar							mnemonic: [math]\displaystyle{ \mathrm{a} }[/math]ltered size
[math]\displaystyle{ 𝒕\textbf{i} - 𝒋\textbf{i} \\ a - o \\ 𝒓\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{e} }[/math]	(interval) error	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒓 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒓 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
optimization
	[math]\displaystyle{ p }[/math]	optimization power					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
	[math]\displaystyle{ ⟪ · ⟫_p }[/math]	power mean ([math]\displaystyle{ p }[/math]-mean)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
damage
[math]\displaystyle{ s^{-1} }[/math]	[math]\displaystyle{ c }[/math]	complexity	(see complexities table)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ c^{-1} }[/math]	[math]\displaystyle{ s }[/math]	simplicity	(see simplicities table)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ c }[/math] or [math]\displaystyle{ s }[/math]	[math]\displaystyle{ w }[/math]	weight	(see complexities and simplicities tables)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ |\mathrm{e}|w }[/math]	[math]\displaystyle{ \mathrm{d} }[/math]	damage	(see damages tables)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
target-intervals
	[math]\displaystyle{ \mathrm{T} }[/math]	target-interval list		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, k) }[/math]	integer	matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{t}_i }[/math]		[math]\displaystyle{ \mathrm{t}_{ij} }[/math]
[math]\displaystyle{ M\mathrm{T} }[/math]	[math]\displaystyle{ \mathrm{Y} }[/math]	mapped target-interval list	[math]\displaystyle{ \scriptsize \begin{array} {c} M \\[-2pt] 𝗴 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗴 }[/math]	generators	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} M \\[-3pt] (r, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (r, k) }[/math]	integer	matrix		[[...} ...]		[math]\displaystyle{ \textbf{y}_i }[/math]		[math]\displaystyle{ \mathrm{y}_{ij} }[/math]	mnemonic: looks like bent-up 'T', or cross between 'M' and 'T'
[math]\displaystyle{ 𝒋\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{o} }[/math]	target-interval (just) size list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒋 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒋 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{o}_i }[/math]	mnemonic: [math]\displaystyle{ \textbf{o} }[/math]riginal size list
[math]\displaystyle{ 𝒕\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{a} }[/math]	tempered target-interval size list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒕 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒕 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{a}_i }[/math]	mnemonic: [math]\displaystyle{ \textbf{a} }[/math]ltered size list
[math]\displaystyle{ 𝒕\mathrm{T} - 𝒋\mathrm{T} \\ 𝒓\mathrm{T} \\ \textbf{a} - \textbf{o} }[/math]	[math]\displaystyle{ \textbf{e} }[/math]	target-interval error list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒓 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒓 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{e}_i }[/math]
[math]\displaystyle{ C }[/math] or [math]\displaystyle{ S }[/math]	[math]\displaystyle{ W }[/math]	target-interval weight matrix	(see complexities and simplicities tables)				[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒘 }[/math]	[math]\displaystyle{ w_i }[/math]
[math]\displaystyle{ S^{-1} }[/math]	[math]\displaystyle{ C }[/math]	target-interval complexity weight matrix	(see complexities table)				[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒄 }[/math]	[math]\displaystyle{ c_i }[/math]
[math]\displaystyle{ C^{-1} }[/math]	[math]\displaystyle{ S }[/math]	[target-interval simplicity weight matrix]]	(see simplicities table)				[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒔 }[/math]	[math]\displaystyle{ s_i }[/math]
[math]\displaystyle{ |\textbf{e}|W \\ 1200×\textbf{1}L|P - I|\mathrm{T}W }[/math]	[math]\displaystyle{ \textbf{d} }[/math]	target-interval damage list	(see damages table)				[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{d}_i }[/math]
	[math]\displaystyle{ k }[/math]	target-interval count					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar							mnemonic: [math]\displaystyle{ k }[/math]ount
unchanged-intervals
	[math]\displaystyle{ \mathrm{U} }[/math]	unchanged-interval basis		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, r) }[/math]		matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{u}_i }[/math]		[math]\displaystyle{ \mathrm{u}_{ij} }[/math]	jargon name: eigenmonzo list
	[math]\displaystyle{ h }[/math]	unchanged-interval count					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar							mnemonic: unc[math]\displaystyle{ h }[/math]anged interval count
exploring temperaments
	[math]\displaystyle{ \mathrm{C} }[/math]	comma basis		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, n) }[/math]	integer	matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{c}_i }[/math]		[math]\displaystyle{ \mathrm{c}_{ij} }[/math]	jargon name: monzo list
	[math]\displaystyle{ \textbf{c} }[/math]	comma		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, 1) }[/math]	integer	vector		[...⟩				[math]\displaystyle{ \mathrm{c}_i }[/math]	specific type: prime-count vector (PC-vector)
computation
	[math]\displaystyle{ L }[/math]	log-prime matrix		[math]\displaystyle{ \small\mathsf{oct} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	octaves per prime		[math]\displaystyle{ \scriptsize (d, d) }[/math]	real	matrix	[⟨...] ...⟩	⟨[...⟩ ...]	[math]\displaystyle{ \textbf{𝓁}_i }[/math]		[math]\displaystyle{ \textbf{𝓁} }[/math]	[math]\displaystyle{ 𝓁_{ij} }[/math]
	[math]\displaystyle{ \textbf{1} }[/math]	summation map					[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	vector	⟨...]					[math]\displaystyle{ 1 }[/math]
	[math]\displaystyle{ 1200 }[/math]	octaves-to-cents conversion		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small\mathsf{oct} }[/math]	cents per octave		[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
	[math]\displaystyle{ G }[/math]	generator embedding (matrix)		[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	primes per generator		[math]\displaystyle{ \scriptsize (d, r) }[/math]	real	matrix	[{...] ...⟩	{[...⟩ ...]	[math]\displaystyle{ 𝒈_i }[/math]			[math]\displaystyle{ g_{ij} }[/math]
	[math]\displaystyle{ K }[/math]	constraint (matrix)					[math]\displaystyle{ \scriptsize (r, k) }[/math]	[math]\displaystyle{ \scriptsize \{0, +1, -1\} }[/math]	matrix	[[...] ...]		[math]\displaystyle{ 𝒌_i }[/math]			[math]\displaystyle{ k_{ij} }[/math]	mnemonic: [math]\displaystyle{ K }[/math]onstraint
	[math]\displaystyle{ {\large⧛}·{\large⧚}_p }[/math]	power sum ([math]\displaystyle{ p }[/math]-sum)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
projection
[math]\displaystyle{ GM }[/math]	[math]\displaystyle{ P }[/math]	projection (matrix)	[math]\displaystyle{ \scriptsize \begin{array} {c} G \\[-2pt] 𝗽 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	primes per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} G \\[-3pt] (d, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (d, d) }[/math]	real	matrix	[⟨...] ...⟩	⟨[...⟩ ...]	[math]\displaystyle{ 𝒑_i }[/math]			[math]\displaystyle{ p_i }[/math]
[math]\displaystyle{ GM\textbf{i} }[/math]	[math]\displaystyle{ P\textbf{i} }[/math]	projected interval	[math]\displaystyle{ \scriptsize \begin{array} {c} G \\[-2pt] 𝗽 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗽 }[/math]	primes	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} G \\[-3pt] (d, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (d, 1) }[/math]	real	vector		[...⟩					specific type: prime-count vector (PC-vector)
JI equivalents
[math]\displaystyle{ I }[/math]	[math]\displaystyle{ M_{\text{j}} }[/math]	JI mapping (matrix)		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (d, d) }[/math]	integer	matrix	[⟨...] ...}	⟨[...} ...]			[math]\displaystyle{ 𝟏 }[/math]
[math]\displaystyle{ 1200×\textbf{1}LG_{\text{j}} }[/math]	[math]\displaystyle{ 𝒈_{\text{j}} }[/math]	JI generator tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G_{\text{j}} \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} 𝗴 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	cents per generator	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{1} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G_{\text{j}} \\[-3pt] (\cancel{d}, r) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	{...]					[math]\displaystyle{ g_{\text{j}i} }[/math]
[math]\displaystyle{ I }[/math]	[math]\displaystyle{ G_{\text{j}} }[/math]	JI generator embedding (matrix)		[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	primes per generator		[math]\displaystyle{ \scriptsize (d, d) }[/math]	integer	matrix	[{...] ...⟩	{[...⟩ ...]			[math]\displaystyle{ 𝟏 }[/math]
all-interval tuning schemes
[math]\displaystyle{ I }[/math]	[math]\displaystyle{ \mathrm{T}_{\text{p}} }[/math]	prime proxy target-interval (matrix)		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, d) }[/math]	integer	matrix		⟨[...⟩ ...]			[math]\displaystyle{ 𝟏 }[/math]
[math]\displaystyle{ S_{\text{p}}^{-1} }[/math]	[math]\displaystyle{ C_{\text{p}} }[/math]	complexity prescaler	𝟙(C)	[math]\displaystyle{ \small\mathsf{(C)} }[/math]	complexity weight		[math]\displaystyle{ \scriptsize (d, d) }[/math]	real	matrix	[⟨...] ...⟩				[math]\displaystyle{ 𝒄_{\text{p}} }[/math]	[math]\displaystyle{ c_{\text{p}i} }[/math]
[math]\displaystyle{ C_{\text{p}}^{-1} }[/math]	[math]\displaystyle{ S_{\text{p}} }[/math]	simplicity prescaler	𝟙(S)	[math]\displaystyle{ \small\mathsf{(S)} }[/math]	simplicity weight		[math]\displaystyle{ \scriptsize (d, d) }[/math]	real	matrix		⟨[...⟩ ...]			[math]\displaystyle{ 𝒔_{\text{p}} }[/math]	[math]\displaystyle{ s_{\text{p}i} }[/math]
	[math]\displaystyle{ q }[/math]	interval complexity norm power					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
	[math]\displaystyle{ ‖ · ‖_q }[/math]	power norm ([math]\displaystyle{ q }[/math]-norm)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar

Units

Same as the basic level.

Tuning schemes

retuning (or mistuning) magnitude			damage									target intervals	systematic name		previously named tuning schemes that are specific types of this tuning scheme	of interest?
			weight						optimization
			interval complexity			slope			initial	name	power
initial	name	power	initial	name	power	initial	name	multiplier					abbreviated	read ("____ tuning scheme")
<n/a>	maximum	∞	(t)	taxicab	1	S	simplicity-weight	1/complexity	<n/a>	minimax	∞	all	minimax-S	minimax simplicity-weight damage	"TOP"/"T1"/"TIPTOP"*, "CTOP", "POTOP"/"POTT"*, "BOP", "Weil", "Kees"	yes
<n/a>	Euclidean	2	E	Euclidean	2								minimax-ES	minimax Euclideanized-simplicity-weight damage	"TE"/"T2"/"TOP-RMS", "CTE", "POTE", "Frobenius", "BE", "WE", "KE"
<n/a>			<n/a>			U	unity-weight	<none>				<set>	<set> minimax-U	<set> minimax unity-weight-damage	"minimax"	yes
			(t)	taxicab	1	S	simplicity-weight	1/complexity					<set> minimax-S	<set> minimax simplicity-weight damage		yes
			E	Euclidean	2								<set> minimax-ES	<set> minimax Euclideanized-simplicity-weight damage
			(t)	taxicab	1	C	complexity-weight	complexity					<set> minimax-C	<set> minimax complexity-weight damage		yes
			E	Euclidean	2								<set> minimax-EC	<set> minimax Euclideanized-complexity-weight damage
			<n/a>			U	unity-weight	<none>		miniRMS	2		<set> miniRMS-U	<set> miniRMS unity-weight damage	"least squares"	yes
			(t)	taxicab	1	S	simplicity-weight	1/complexity					<set> miniRMS-S	<set> miniRMS simplicity-weight damage		yes
			E	Euclidean	2								<set> miniRMS-ES	<set> miniRMS Euclideanized-simplicity-weight damage
			(t)	taxicab	1	C	complexity-weight	complexity					<set> miniRMS-C	<set> miniRMS complexity-weight damage		yes
			E	Euclidean	2								<set> miniRMS-EC	<set> miniRMS Euclideanized-complexity-weight damage
			<n/a>			U	unity-weight	<none>		minimean	1		<set> minimean-U	<set> minimean unity-weight damage		yes
			(t)	taxicab	1	S	simplicity-weight	1/complexity					<set> minimean-S	<set> minimean simplicity-weight damage		yes
			E	Euclidean	2								<set> minimean-ES	<set> minimean Euclideanized-simplicity-weight damage
			(t)	taxicab	1	C	complexity-weight	complexity					<set> minimean-C	<set> minimean complexity-weight damage		yes
			E	Euclidean	2								<set> minimean-EC	<set> minimean Euclideanized-complexity-weight damage

Damages

quantity		unit
abbreviation	name	symbol	name
U-damage	unity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(U)} }[/math]	unity-weighted cents
C-damage	complexity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(C)} }[/math]	complexity-weighted cents
EC-damage	Euclideanized-complexity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math][math]\displaystyle{ \small\mathsf{(EC)} }[/math]	Euclideanized-complexity-weighted cents
S-damage	simplicity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(S)} }[/math]	simplicity-weighted cents
ES-damage	Euclideanized-simplicity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math][math]\displaystyle{ \small\mathsf{(ES)} }[/math]	Euclideanized-simplicity-weighted cents

Complexity and simplicity

quantity		unit
abbreviation	name	symbol	name
C	complexity	[math]\displaystyle{ \small\mathsf{(C)} }[/math]	complexity weight
EC	Euclideanized complexity	[math]\displaystyle{ \small\mathsf{(EC)} }[/math]	Euclideanized-complexity weight

quantity		unit
abbreviation	name	symbol	name
S	simplicity	[math]\displaystyle{ \small\mathsf{(S)} }[/math]	simplicity weight
ES	Euclideanized simplicity	[math]\displaystyle{ \small\mathsf{(ES)} }[/math]	Euclideanized-simplicity weight

Advanced

Objects

equivalent expressions	variable	name	units			shape		type		EBK notation		subobjects				notes
			unreduced	reduced	read as	unreduced	reduced	numeric	structural	row-first	col-first	row	col	diag	entry
mapping
	[math]\displaystyle{ \textbf{i} }[/math]	(just) interval		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, 1) }[/math]	integer	vector		[...⟩				[math]\displaystyle{ \mathrm{i}_i }[/math]	specific type: prime-count vector (PC-vector) jargon name: monzo
	[math]\displaystyle{ M }[/math]	(temperament) mapping (matrix)		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (r, d) }[/math]	integer	matrix	[⟨...] ...}	⟨[...} ...]	[math]\displaystyle{ 𝒎_i }[/math]			[math]\displaystyle{ m_{ij} }[/math]	jargon name: val list
[math]\displaystyle{ M\textbf{i} }[/math]	[math]\displaystyle{ \textbf{y} }[/math]	mapped interval	[math]\displaystyle{ \scriptsize \begin{array} {c} M \\[-2pt] 𝗴 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗴 }[/math]	generators	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} M \\[-3pt] (r, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (r, 1) }[/math]	integer	vector		[...}					specific type: generator-count vector (GC-vector) jargon name: tmonzo; mnemonic: [math]\displaystyle{ \textbf{y} }[/math]nterval
	[math]\displaystyle{ 𝒎 }[/math]	(temperament) map		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	vector	⟨...]					[math]\displaystyle{ m_i }[/math]	jargon name: val
[math]\displaystyle{ n + r }[/math]	[math]\displaystyle{ d }[/math]	dimensionality					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
[math]\displaystyle{ d - n }[/math]	[math]\displaystyle{ r }[/math]	rank					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
[math]\displaystyle{ d - r }[/math]	[math]\displaystyle{ n }[/math]	nullity					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
tuning
[math]\displaystyle{ 1200×\textbf{1}LG_{\text{j}}M_{\text{j}} \\ 1200×\textbf{1}L \\ 𝒈_{\text{j}}M_{\text{j}} }[/math]	[math]\displaystyle{ 𝒋 }[/math]	just(-prime) tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G_{\text{j}} \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M_{\text{j}} \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{1} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G_{\text{j}} \\[-3pt] (\cancel{d}, \cancel{r}) \end{array} \!\! \begin{array} {c} M_{\text{j}} \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d_{\text{p}}) }[/math]	real	vector	⟨...]					[math]\displaystyle{ j_i }[/math]
[math]\displaystyle{ 1200×\textbf{1}LG }[/math]	[math]\displaystyle{ 𝒈 }[/math]	generator tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} 𝗴 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	cents per generator	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{1} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G \\[-3pt] (\cancel{d}, r) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, r) }[/math]	real	vector	{...]					[math]\displaystyle{ g_i }[/math]
[math]\displaystyle{ 1200×\textbf{1}LGM \\ 1200×\textbf{1}LP \\ 𝒈M }[/math]	[math]\displaystyle{ 𝒕 }[/math]	(tempered-prime) tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1×\cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G \\[-3pt] (\cancel{d}, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ t_i }[/math]
[math]\displaystyle{ 𝒕 - 𝒋 \\ 1200×\textbf{1}L(P - I) }[/math]	[math]\displaystyle{ 𝒓 }[/math]	retuning (or mistuning) map		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	cents per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	⟨...]					[math]\displaystyle{ r_i }[/math]	previous name: prime error map
[math]\displaystyle{ 𝒋\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{o} }[/math]	(just) (interval) size	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒋 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒋 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar							mnemonic: [math]\displaystyle{ \mathrm{o} }[/math]riginal size
[math]\displaystyle{ 𝒈M\textbf{i} \\ 𝒕\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{a} }[/math]	tempered (interval) size	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒕 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒕 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar							mnemonic: [math]\displaystyle{ \mathrm{a} }[/math]ltered size
[math]\displaystyle{ 𝒕\textbf{i} - 𝒋\textbf{i} \\ a - o \\ 𝒓\textbf{i} }[/math]	[math]\displaystyle{ \mathrm{e} }[/math]	(interval) error	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒓 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒓 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
optimization
	[math]\displaystyle{ p }[/math]	optimization power					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
	[math]\displaystyle{ ⟪ · ⟫_p }[/math]	power mean ([math]\displaystyle{ p }[/math]-mean)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
damage
[math]\displaystyle{ s^{-1} }[/math]	[math]\displaystyle{ c }[/math]	complexity	(see complexities table)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ c^{-1} }[/math]	[math]\displaystyle{ s }[/math]	simplicity	(see simplicities table)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ c }[/math] or [math]\displaystyle{ s }[/math]	[math]\displaystyle{ w }[/math]	weight	(see complexities and simplicities tables)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
[math]\displaystyle{ |\mathrm{e}|w }[/math]	[math]\displaystyle{ \mathrm{d} }[/math]	damage	(see damages tables)				[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
target-intervals
	[math]\displaystyle{ \mathrm{T} }[/math]	target-interval list		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, k) }[/math]	integer	matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{t}_i }[/math]		[math]\displaystyle{ \mathrm{t}_{ij} }[/math]
[math]\displaystyle{ M\mathrm{T} }[/math]	[math]\displaystyle{ \mathrm{Y} }[/math]	mapped target-interval list	[math]\displaystyle{ \scriptsize \begin{array} {c} M \\[-2pt] 𝗴 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗴 }[/math]	generators	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} M \\[-3pt] (r, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (r, k) }[/math]	integer	matrix		[[...} ...]		[math]\displaystyle{ \textbf{y}_i }[/math]		[math]\displaystyle{ \mathrm{y}_{ij} }[/math]	mnemonic: looks like bent-up 'T', or cross between 'M' and 'T'
[math]\displaystyle{ 𝒋\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{o} }[/math]	target-interval (just) size list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒋 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒋 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{o}_i }[/math]	mnemonic: [math]\displaystyle{ \textbf{o} }[/math]riginal size list
[math]\displaystyle{ 𝒕\mathrm{T} }[/math]	[math]\displaystyle{ \textbf{a} }[/math]	tempered target-interval size list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒕 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒕 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{a}_i }[/math]	mnemonic: [math]\displaystyle{ \textbf{a} }[/math]ltered size list
[math]\displaystyle{ 𝒕\mathrm{T} - 𝒋\mathrm{T} \\ 𝒓\mathrm{T} \\ \textbf{a} - \textbf{o} }[/math]	[math]\displaystyle{ \textbf{e} }[/math]	target-interval error list	[math]\displaystyle{ \scriptsize \begin{array} {c} 𝒓 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \mathrm{T} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]	cents	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 𝒓 \\[-3pt] (1, \cancel{d}) \end{array} \!\! \begin{array} {c} \mathrm{T} \\[-3pt] (\cancel{d}, k) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{e}_i }[/math]
[math]\displaystyle{ C }[/math] or [math]\displaystyle{ S }[/math]	[math]\displaystyle{ W }[/math]	target-interval weight matrix	(see complexities and simplicities tables)				[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒘 }[/math]	[math]\displaystyle{ w_i }[/math] or [math]w_{ij}[/math]
[math]\displaystyle{ S^{-1} }[/math]	[math]\displaystyle{ C }[/math]	target-interval complexity weight matrix	(see complexities table)				[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒄 }[/math]	[math]\displaystyle{ c_i }[/math]
[math]\displaystyle{ C^{-1} }[/math]	[math]\displaystyle{ S }[/math]	target-interval simplicity weight matrix	(see simplicities table)				[math]\displaystyle{ \scriptsize (k, k) }[/math]	real	matrix		[[...] ...]			[math]\displaystyle{ 𝒔 }[/math]	[math]\displaystyle{ s_i }[/math]
[math]\displaystyle{ |\textbf{e}|W \\ 1200×\textbf{1}L|P - I|\mathrm{T}W }[/math]	[math]\displaystyle{ \textbf{d} }[/math]	target-interval damage list	(see damages table)				[math]\displaystyle{ \scriptsize (1, k) }[/math]	real	list	[...]					[math]\displaystyle{ \mathrm{d}_i }[/math]
	[math]\displaystyle{ k }[/math]	target-interval count					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar							mnemonic: [math]\displaystyle{ k }[/math]ount
unchanged-intervals
	[math]\displaystyle{ \mathrm{U} }[/math]	unchanged-interval basis		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, r) }[/math]		matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{u}_i }[/math]		[math]\displaystyle{ \mathrm{u}_{ij} }[/math]	jargon name: eigenmonzo list
	[math]\displaystyle{ h }[/math]	unchanged-interval count					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
exploring temperaments
	[math]\displaystyle{ \mathrm{C} }[/math]	comma basis		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, n) }[/math]	integer	matrix		[[...⟩ ...]		[math]\displaystyle{ \textbf{c}_i }[/math]		[math]\displaystyle{ \mathrm{c}_{ij} }[/math]	jargon name: monzo list
	[math]\displaystyle{ \textbf{c} }[/math]	comma		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, 1) }[/math]	integer	vector		[...⟩				[math]\displaystyle{ \mathrm{c}_i }[/math]	specific type: prime-count vector (PC-vector)
computation
[math]\displaystyle{ \text{diag}(\log_2(\textbf{p})) }[/math]	[math]\displaystyle{ L }[/math]	log-prime matrix		[math]\displaystyle{ \small\mathsf{oct} }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	octaves per prime		[math]\displaystyle{ \scriptsize (d, d) }[/math]	real	matrix	[⟨...] ...⟩	⟨[...⟩ ...]	[math]\displaystyle{ \textbf{𝓁}_i }[/math]		[math]\displaystyle{ \textbf{𝓁} }[/math]	[math]\displaystyle{ 𝓁_{ij} }[/math]
	[math]\displaystyle{ \textbf{1} }[/math]	summation map					[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	vector	⟨...]					[math]\displaystyle{ 1 }[/math]
	[math]\displaystyle{ 1200 }[/math]	octaves-to-cents conversion		[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small\mathsf{oct} }[/math]	cents per octave		[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
	[math]\displaystyle{ G }[/math]	generator embedding (matrix)		[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	primes per generator		[math]\displaystyle{ \scriptsize (d, r) }[/math]	real	matrix	[{...] ...⟩	{[...⟩ ...]	[math]\displaystyle{ 𝒈_i }[/math]			[math]\displaystyle{ g_{ij} }[/math]
	[math]\displaystyle{ K }[/math]	constraint (matrix)					[math]\displaystyle{ \scriptsize (r, k) }[/math]	[math]\displaystyle{ \scriptsize \{0, +1, -1\} }[/math]	matrix	[[...] ...]		[math]\displaystyle{ 𝒌_i }[/math]			[math]\displaystyle{ k_{ij} }[/math]	mnemonic: [math]\displaystyle{ K }[/math]onstraint
	[math]\displaystyle{ {\large⧛}·{\large⧚}_p }[/math]	power sum ([math]\displaystyle{ p }[/math]-sum)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
projection
[math]\displaystyle{ G_cF^{-1}FM_c \\ \mathrm{V}\textit{Λ}\mathrm{V}^{-1} }[/math]	[math]\displaystyle{ P }[/math]	projection (matrix)	[math]\displaystyle{ \scriptsize \begin{array} {c} G \\[-2pt] 𝗽 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} 𝗽 \end{array} }[/math]	[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	primes per prime	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} G \\[-3pt] (d, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, d) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (d, d) }[/math]	real	matrix	[⟨...] ...⟩	⟨[...⟩ ...]	[math]\displaystyle{ 𝒑_i }[/math]			[math]\displaystyle{ p_i }[/math]
[math]\displaystyle{ GM\textbf{i} }[/math]	[math]\displaystyle{ P\textbf{i} }[/math]	projected interval	[math]\displaystyle{ \scriptsize \begin{array} {c} G \\[-2pt] 𝗽 \hspace{-2mu} / \hspace{-2mu} \cancel{𝗴} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} M \\[-2pt] \cancel{𝗴} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{i} \\[-2pt] \cancel{𝗽} \end{array} }[/math]	[math]\displaystyle{ \small 𝗽 }[/math]	primes	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} G \\[-3pt] (d, \cancel{r}) \end{array} \!\! \begin{array} {c} M \\[-3pt] (\cancel{r}, \cancel{d}) \end{array} \!\! \begin{array} {c} \textbf{i} \\[-3pt] (\cancel{d}, 1) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (d, 1) }[/math]	real	vector		[...⟩					specific type: prime-count vector (PC-vector)
	[math]\displaystyle{ \textit{Λ} }[/math]	scaling factor matrix					[math]\displaystyle{ \scriptsize (d, d) }[/math]		matrix	[⟨…] …⟩	⟨[…⟩ …]			[math]\displaystyle{ 𝝀 }[/math]	[math]\displaystyle{ λ_i }[/math]	mnemonic: [math]\displaystyle{ \mathrm{V} }[/math] is mirrored of [math]\displaystyle{ \textit{Λ} }[/math] which it combines with to create the projection matrix; previous name: eigenvalue matrix
	[math]\displaystyle{ \mathrm{V} }[/math]	unrotated vector list		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, d) }[/math]		matrix		⟨[...⟩ ...]		[math]\displaystyle{ \textbf{v}_i }[/math]		[math]\displaystyle{ \mathrm{v}_{ij} }[/math]	mnemonic: [math]\displaystyle{ \mathrm{V} }[/math] is mirrored of [math]\displaystyle{ \textit{Λ} }[/math] which it combines with to create the projection matrix; jargon name: eigenmonzo and comma list
	[math]\displaystyle{ F }[/math]	generator form matrix					[math]\displaystyle{ \scriptsize (r, r) }[/math]		matrix	[{...] …}			[math]\displaystyle{ 𝒇_i }[/math]		[math]\displaystyle{ f_{ij} }[/math]
JI equivalents
[math]\displaystyle{ I }[/math]	[math]\displaystyle{ M_{\text{j}} }[/math]	JI mapping (matrix)		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (d, d) }[/math]	integer	matrix	[⟨...] ...}	⟨[...} ...]			[math]\displaystyle{ 𝟏 }[/math]
[math]\displaystyle{ 1200×\textbf{1}LG_{\text{j}} }[/math]	[math]\displaystyle{ 𝒈_{\text{j}} }[/math]	JI generator tuning map	[math]\displaystyle{ \scriptsize \begin{array} {c} 1200 \\[-2pt] ¢ \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} \textbf{1} \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{\text{oct}} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \begin{array} {c} L \\[-2pt] \cancel{\text{oct}} \hspace{-2mu} / \hspace{-2mu} \cancel{𝗽} \end{array} \begin{array} {c} \\[-2pt] · \end{array} \\ \scriptsize \quad \begin{array} {c} G_{\text{j}} \\[-2pt] \cancel{𝗽} \hspace{-2mu} / \hspace{-2mu} 𝗴 \end{array} }[/math]	[math]\displaystyle{ \mathsf{¢} }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	cents per generator	[math]\displaystyle{ \scriptsize \!\! \begin{array} {c} 1200 \\[-3pt] (1, \cancel{1}) \end{array} \!\! \begin{array} {c} \textbf{1} \\[-3pt] (\cancel{1}, \cancel{d}) \end{array} \!\! \begin{array} {c} L \\[-3pt] (\cancel{d}, \cancel{d}) \end{array} \\ \scriptsize \quad \!\! \begin{array} {c} G_{\text{j}} \\[-3pt] (\cancel{d}, r) \end{array} \!\! }[/math]	[math]\displaystyle{ \scriptsize (1, d) }[/math]	real	vector	{...]					[math]\displaystyle{ g_{\text{j}i} }[/math]
[math]\displaystyle{ I }[/math]	[math]\displaystyle{ G_{\text{j}} }[/math]	JI generator embedding (matrix)		[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	primes per generator		[math]\displaystyle{ \scriptsize (d, d) }[/math]	integer	matrix	[{...] ...⟩	{[...⟩ ...]			[math]\displaystyle{ 𝟏 }[/math]
all-interval tuning schemes
[math]\displaystyle{ I }[/math]	[math]\displaystyle{ \mathrm{T}_{\text{p}} }[/math]	prime proxy target-interval (matrix)		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (d, d) }[/math]	integer	matrix		⟨[...⟩ ...]			[math]\displaystyle{ 𝟏 }[/math]
	[math]\displaystyle{ C_{\text{p}} }[/math]	complexity pretransformer	𝟙(C) or 𝟙(<alt>-C)	[math]\displaystyle{ \small\mathsf{(C)} }[/math] or [math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{C)} }[/math]	complexity weight or <alternative>-complexity weight		[math]\displaystyle{ \scriptsize (d, d) }[/math] or [math]\displaystyle{ \scriptsize (d+1, d+1) }[/math]	real	matrix	[⟨...] ...⟩		[math]\displaystyle{ 𝒄_{\text{p}_i} }[/math]		[math]\displaystyle{ 𝒄_{\text{p}} }[/math]	[math]\displaystyle{ c_{\text{p}i} }[/math] or [math]c_{\text{p}ij}[/math]
	[math]\displaystyle{ S_{\text{p}} }[/math]	simplicity pretransformer	𝟙(S) or 𝟙[math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{S)} }[/math]	[math]\displaystyle{ \small\mathsf{(S)} }[/math] or [math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{S)} }[/math]	simplicity weight or <alternative>-simplicity weight		[math]\displaystyle{ \scriptsize (d, d) }[/math] or [math]\displaystyle{ \scriptsize (d+1, d+1) }[/math]	real	matrix		⟨[...⟩ ...]	[math]\displaystyle{ 𝒔_{\text{p}i} }[/math]		[math]\displaystyle{ 𝒔_{\text{p}} }[/math]	[math]\displaystyle{ s_{\text{p}i} }[/math] or [math]s_{\text{p}ij}[/math]
	[math]\displaystyle{ q }[/math]	interval complexity norm power					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
	[math]\displaystyle{ ‖ · ‖_q }[/math]	power norm ([math]\displaystyle{ q }[/math]-norm)					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	real	scalar
alternative complexities
	[math]\displaystyle{ 𝒑 }[/math]	prime list					[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	list	[...]					[math]\displaystyle{ p_i }[/math]
	[math]\displaystyle{ Z }[/math]	size-sensitizing matrix					[math]\displaystyle{ \scriptsize (d+1, d) }[/math]	real	matrix	[⟨…]...]		[math]\displaystyle{ 𝒛_i }[/math]			[math]\displaystyle{ z_ij }[/math]
non-standard domain bases
	[math]\displaystyle{ B_s }[/math]	(domain) basis (change) matrix		p/b	primes per nonprime basis elements		[math]\displaystyle{ \scriptsize (d_p, d_b) }[/math]	integer	matrix	[[...] ...]	[[...] ...]		[math]\displaystyle{ b_i }[/math]		[math]\displaystyle{ b_{ij} }[/math]
	[math]\displaystyle{ B_{Ls} }[/math]			[math]\displaystyle{ \small 𝗕 }[/math]/[math]\displaystyle{ \small 𝗯 }[/math]	superspace basis elements per (subspace) basis elements		[math]\displaystyle{ \scriptsize (d_L, d_s) }[/math]
	[math]\displaystyle{ Φ }[/math]	generator preimage transversal		[math]\displaystyle{ \small 𝗽 }[/math]/[math]\displaystyle{ \small 𝗴 }[/math]	primes per generator		[math]\displaystyle{ \scriptsize (d, r) }[/math]	integer	matrix		{[...⟩ ...]		[math]\displaystyle{ \mathbf{ϕ}_i }[/math]		[math]\displaystyle{ \mathrm{ϕ}_{ij} }[/math]	[math]\displaystyle{ MΦ = I }[/math]
exterior algebra
	[math]\displaystyle{ 𝕞 }[/math]	multimap		[math]\displaystyle{ \small 𝗴 }[/math]/[math]\displaystyle{ \small 𝗽 }[/math]	generators per prime		[math]\displaystyle{ \scriptsize (1, d) }[/math]	integer	multivector	⟨...] or ⟨⟨...]] or ⟨⟨⟨...]]] ...					[math]\displaystyle{ 𝕞_i }[/math]
	[math]\displaystyle{ 𝕔 }[/math]	multicomma		[math]\displaystyle{ \small 𝗽 }[/math]	primes		[math]\displaystyle{ \scriptsize (1, n) }[/math]	integer	multivector		[...⟩ or [[...⟩⟩ or [[[...⟩⟩⟩ ...				[math]\displaystyle{ 𝕔_i }[/math]
	[math]\displaystyle{ 𝕧 }[/math]	(generic temperament multivector)					[math]\displaystyle{ \scriptsize (1, {{d}\choose{r}}) }[/math] or [math]\displaystyle{ \scriptsize (1, {{d}\choose{n}}) }[/math]	integer	multivector	⟨...] or ⟨⟨...]] or ⟨⟨⟨...]]] ...	[...⟩ or [[...⟩⟩ or [[[...⟩⟩⟩ ...				[math]\displaystyle{ 𝕧_i }[/math]
	[math]\displaystyle{ A }[/math]	(generic temperament matrix)					[math]\displaystyle{ \scriptsize (g, d) }[/math] or [math]\displaystyle{ \scriptsize (d, g) }[/math]	integer	matrix	[⟨...] ...}	⟨[...} ...] or [[...⟩ ...]	[math]\displaystyle{ 𝒂_i }[/math]	[math]\displaystyle{ 𝒂_i }[/math]	[math]\displaystyle{ 𝒂 }[/math]	[math]\displaystyle{ a_{ij} }[/math]
	[math]\displaystyle{ v }[/math]	variance
	[math]\displaystyle{ g }[/math]	grade					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
temperament addition
[math]\displaystyle{ \min(r, n) }[/math]	[math]\displaystyle{ g_\text{min} }[/math]	min-grade					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
[math]\displaystyle{ \max(r, n) }[/math]	[math]\displaystyle{ g_\text{max} }[/math]	max-grade					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
	[math]\displaystyle{ L_\text{dep} }[/math]	linear-dependence basis					[math]\displaystyle{ \scriptsize (l_\text{dep}, d) }[/math] or [math]\displaystyle{ \scriptsize (d, l_\text{dep}) }[/math]	integer	matrix	[⟨...]] or [[...] ...⟩	⟨[...]] or [[...⟩ ...]	[math]\displaystyle{ \textbf{𝓁}_{\text{dep}i} }[/math]	[math]\displaystyle{ \textbf{𝓁}_{\text{dep}i} }[/math]	[math]\displaystyle{ \textbf{𝓁}_\text{dep} }[/math]	[math]\displaystyle{ 𝓁_{\text{dep}ij} }[/math]
	[math]\displaystyle{ L_\text{ind} }[/math]	linear-independence basis					[math]\displaystyle{ \scriptsize (l_\text{ind}, d) }[/math] or [math]\displaystyle{ \scriptsize (d, l_\text{ind}) }[/math]	integer	matrix	[⟨...]] or [[...] ...⟩	⟨[...]] or [[...⟩ ...]	[math]\displaystyle{ \textbf{𝓁}_{\text{ind}i} }[/math]	[math]\displaystyle{ \textbf{𝓁}_{\text{ind}i} }[/math]	[math]\displaystyle{ \textbf{𝓁}_\text{ind} }[/math]	[math]\displaystyle{ 𝓁_{\text{ind}ij} }[/math]
[math]\displaystyle{ \dim(L_\text{dep}) }[/math]	[math]\displaystyle{ l_\text{dep} }[/math]	linear-dependence					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar
[math]\displaystyle{ \dim(L_\text{ind}) }[/math]	[math]\displaystyle{ l_\text{ind} }[/math]	linear-independence					[math]\displaystyle{ \scriptsize (1, 1) }[/math]	integer	scalar

Units

symbol	name	vectorized
[math]\displaystyle{ \small 𝗴 }[/math]	generators	yes
[math]\displaystyle{ \small 𝗽 }[/math]	primes	yes
[math]\displaystyle{ \small 𝗯 }[/math]	(subspace) basis elements	yes
[math]\displaystyle{ \small 𝗕 }[/math]	superspace basis elements	yes
[math]\displaystyle{ \mathsf{¢} }[/math]	cents
[math]\displaystyle{ \mathsf{¢} }[/math](<weight>)	weighted cents
[math]\displaystyle{ \small\mathsf{oct} }[/math]	octaves

Tuning schemes

retuning (or mistuning) magnitude						damage												target intervals	systematic name		previously named tuning schemes that are specific types of this tuning scheme	of interest?
						weight									optimization
						interval complexity						slope			initial	name	power
norm pretransformer			norm power			norm pretransformer			norm power			initial	name	multiplier
initial	name	multiplier	initial	name	power	initial	name	multiplier	initial	name	power								abbreviated	read ("____ tuning scheme")
<none>			<n/a>	maximum	∞	<none>			(t)	taxicab	1	S	simplicity-weight	1/complexity	<n/a>	minimax	∞	all	minimax-S	minimax simplicity-weight damage	"TOP"/"T1"/"TIPTOP"*, "CTOP", "POTOP"/"POTT"*	yes
<various>						<various>													minimax-<alt>-S	minimax <alternative>-simplicity-weight damage	"BOP", "Weil", "Kees"	yes
<none>				Euclidean	2	<none>			E	Euclidean	2								minimax-ES	minimax Euclideanized-simplicity-weight damage	"TE"/"T2"/"TOP-RMS", "CTE", "POTE"	yes
<various>						<various>													minimax-E-<alt>-S	minimax Euclideanized-<alternative>-simplicity-weight damage	"Frobenius", "BE", "WE", "KE"	yes
<n/a>						<n/a>						U	unity-weight	<none>				<set>	<set> minimax-U	<set> minimax unity-weight damage	"minimax"	yes
						<none>			(t)	taxicab	1	S	simplicity-weight	1/complexity					<set> minimax-S	<set> minimax simplicity-weight damage		yes
						<various>													<set> minimax-<alt>-S	<set> minimax <alternative>-simplicity-weight damage
						<none>			E	Euclidean	2								<set> minimax-ES	<set> minimax Euclideanized-simplicity-weight damage
						<various>													<set> minimax-E-<alt>-S	<set> minimax Euclideanized-<alternative>-simplicity-weight damage
						<none>			(t)	taxicab	1	C	complexity-weight	complexity					<set> minimax-C	<set> minimax complexity-weight damage		yes
						<various>													<set> minimax-<alt>-C	<set> minimax <alternative>-complexity-weight damage
						<none>			E	Euclidean	2								<set> minimax-EC	<set> minimax Euclideanized-complexity-weight damage
						<various>													<set> minimax-E-<alt>-C	<set> minimax Euclideanized-<alternative>-complexity-weight damage
						<n/a>						U	unity-weight	<none>		miniRMS	2		<set> miniRMS-U	<set> miniRMS unity-weight damage	"least squares"	yes
						<none>			(t)	taxicab	1	S	simplicity-weight	1/complexity					<set> miniRMS-S	<set> miniRMS simplicity-weight damage		yes
						<various>													<set> miniRMS-<alt>-S	<set> miniRMS <alternative>-simplicity-weight damage
						<none>			E	Euclidean	2								<set> miniRMS-ES	<set> miniRMS Euclideanized-simplicity-weight damage
						<various>													<set> miniRMS-E-<alt>-S	<set> miniRMS Euclideanized-<alternative>-simplicity-weight damage
						<none>			(t)	taxicab	1	C	complexity-weight	complexity					<set> miniRMS-C	<set> miniRMS complexity-weight damage		yes
						<various>													<set> miniRMS-<alt>-C	<set> miniRMS <alternative>-complexity-weight damage
						<none>			E	Euclidean	2								<set> miniRMS-EC	<set> miniRMS Euclideanized-complexity-weight damage
						<various>													<set> miniRMS-E-<alt>-C	<set> miniRMS Euclideanized-<alternative>-complexity-weight damage
						<n/a>						U	unity-weight	<none>		minimean	1		<set> minimean-U	<set> minimean unity-weight damage		yes
						<none>			(t)	taxicab	1	S	simplicity-weight	1/complexity					<set> minimean-S	<set> minimean simplicity-weight damage		yes
						<various>													<set> minimean-<alt>-S	<set> minimean <alternative>-simplicity-weight damage
						<none>			E	Euclidean	2								<set> minimean-ES	<set> minimean Euclideanized-simplicity-weight damage
						<various>													<set> minimean-E-<alt>-S	<set> minimean Euclideanized-<alternative>-simplicity-weight damage
						<none>			(t)	taxicab	1	C	complexity-weight	complexity					<set> minimean-C	<set> minimean complexity-weight damage		yes
						<various>													<set> minimean-<alt>-C	<set> minimean <alternative>-complexity-weight damage
						<none>			E	Euclidean	2								<set> minimean-EC	<set> minimean Euclideanized-complexity-weight damage
						<various>													<set> minimean-E-<alt>-C	<set> minimean Euclideanized-<alternative>-complexity-weight damage

Damages

quantity		unit
abbreviation	name	symbol	name
U-damage	unity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(U)} }[/math]	unity-weighted cents
C-damage	complexity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(C)} }[/math]	complexity-weighted cents
<alt>-C-damage	<alternative>-complexity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math][math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{C)} }[/math]	<alternative>-complexity-weighted cents
EC-damage	Euclideanized-complexity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math][math]\displaystyle{ \small\mathsf{(EC)} }[/math]	Euclideanized-complexity-weighted cents
E-<alt>-C-damage	Euclideanized-<alternative>-complexity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math](E-<alt>-C)	Euclideanized-<alternative>-complexity-weighted cents
S-damage	simplicity-weight damage	[math]\displaystyle{ \mathsf{¢}\small\mathsf{(S)} }[/math]	simplicity-weighted cents
<alt>-S-damage	<alternative>-simplicity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math][math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{S)} }[/math]	<alternative>-simplicity-weighted cents
ES-damage	Euclideanized-simplicity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math][math]\displaystyle{ \small\mathsf{(ES)} }[/math]	Euclideanized-simplicity-weighted cents
E-<alt>-S-damage	Euclideanized-<alternative>-simplicity-weight damage	[math]\displaystyle{ \mathsf{¢} }[/math](E-<alt>-S)	Euclideanized-<alternative>-simplicity-weighted cents

Complexity and simplicity

quantity		unit
abbreviation	name	unit	name
C	complexity	𝟙(C) = (C)	complexity weight
<alt>-C	<alternative> complexity	𝟙[math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{C)} }[/math] = (<alternative>-C)	<alternative>-complexity weight
EC	Euclideanized complexity	𝟙[math]\displaystyle{ \small\mathsf{(EC)} }[/math] = [math]\displaystyle{ \small\mathsf{(EC)} }[/math]	Euclideanized-complexity weight
E-<alt>-C	Euclideanized-<alternative> complexity	𝟙(E-<alt>-C) = (E-<alternative>-C)	Euclideanized-<alternative>-complexity weight
S	simplicity	𝟙(S) = (S)	simplicity weight
<alt>-S	<alternative> simplicity	𝟙[math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{S)} }[/math] = (<alternative>-S)	<alternative>-simplicity weight
ES	Euclideanized simplicity	𝟙[math]\displaystyle{ \small\mathsf{(ES)} }[/math] = [math]\displaystyle{ \small\mathsf{(ES)} }[/math]	Euclideanized-simplicity weight
E-<alt>-S	Euclideanized-<alternative> simplicity	𝟙(E-<alt>-S) = (E-<alternative>-S)	Euclideanized-<alternative>-simplicity weight

quantity		unit
abbreviation	name	unit	name
S	simplicity	𝟙(S) = (S)	simplicity weight
<alt>-S	<alternative> simplicitity	𝟙[math]\displaystyle{ \small\mathsf{(} }[/math]<alt>-[math]\displaystyle{ \small\mathsf{S)} }[/math] = (<alternative>-S)	<alternative>-simplicity
ES	Euclideanized simplicity	𝟙[math]\displaystyle{ \small\mathsf{(ES)} }[/math] = [math]\displaystyle{ \small\mathsf{(ES)} }[/math]	Euclideanized-simplicicty weight
E-<alt>-S	Euclideanized-<alternative> simplicity	𝟙(E-<alt>-S) = (E-<alternative>-S)	Euclideanized-<alternative>-simplicity

WinCompose

Are you tired of every time web-searching for and copy-pasting special characters that you use over and over in RTT discussions, or would like to use if only it were easy, such as ♯, ♭, ¢, √, °, ₂, ×, ⁻¹, ⟩, ∞, and ϕ? Well, try WinCompose! This tool lets you communicate about these ideas without disrupting your train of thought, by typing these characters with simple and memorable key sequences. These sequences always begin with your chosen Compose-key, which defaults to being your right Alt key. When describing these sequences we represent this key with the symbol ⎄. So for example, you type ♯ as ⎄##, ♭ as ⎄bb, ¢ as ⎄c/, √ as ⎄v/, ° as ⎄00, ₂ as ⎄-2, × as ⎄xx, ⁻¹ as ⎄11, ⟩ as ⎄>>, ∞ as ⎄88, and ϕ as ⎄8f.

For Windows users, install WinCompose then copy-paste the contents of this file: https://dkeenan.com/XCompose.txt into your user sequences (Show sequences → User-defined sequences → Edit). Then save and reload. You can always choose to override or add alternatives to our sequences if you find others to be more intuitive.

For Mac users, we refer you to these instructions (from the author of WinCompose) for how to set up Compose-key sequences in Mac OS: http://sam.hocevar.net/blog/category/osx/

Table of noteworthy sequences

Compose-key sequence	resulting text	description
Keyboard key symbols
⎄⎄⎄	⎄	compose key symbol (the right alt key by default)
⎄\␣	␣	spacebar symbol
⎄\▶︎ etc.	▶︎ etc.	right etc. arrow key symbols
⎄\A or ⎄\O	⌥	alt or option key symbol
⎄\B	⌫	backspace key symbol
⎄\C	✲	control key symbol
⎄\D	⌦	delete key symbol
⎄\E	⎋	escape key symbol
⎄\L	⇪	caps lock key symbol
⎄\R or ⎄\.E or ⎄\\	⏎	return or enter key symbol
⎄\S	⇧	shift key symbol
⎄\T	⭾	tab key symbol
⎄()	◌	dotted circle, represents any character (such as the character preceding a combining mark)
Double key sequences
⎄␣␣		narrow no-break space (used between quantities and their units)
⎄..	·	middle dot (used to multiply units when juxtaposition is ambiguous)
⎄::	÷	divide sign
⎄;;	◌̲̅	combining overline and low line (undirected value)
⎄||	‖	power norm bracket
⎄\\	⏎	return or enter key symbol
⎄<<	⟨	left angle bracket
⎄>>	⟩	right angle bracket
⎄~~	≈	approximately equal
⎄**	★	black star
⎄''	′	prime mark
⎄11	⁻¹	power of -1 or inverse
⎄22 through ⎄77	² ³ ⁴ ⁵ ⁶ ⁷	squared, cubed, fourth through seventh power
⎄88	∞	infinity
⎄00	°	degree sign
⎄nn	ⁿ	superscript small n
⎄--	₋	subscript minus sign
⎄__	◌̲	combining low line (underline)
⎄==	≡	modular congruence
⎄//	⁄	fraction slash (use with super and subscripts to create fractions)
⎄##	♯	musical sharp
⎄bb	♭	musical flat
⎄dd	∂	partial derivative
⎄ff	ϕ	small phi symbol
⎄gg	ɡ	single-storey (opentail) small g
⎄ll	ℓ	script small L
⎄uu	µ	micro sign
⎄xx	×	multiplication sign
⎄DD	∆	delta (small difference) operator
⎄FF	Φ	Greek capital phi
⎄QQ	Ϙ	Greek capital letter archaic qoppa (small quotient operator)
⎄TT	ᵀ	superscript capital T (matrix transpose)
⎄++	⁺	superscript plus sign (matrix pseudoinverse)
⎄▶︎▶︎ etc.	→ etc.	right etc. arrows
Multiplication operators
⎄xx	×	multiplication sign
⎄Xx or ⎄xX	⨯	vector or cross product (barely distinguishable from multiplication sign)
⎄XX	✕	large multiplication sign (a better symbol for cross product)
⎄x*	⋆	star operator (prefix: tensor complement, Hodge)
⎄X*	∗	asterisk operator (infix: scalar product, Dorst)
⎄x.	⋅	dot (product) operator
⎄X.	•	bullet (infix: fat dot product, Dorst)
Other operators
⎄v/	√	square root sign
⎄3v/	∛	cube root sign
⎄4v/	∜	fourth root sign
⎄-+	₊	subscript plus sign
⎄--	₋	subscript minus sign
⎄-=	₌	subscript equals sign
⎄++	⁺	superscript plus sign (matrix pseudoinverse)
⎄+- or ⎄+=	±	plus or minus sign
⎄=+	∓	minus or plus sign
⎄=-	−	minus sign
⎄==	≡	modular congruence
⎄/\	∧	logical AND, wedge product, progressive product
⎄\/	∨	logical OR, vee product, regressive product
⎄⎄/\	⋀	larger logical AND, wedge product, progressive product
⎄⎄\/	⋁	larger logical OR, vee product, regressive product
⎄|_	⌊	left floor (infix: right contraction, Dorst)
⎄_|	⌋	right floor (infix: left contraction, Dorst)
⎄|^	⌈	left ceiling
⎄^|	⌉	right ceiling
⎄'-	⨽	righthand interior product
⎄-'	⨼	(lefthand) interior product
⎄-,	¬	not sign (prefix: multivector complement)
⎄⎄<>	⋄	diamond operator (prefix: multivector dual)
⎄(.)	⨀	entrywise vector multiplication operator
⎄(..)	⊙	alternative entrywise vector multiplication operator
⎄(/)	⊘	entrywise vector division operator
Mathematical letter and digit prefixes
⎄3◌	я	cyrillic, ⎄3q is ya (example)
⎄4◌	ℵ	hebrew, ⎄4a is aleph (only a b g d)
⎄5◌	𝔞	fraktur, ⎄5a
⎄6◌	ᵃ ¹  ᪲ ⁸	superscripts, ⎄6a ⎄61 ⎄688 ⎄68␣ (not all letters, some only approximate) (same key as ^ but without shift)
⎄68◌	ᵝ	superscript greek, ⎄68b is beta (only a few)
⎄7◌	𝒶	script, ⎄7a
⎄8◌	α	greek, ⎄8a is alpha (by sound where possible otherwise letter-shape)
⎄8.◌	ς	greek variants, ⎄8.s is final sigma
⎄9◌	𝐚 𝟏 𝟓 𝟕 𝟖 𝟎	bold, ⎄9a ⎄91 ⎄95␣ ⎄97␣ ⎄98␣ ⎄90␣
⎄95◌	𝖆	bold fraktur, ⎄95a
⎄97◌	𝓪	bold script, ⎄97a
⎄98◌	𝛂	bold greek, ⎄98a is bold alpha
⎄90◌	𝒂	bold italic, ⎄90a
⎄908◌	𝜶	bold italic greek, ⎄908a is bold italic alpha
⎄0◌	𝑎	italic, ⎄0a
⎄08◌	𝛼	italic greek, ⎄08a is italic alpha
⎄-◌	ₐ ᴀ  ͚ ₈	subscripts and small caps, ⎄-a ⎄-A ⎄-88 ⎄-8␣ (not all letters, some only approximate) (same key as _ but without shift)
⎄-8◌	ᵦ	subscript greek, ⎄-8b subscript beta (only a few)
⎄{◌	𝖺 𝟣 𝟫	sans-serif, ⎄{a ⎄{1 ⎄{9␣
⎄{9◌	𝗮 𝟭	sans-serif bold, ⎄{9a ⎄{91
⎄}◌	𝚊 𝟷	monospace, ⎄}a ⎄}1
⎄|◌	𝕒 𝟙 𝟠 𝟘	double-struck, ⎄|a ⎄|1 ⎄|8␣ ⎄|0␣
⎄|8◌	ℼ	double-struck greek, ⎄|8p (only a few)
⎄|0◌	ⅇ ⅈ	double-struck italic, ⎄|0e ⎄|i (only a few)
Power statistics brackets
⎄⎄|| or ⎄||	‖	power-norm bracket
⎄|-1	‖₁	1-norm right bracket
⎄|-2	‖₂	2-norm right bracket
⎄|-8	‖ ͚	∞-norm right bracket
⎄⎄<<	⟪	left power-mean bracket
⎄⎄>>	⟫	right power-mean bracket
⎄⎄{{	⧛	left power-sum bracket
⎄⎄}}	⧚	right power-sum bracket
Combining marks
⎄\-	◌̶	combining strike-thru
⎄^_	◌̅	combining overline
⎄__	◌̲	combining low line
⎄-_ or ⎄_- or ⎄_^	◌̲̅	combining overline and low line (undirected value)

Keyboard map