Alignment Workspace

maxmin.representation

and · drafted

Statement

Ovchinnikov Theorem 4.1(a), for a nonempty convex domain in a topological real vector space. The source's proof silently needs full-dimensionality; the statement does not, and the round's errata carry a counterexample to the source's own nonemptiness claim.

Source

projects/normativity/CLAIMS.md, entry maxmin.representation (class lean-proved, status active, origin round 2026-08-18-maxmin-representation; answers item 50). Documentation: verification: projects/normativity/notes/GENERALIZED_LI_PAPER_HANDOFF.md; context: projects/normativity/rounds/2026-08-18-maxmin-representation/README.md. The signature of Workspace.Normativity.Contrib.MaxMinRepresentation.exists_maxMin_representation in lean/Workspace/Normativity/Contrib/MaxMinRepresentation.lean.

Notes

Filed by the map-as-canonical round (prompts/2026-10-22-map-as-canonical) from the registry entry and the declaration's signature; its hypotheses are unread (ruling F1, 2026-10-23): the record's Source carries the signature verbatim, and a reader files the hypothesis leaves. Registry note: Ovchinnikov Theorem 4.1(a), for a nonempty convex domain in a topological real vector space. The source's proof silently needs full-dimensionality; the statement does not, and the round's errata carry a counterexample to the source's own nonemptiness claim. The registry's answers_item is the priorities pointer to item 50 (ruling F2).

Bridge card

Connected to no informal claim yet: held by operative-force.

Declaration Workspace.Normativity.Contrib.MaxMinRepresentation.exists_maxMin_representation in lean/Workspace/Normativity/Contrib/MaxMinRepresentation.lean (record maxmin.representation.record)

Registry maxmin.representation: class lean-proved, status active, review ci-only, origin round 2026-08-18-maxmin-representation; bears on item 50

Bridge (formalizer-stated; maxmin.representation.bridge, drafted):

The statement of record of `maxmin.representation` formalizes the registered claim as the registry reads it: a piecewise affine function is a max of mins of its components.

Hypotheses: unread (the record's Source carries the signature; a reader files them).

Completeness (maxmin.representation.complete): No premise beyond the signature's binders enters the declaration; the kernel checks it as stated. The result is the record, this leaf and the bridge, and its hypotheses are unread: the record's Source carries the signature verbatim and no hypothesis leaf is filed until a reader files one.

Author and human events

Author @smithy-verity; version 1; size M.

No human event has touched this node.

Edges

Above

Children

Work pointers

Ranking (the lens, not the structure)
{
 "status": "open",
 "diagnosis": null,
 "flags": [
  "held by operative-force",
  "hypotheses unread"
 ],
 "V": {
  "V_prior": null,
  "display": "2",
  "headline": 2,
  "ref": 2,
  "valid": 2,
  "weaker": "both"
 },
 "belief": null,
 "draft": "ai"
}

Say something about it

Each verb opens a prefilled issue; a round files what lands as the ledger event it is.

comment · challenge · estimate · want