Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Path systems between two families of lattice points, and non-intersecting systems

Definition

Fix a natural number r, start points (Ai)i<r and end points (Ei)i<r in Z2.

For a permutation πSr (The finite symmetric group Sn, one-line notation, and cycle notation), a π-system is an r-tuple

P=(Pi)i<r

such that for each index i<r, the path Pi is a monotone lattice path from Ai to Eπ(i) (Monotone lattice paths with steps E=(1,0) and N=(0,1)).

Two monotone lattice paths intersect when they share a lattice point, that is, when the images of their point functions have a common element of Z2. A π-system is non-intersecting when no two of its paths intersect.

Write Sπ(A,E) for the set of π-systems and Nπ(A,E)Sπ(A,E) for the non-intersecting ones.

Each set Sπ(A,E) is finite. Indeed, for every index i<r, either the endpoints Ai and Eπ(i) are compatible and M((0,0),(m,n))=(m+nn) counts a finite set of monotone paths between them, or they are incompatible and Monotone lattice paths with steps E=(1,0) and N=(0,1) makes that set empty. Repeated use of The product rule: A×B=AB, and i<mAi=i<mAi therefore makes the product of those finite sets finite, and that product is exactly Sπ(A,E). Therefore the subset Nπ(A,E) is finite as well (A subset of a finite set is finite, with BA, and equality holds if and only if B=A).

Remarks

  • The definition uses all lattice points of the paths, not only their step words. Two paths that merely cross between lattice points are not visible in this model; everything below is about sharing a lattice vertex.

  • The permutation is part of the datum. A path system records not only which paths occur but also which start is matched to which end.

Depends on

Used by

Dependency tree · two levels

29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources