---
title: "qagen-schema-alphabet — Mova code model"
description: "Mova code model of qagen/src/schema.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/qagen/src/schema.rs.groupant/alphabet.groupant/"
---
Elamur: [Mova](https://md.mova.elamur.ai/free/en/) · [Dictionary](https://md.dictionary.elamur.ai/free/en/) · [Research](https://md.research.elamur.ai/free/en/) · **Groupants**

This page as HTML: <https://groupants.elamur.ai/free/en/mova/qagen/src/schema.rs.groupant/alphabet.groupant/>

# qagen-schema-alphabet

The groupant beside qagen/src/schema.rs in the Mova repository: what the code computes, what it never does, how to go back from its outputs, its invariants, cost and checks.

## Facts

- **kind:** groupant_fragment
- **status:** partial source bound model
- **source:** [`qagen/src/schema.rs`](https://github.com/ElamurAI/mova-free/blob/main/qagen/src/schema.rs)
- **source SHA-256:** `03e113198711324f…`
- **covers:** Normalize with trim and Unicode lowercase, then search literal seven QType or two ExIm names; Rule admits only byte 1 or 2. Domain: all supplied UTF-8 strings and u8 values; observation: Option enum, canonical name or numeric version. Exact scoped formula, not a performance surrogate. (bytes 266–1961)
- **part of:** [qagen-schema](https://md.groupants.elamur.ai/free/en/mova/qagen/src/schema.rs.groupant/)
- **repository folder:** [`qagen/src/schema.rs.groupant/alphabet.groupant`](https://github.com/ElamurAI/mova-free/tree/main/qagen/src/schema.rs.groupant/alphabet.groupant)
- **repository commit:** `855da7bd4a7b`

> **Implementation material.** A Mova code model describes this code at one source revision: partial models, finite checks and their stated scope. It is not a reviewed general exposition, and its labels are shown as written, never raised.

## Components

| component | label | where |
|---|---|---|
| **approximant** | partial source model | [forward](#forward) |
| **ast** | partial | `../syntax.json` |
| **composition** | partial source model | [composition](#composition) |
| **cost** | partial source model | [cost](#cost) |
| **descriptant** | partial source model | [epoch-memory](#epoch-memory) |
| **invariant** | partial source model | [invariant](#invariant) |
| **tests** | partial source model | [checks](#checks) |

## Obernants

The typed relations around the forward model: the behaviour complement (what the code never does), the reverse reconstruction (every input compatible with an output) and specialised views.

| id | type | label | where |
|---|---|---|---|
| `qagen-schema-alphabet-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `qagen-schema-alphabet-reverse` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `qagen-schema-alphabet-projection` | closed_alphabet_projection | partial source model | [specialization](#specialization) |

## Model text


### forward
Normalize with trim and Unicode lowercase, then search literal seven QType or two ExIm names; Rule admits only byte 1 or 2. Domain: all supplied UTF-8 strings and u8 values; observation: Option enum, canonical name or numeric version. Exact scoped formula, not a performance surrogate.

### invariant
ALL order is stable; canonical names are unique; parse(name(t))=Some(t); Rule::of(r.num())=Some(r).

### behavior-complement
Noncanonical normalized spellings, internal whitespace changes, abbreviations and version bytes outside {1,2} cannot produce accepted values. Universe: supplied finite UTF-8 strings/Para sequences and candidate observable results. These are scoped source-derived exclusions, not merely negative test outcomes.

### reverse-reconstruction
For accepted t, all s with lowercase(trim(s))=name(t) are compatible; rejected output collects every other string. Canonical name and version number uniquely recover their enum inside these closed alphabets. Operator is the set-valued fiber F^-1(y) = {x in domain | F(x)=y}; no implemented complete inverse solver or unique recovery claim.

### specialization
Normalization quotient identifies case and surrounding whitespace but preserves internal spaces; round trips alone cannot catch a consistently renamed alphabet, hence independent literals.

### cost
For input byte length B, normalization and lookup cost O(B) time and O(B) allocation; enum/name/version operations cost O(1). Fixed alphabet sizes seven and two.

### composition
Schema version selects a fixed rules prefix; renderer appends batch-local paragraph and sentence coordinates. Context uses original document identity and paragraph number only for immediate-predecessor adjacency. Child scopes share source identity; inverses must share the same Rule and Para sequence rather than combining unrelated marginal fibers.

### checks
Six new wave17_models tests (two schema, four prompt), including 256 rule bytes and 98 successor cases. See root evidence.md for compiled controls and repeated build-profile outcomes.

### epoch-memory
2026-10-30 prospective review: unchecked predecessor addition could overflow; cross-document comparison already correct. A synthetic MAX to MIN witness panicked before repair. checked_add preserves ordinary adjacency and keeps context at the overflow boundary. Schema literal mapping had no witnessed defect. No API changes.

### limitations
Partial source models, with literal and finite observations; no analytical approximation error or speed claim. Syntax projection is partial, macro bodies opaque. Input text is rendered verbatim, including delimiter-like content; grammar-injective recovery requires trusted delimiter-free fields. Teacher, parser, corpus, database and data acquisition were not executed.