FA-81171 / Music interval and transposition theory / Open access

Chord symbol to pitch classes: trailing text after slash bass ignored · case 01

Symbols like C/Ebm or C/E/G are accepted as if the bass were plain Eb or E.

Verified by executionVariant 1 · 8 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The slash-bass parser does not check that the bass note consumed the whole remainder.

THE FAILURE

The slash-bass parser does not check that the bass note consumed the whole remainder.

Unsuccessful approach: Checking only the remainder lets an unparseable bass letter through as a null bass.

Case contract

Input a chord symbol: root letter with optional # or b, a quality from "", m, dim, aug, 7, maj7, m7, m7b5, dim7, sus4, mMaj7, 6, and optionally "/" plus a bass note (letter with optional # or b and nothing else). Return pitch classes root-first in template order; for a slash chord the bass moves to the front (removed from its old position if it is a chord tone, otherwise added). Unknown or malformed symbols return None.

Why this case matters

Lead-sheet, accompaniment and guitar-chart tools expand chord symbols into voicings.

1 / The failure

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(x):
    base = {'C': 0, 'D': 2, 'E': 4, 'F': 5, 'G': 7, 'A': 9, 'B': 11}
    shapes = {'': [0, 4, 7], 'm': [0, 3, 7], 'dim': [0, 3, 6], 'aug': [0, 4, 8], '7': [0, 4, 7, 10], 'maj7': [0, 4, 7, 11], 'm7': [0, 3, 7, 10], 'm7b5': [0, 3, 6, 10], 'dim7': [0, 3, 6, 9], 'sus4': [0, 5, 7], 'mMaj7': [0, 3, 7, 11], '6': [0, 4, 7, 9]}
    def root(s):
        if not s or s[0] not in base:
            return None, s
        if s[1:2] in ('#', 'b'):
            return (base[s[0]] + (1 if s[1] == '#' else -1)) % 12, s[2:]
        return base[s[0]], s[1:]
    if not isinstance(x, str):
        return None
    head, slash, tail = x.partition('/')
    r, quality = root(head)
    if r is None or quality not in shapes:
        return None
    tones = [(r + i) % 12 for i in shapes[quality]]
    if slash:
        b, rest = root(tail)
        if b is None:
            return None
        if b in tones:
            tones.remove(b)
        tones.insert(0, b)
    return tones
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[('C', [0, 4, 7]), ('Cm', [0, 3, 7]), ('Bb', [10, 2, 5]), ('Bbm7', [10, 1, 5, 8]), ('Bb7', [10, 2, 5, 8]), ('C/E/G', None), ('C/', None), ('Am/', None)], [('Bbm7', [10, 1, 5, 8]), ('Bb7', [10, 2, 5, 8]), ('F#m7b5', [6, 9, 0, 4]), ('Ebmaj7', [3, 7, 10, 2]), ('Gdim7', [7, 10, 1, 4]), ('C/Ebm', None), ('C/', None), ('Am/', None)], [('Ebmaj7', [3, 7, 10, 2]), ('Gdim7', [7, 10, 1, 4]), ('Aaug', [9, 1, 5]), ('Dsus4', [2, 7, 9]), ('C/E', [4, 0, 7]), ('C/E/G', None), ('C/', None), ('Am/', None)], [('Dsus4', [2, 7, 9]), ('C/E', [4, 0, 7]), ('C/G', [7, 0, 4]), ('C/Bb', [10, 0, 4, 7]), ('Am/G', [7, 9, 0, 4]), ('C/Ebm', None), ('C/', None), ('Am/', None)], [('C/Bb', [10, 0, 4, 7]), ('Am/G', [7, 9, 0, 4]), ('F/A', [9, 5, 0]), ('Bb/D', [2, 10, 5]), ('G7/F', [5, 7, 11, 2]), ('C/E/G', None), ('C/', None), ('Am/', None)]]
for i, (args, expected) in enumerate(fixtures[N-1]):
    check("oracle %d" % i, solve(args), expected)
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
oracle 0	`[0, 4, 7]`	`[0, 4, 7]`	Passed
oracle 1	`[0, 3, 7]`	`[0, 3, 7]`	Passed
oracle 2	`[10, 2, 5]`	`[10, 2, 5]`	Passed
oracle 3	`[10, 1, 5, 8]`	`[10, 1, 5, 8]`	Passed
oracle 4	`[10, 2, 5, 8]`	`[10, 2, 5, 8]`	Passed
oracle 5	`[4, 0, 7]`	`None`	Failed
oracle 6	`None`	`None`	Passed
oracle 7	`None`	`None`	Passed

SHA-256 / fc3b484c7eafed46f321ff970ad0b43fc7b1fd872ab689b2bed9c5e4e27e72df

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(x):
    base = {'C': 0, 'D': 2, 'E': 4, 'F': 5, 'G': 7, 'A': 9, 'B': 11}
    shapes = {'': [0, 4, 7], 'm': [0, 3, 7], 'dim': [0, 3, 6], 'aug': [0, 4, 8], '7': [0, 4, 7, 10], 'maj7': [0, 4, 7, 11], 'm7': [0, 3, 7, 10], 'm7b5': [0, 3, 6, 10], 'dim7': [0, 3, 6, 9], 'sus4': [0, 5, 7], 'mMaj7': [0, 3, 7, 11], '6': [0, 4, 7, 9]}
    def root(s):
        if not s or s[0] not in base:
            return None, s
        if s[1:2] in ('#', 'b'):
            return (base[s[0]] + (1 if s[1] == '#' else -1)) % 12, s[2:]
        return base[s[0]], s[1:]
    if not isinstance(x, str):
        return None
    head, slash, tail = x.partition('/')
    r, quality = root(head)
    if r is None or quality not in shapes:
        return None
    tones = [(r + i) % 12 for i in shapes[quality]]
    if slash:
        b, rest = root(tail)
        if rest:
            return None
        if b in tones:
            tones.remove(b)
        tones.insert(0, b)
    return tones
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[('C', [0, 4, 7]), ('Cm', [0, 3, 7]), ('Bb', [10, 2, 5]), ('Bbm7', [10, 1, 5, 8]), ('Bb7', [10, 2, 5, 8]), ('C/E/G', None), ('C/', None), ('Am/', None)], [('Bbm7', [10, 1, 5, 8]), ('Bb7', [10, 2, 5, 8]), ('F#m7b5', [6, 9, 0, 4]), ('Ebmaj7', [3, 7, 10, 2]), ('Gdim7', [7, 10, 1, 4]), ('C/Ebm', None), ('C/', None), ('Am/', None)], [('Ebmaj7', [3, 7, 10, 2]), ('Gdim7', [7, 10, 1, 4]), ('Aaug', [9, 1, 5]), ('Dsus4', [2, 7, 9]), ('C/E', [4, 0, 7]), ('C/E/G', None), ('C/', None), ('Am/', None)], [('Dsus4', [2, 7, 9]), ('C/E', [4, 0, 7]), ('C/G', [7, 0, 4]), ('C/Bb', [10, 0, 4, 7]), ('Am/G', [7, 9, 0, 4]), ('C/Ebm', None), ('C/', None), ('Am/', None)], [('C/Bb', [10, 0, 4, 7]), ('Am/G', [7, 9, 0, 4]), ('F/A', [9, 5, 0]), ('Bb/D', [2, 10, 5]), ('G7/F', [5, 7, 11, 2]), ('C/E/G', None), ('C/', None), ('Am/', None)]]
for i, (args, expected) in enumerate(fixtures[N-1]):
    check("oracle %d" % i, solve(args), expected)
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
oracle 0	`[0, 4, 7]`	`[0, 4, 7]`	Passed
oracle 1	`[0, 3, 7]`	`[0, 3, 7]`	Passed
oracle 2	`[10, 2, 5]`	`[10, 2, 5]`	Passed
oracle 3	`[10, 1, 5, 8]`	`[10, 1, 5, 8]`	Passed
oracle 4	`[10, 2, 5, 8]`	`[10, 2, 5, 8]`	Passed
oracle 5	`None`	`None`	Passed
oracle 6	`[None, 0, 4, 7]`	`None`	Failed
oracle 7	`[None, 9, 0, 4]`	`None`	Failed

SHA-256 / 9af9b90e9b4f4d252db9d9a327acd4e86ad6673b4ae01bcf9b258709d96b847e

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 8 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

Member access is invitation-based. Sign in with your invited account to inspect the repair.

Verification & scope

A deterministic bounded teaching model with a stipulated toy contract; it is not a complete music notation or theory engine. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.

Observations recorded using Python 3.12.14 at 2026-09-29T14:50:00.563999+00:00.

Case digest / 597af786367ece15e761e778313f7cd78eb2a9cb466646f59a2ddabf4f50b5be